Submission #3791490
Source Code Expand
from collections import Counter n=int(input()) a=list(map(int,input().split())) s=[] s.append(0) for i in range(n): s.append(s[i]+a[i]) s.sort() a=Counter(s).most_common() #print(a) ans=0 for i in range(len(a)): ans += ((a[i][1]-1)*a[i][1])//2 print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | tomo0608 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 275 Byte |
Status | AC |
Exec Time | 371 ms |
Memory | 48752 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 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 | 21 ms | 3316 KB |
sample_02.txt | AC | 22 ms | 3316 KB |
sample_03.txt | AC | 21 ms | 3316 KB |
subtask_1_01.txt | AC | 22 ms | 3316 KB |
subtask_1_02.txt | AC | 21 ms | 3316 KB |
subtask_1_03.txt | AC | 140 ms | 19152 KB |
subtask_1_04.txt | AC | 52 ms | 6568 KB |
subtask_1_05.txt | AC | 100 ms | 11900 KB |
subtask_1_06.txt | AC | 371 ms | 48752 KB |
subtask_1_07.txt | AC | 168 ms | 15356 KB |
subtask_1_08.txt | AC | 149 ms | 13436 KB |
subtask_1_09.txt | AC | 105 ms | 6896 KB |
subtask_1_10.txt | AC | 314 ms | 37320 KB |
subtask_1_11.txt | AC | 210 ms | 24732 KB |
subtask_1_12.txt | AC | 211 ms | 24716 KB |
subtask_1_13.txt | AC | 315 ms | 37732 KB |
subtask_1_14.txt | AC | 211 ms | 24708 KB |
subtask_1_15.txt | AC | 209 ms | 24720 KB |