Submission #2856625
Source Code Expand
N = int(input()) A = map(int, input().split()) S = [0] for a in A: S.append(S[len(S) - 1] + a) S = sorted(S) + [None] ret = 0 cnt = 1 for i in range(1, N + 2): if S[i] != S[i - 1]: ret += cnt * (cnt - 1) // 2 cnt = 1 else: cnt += 1 print(ret)
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | wat_shun |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 302 Byte |
Status | AC |
Exec Time | 267 ms |
Memory | 26500 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 | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 3060 KB |
subtask_1_01.txt | AC | 17 ms | 3060 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | AC | 120 ms | 13536 KB |
subtask_1_04.txt | AC | 52 ms | 6976 KB |
subtask_1_05.txt | AC | 108 ms | 12532 KB |
subtask_1_06.txt | AC | 244 ms | 25952 KB |
subtask_1_07.txt | AC | 195 ms | 19216 KB |
subtask_1_08.txt | AC | 183 ms | 16428 KB |
subtask_1_09.txt | AC | 149 ms | 8144 KB |
subtask_1_10.txt | AC | 267 ms | 26500 KB |
subtask_1_11.txt | AC | 240 ms | 25224 KB |
subtask_1_12.txt | AC | 239 ms | 25108 KB |
subtask_1_13.txt | AC | 253 ms | 26448 KB |
subtask_1_14.txt | AC | 239 ms | 26364 KB |
subtask_1_15.txt | AC | 247 ms | 26328 KB |