Submission #3791434
Source Code Expand
n=int(input()) a=list(map(int,input().split())) sum=[] sum.append(0) for i in range(n): sum.append(sum[i]+a[i]) sum.sort() ans=set(sum) print(len(sum)-len(ans))
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | tomo0608 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 172 Byte |
Status | WA |
Exec Time | 202 ms |
Memory | 33516 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3060 KB |
sample_02.txt | WA | 18 ms | 3060 KB |
sample_03.txt | AC | 18 ms | 3060 KB |
subtask_1_01.txt | AC | 18 ms | 3060 KB |
subtask_1_02.txt | AC | 18 ms | 2940 KB |
subtask_1_03.txt | WA | 94 ms | 13396 KB |
subtask_1_04.txt | WA | 45 ms | 6184 KB |
subtask_1_05.txt | WA | 91 ms | 11524 KB |
subtask_1_06.txt | AC | 202 ms | 33516 KB |
subtask_1_07.txt | WA | 151 ms | 14788 KB |
subtask_1_08.txt | WA | 138 ms | 12552 KB |
subtask_1_09.txt | WA | 97 ms | 6488 KB |
subtask_1_10.txt | WA | 200 ms | 27360 KB |
subtask_1_11.txt | WA | 191 ms | 24076 KB |
subtask_1_12.txt | WA | 189 ms | 24080 KB |
subtask_1_13.txt | WA | 200 ms | 26972 KB |
subtask_1_14.txt | WA | 195 ms | 22900 KB |
subtask_1_15.txt | WA | 190 ms | 22888 KB |