# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
534482 | amunduzbaev | Sum Zero (RMI20_sumzero) | C++17 | 1029 ms | 35992 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 ar array
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
vector<vector<int>> par(n + 1, vector<int>(6, -1));
map<long long, int> last;
long long pref = 0; last[pref] = n;
for(int i=n-1;~i;i--){
pref += a[i];
if(last.count(pref)) par[i][0] = last[pref];
last[pref] = i;
if(i + 1 < n && ~par[i+1][0]){
if(par[i][0] == -1) par[i][0] = par[i+1][0];
else par[i][0] = min(par[i][0], par[i+1][0]);
}
}
for(int j=1;j<6;j++){
for(int i=0;i<n;i++){
int x = i;
for(int l=0;l<8 && ~x;l++){
x = par[x][j-1];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |