Submission #2856534
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 | Python (3.4.3) |
Score | 0 |
Code Size | 225 Byte |
Status | TLE |
Exec Time | 2105 ms |
Memory | 27872 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 | 2940 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
sample_03.txt | AC | 17 ms | 2940 KB |
subtask_1_01.txt | AC | 17 ms | 2940 KB |
subtask_1_02.txt | AC | 17 ms | 2940 KB |
subtask_1_03.txt | TLE | 2104 ms | 13536 KB |
subtask_1_04.txt | AC | 1566 ms | 6796 KB |
subtask_1_05.txt | TLE | 2104 ms | 12520 KB |
subtask_1_06.txt | TLE | 2105 ms | 27872 KB |
subtask_1_07.txt | TLE | 2105 ms | 19088 KB |
subtask_1_08.txt | AC | 1627 ms | 16424 KB |
subtask_1_09.txt | AC | 99 ms | 7276 KB |
subtask_1_10.txt | TLE | 2105 ms | 26752 KB |
subtask_1_11.txt | TLE | 2105 ms | 26152 KB |
subtask_1_12.txt | TLE | 2105 ms | 26292 KB |
subtask_1_13.txt | TLE | 2105 ms | 26448 KB |
subtask_1_14.txt | TLE | 2105 ms | 25068 KB |
subtask_1_15.txt | TLE | 2105 ms | 25096 KB |