# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
643281 | Kripton | Sum Zero (RMI20_sumzero) | C++14 | 433 ms | 18232 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>
#pragma GCC optimize("Ofast")
#pragma GCC pack(1)
using namespace std;
pair <long long,int> sum[400001];
int last[400001];
int best[5][400001];
int put[5];
bitset <400001> fraud;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,x,i,j;
//cout << sizeof(pair<long long, int>)<<'\n';
long long s=0;
cin>>n;
put[0]=1;
for(i=1;i<=4;i++)
put[i]=16*put[i-1];
//cout<<put[4]<<'\n';
best[0][0]=-1;
for(i=1;i<=n;i++)
{
cin>>x;
s+=x;
sum[i]={s,i};
}
sort(sum,sum+n+1);
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... |