Submission #3791415
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]) #print(sum) ans=0 for i in range(n+1): for j in range(i+1,n+1): if sum[j]-sum[i]==0: ans +=1 print(ans)
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | tomo0608 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 255 Byte |
Status | TLE |
Exec Time | 2105 ms |
Memory | 26000 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 | 18 ms | 2940 KB |
sample_03.txt | AC | 18 ms | 2940 KB |
subtask_1_01.txt | AC | 18 ms | 3064 KB |
subtask_1_02.txt | AC | 18 ms | 3064 KB |
subtask_1_03.txt | TLE | 2104 ms | 13148 KB |
subtask_1_04.txt | TLE | 2104 ms | 6440 KB |
subtask_1_05.txt | TLE | 2104 ms | 11596 KB |
subtask_1_06.txt | TLE | 2105 ms | 26000 KB |
subtask_1_07.txt | TLE | 2105 ms | 14156 KB |
subtask_1_08.txt | TLE | 2105 ms | 12244 KB |
subtask_1_09.txt | TLE | 2104 ms | 7148 KB |
subtask_1_10.txt | TLE | 2105 ms | 25976 KB |
subtask_1_11.txt | TLE | 2105 ms | 22888 KB |
subtask_1_12.txt | TLE | 2105 ms | 22764 KB |
subtask_1_13.txt | TLE | 2105 ms | 25596 KB |
subtask_1_14.txt | TLE | 2104 ms | 22904 KB |
subtask_1_15.txt | TLE | 2105 ms | 24076 KB |