Submission #3792068
Source Code Expand
#include "bits/stdc++.h"
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()
#define chmin(a,b) a=min(a,b);
#define chmax(a,b) a=max(a,b);
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin>>N;
map<ll,int> dic;
dic[0]=1;
ll sum=0, cnt=0;
rep(i,N){
ll x; cin>>x;
sum+=x;
cnt+=dic[sum];
dic[sum]++;
}
cout1(cnt)
}
Submission Info
Submission Time |
|
Task |
A - Zero-Sum Ranges |
User |
mensan_fukuhara |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1335 Byte |
Status |
AC |
Exec Time |
86 ms |
Memory |
12800 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 |
34 ms |
3840 KB |
subtask_1_04.txt |
AC |
8 ms |
384 KB |
subtask_1_05.txt |
AC |
18 ms |
384 KB |
subtask_1_06.txt |
AC |
86 ms |
12800 KB |
subtask_1_07.txt |
AC |
30 ms |
512 KB |
subtask_1_08.txt |
AC |
20 ms |
256 KB |
subtask_1_09.txt |
AC |
14 ms |
256 KB |
subtask_1_10.txt |
AC |
82 ms |
8064 KB |
subtask_1_11.txt |
AC |
41 ms |
384 KB |
subtask_1_12.txt |
AC |
42 ms |
384 KB |
subtask_1_13.txt |
AC |
82 ms |
8064 KB |
subtask_1_14.txt |
AC |
41 ms |
384 KB |
subtask_1_15.txt |
AC |
41 ms |
384 KB |