Submission #2426547
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#ifdef DEBUG
#include "cout11.h"
#undef NDEBUG
#endif
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
int main() {
int N = loadint();
vector<int> A(N); loadvec(A, N);
vector<ll> ac(N+1);
ac[0] = 0;
rep(i, N) ac[1+i] = ac[i] + A[i];
map<ll, int> st;
for (ll x: ac) st[x]++;
ll ans = 0LL;
for (auto p: st) {
ll sum = p.first, cnt = p.second - 1;
ans += cnt * (cnt+1) / 2;
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Zero-Sum Ranges |
User |
naoya_t |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
2174 Byte |
Status |
AC |
Exec Time |
61 ms |
Memory |
17152 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 |
1 ms |
256 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 |
24 ms |
5760 KB |
subtask_1_04.txt |
AC |
5 ms |
896 KB |
subtask_1_05.txt |
AC |
10 ms |
1792 KB |
subtask_1_06.txt |
AC |
56 ms |
17152 KB |
subtask_1_07.txt |
AC |
16 ms |
3328 KB |
subtask_1_08.txt |
AC |
12 ms |
3072 KB |
subtask_1_09.txt |
AC |
6 ms |
2944 KB |
subtask_1_10.txt |
AC |
60 ms |
12416 KB |
subtask_1_11.txt |
AC |
21 ms |
3584 KB |
subtask_1_12.txt |
AC |
21 ms |
3584 KB |
subtask_1_13.txt |
AC |
61 ms |
12544 KB |
subtask_1_14.txt |
AC |
21 ms |
3584 KB |
subtask_1_15.txt |
AC |
21 ms |
3712 KB |