# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402288 | nandonathaniel | Sum Zero (RMI20_sumzero) | C++14 | 752 ms | 15284 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;
typedef pair<int,int> pii;
const int MAXN=400005,LOG=4;
int kiri[MAXN],pa[LOG][MAXN],idx[MAXN],MAX;
vector<pii> V;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int N,L,R;
cin >> N;
memset(kiri,-1,sizeof(kiri));
memset(idx,-1,sizeof(idx));
long long sum=0;
V.push_back({sum,0});
for(int i=1;i<=N;i++){
cin >> L;
sum+=L;
V.push_back({sum,i});
}
sort(V.begin(),V.end());
for(int i=0;i<V.size();i++){
if(i==0 || V[i].first!=V[i-1].first)MAX++;
pa[0][V[i].second]=MAX;
}
idx[pa[0][0]]=0;
for(int i=1;i<=N;i++){
kiri[i]=idx[pa[0][i]];
idx[pa[0][i]]=i;
}
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... |