# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404871 | Pyqe | Sum Zero (RMI20_sumzero) | C++11 | 562 ms | 16676 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fr first
#define sc second
int n,nn=0,pr[400069][5];
pair<long long,int> a[400069];
int main()
{
int t,rr,i,j,k,l,sz,z;
long long sm=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&k);
sm+=k;
a[i]={sm,i};
}
a[n+1]={0,0};
sort(a+1,a+n+2);
for(i=1;i<=n;i++)
{
if(a[i].fr==a[i+1].fr)
{
nn++;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |