Submission #3791091
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define ll long long int main(){ int n; cin>>n; ll a[n],s[n+1]; s[0]=0; for(int i=0;i<n;i++){ cin>>a[i]; s[i+1]=a[i]+s[i]; } sort(s,s+n+1); ll b=s[0],c=0,d=1; for(int i=1;i<=n;i++){ if(b==s[i]) d++; else{ c+=d*(d-1)/2; d=1; b=s[i]; } } c+=d*(d-1)/2; cout<<c; }
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | occhan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 406 Byte |
Status | AC |
Exec Time | 96 ms |
Memory | 3328 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 | 8 ms | 636 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 44 ms | 1664 KB |
subtask_1_04.txt | AC | 11 ms | 768 KB |
subtask_1_05.txt | AC | 26 ms | 1536 KB |
subtask_1_06.txt | AC | 96 ms | 3328 KB |
subtask_1_07.txt | AC | 46 ms | 3328 KB |
subtask_1_08.txt | AC | 42 ms | 3328 KB |
subtask_1_09.txt | AC | 36 ms | 3328 KB |
subtask_1_10.txt | AC | 95 ms | 3328 KB |
subtask_1_11.txt | AC | 57 ms | 3328 KB |
subtask_1_12.txt | AC | 57 ms | 3328 KB |
subtask_1_13.txt | AC | 94 ms | 3328 KB |
subtask_1_14.txt | AC | 58 ms | 3328 KB |
subtask_1_15.txt | AC | 59 ms | 3328 KB |