Submission #2856562
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) ret = 0 for s in set(S): cnt = S.count(s) ret += cnt * (cnt - 1) / 2 print(int(ret))
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | wat_shun |
Language | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 225 Byte |
Status | TLE |
Exec Time | 2112 ms |
Memory | 104324 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 | 162 ms | 38256 KB |
sample_02.txt | AC | 163 ms | 38384 KB |
sample_03.txt | AC | 160 ms | 38256 KB |
subtask_1_01.txt | AC | 162 ms | 38256 KB |
subtask_1_02.txt | AC | 161 ms | 38256 KB |
subtask_1_03.txt | TLE | 2107 ms | 60656 KB |
subtask_1_04.txt | TLE | 2106 ms | 43844 KB |
subtask_1_05.txt | TLE | 2107 ms | 50288 KB |
subtask_1_06.txt | TLE | 2108 ms | 104324 KB |
subtask_1_07.txt | TLE | 2107 ms | 59040 KB |
subtask_1_08.txt | TLE | 2108 ms | 62048 KB |
subtask_1_09.txt | AC | 216 ms | 58972 KB |
subtask_1_10.txt | TLE | 2109 ms | 96260 KB |
subtask_1_11.txt | TLE | 2108 ms | 70128 KB |
subtask_1_12.txt | TLE | 2108 ms | 70128 KB |
subtask_1_13.txt | TLE | 2109 ms | 96260 KB |
subtask_1_14.txt | TLE | 2108 ms | 70128 KB |
subtask_1_15.txt | TLE | 2112 ms | 70128 KB |