| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1332512 | lnt314 | Sum Zero (RMI20_sumzero) | C++20 | 420 ms | 42260 KiB |
// Frozen Forest (")>
#include <bits/stdc++.h>
#define NAME ""
#define ll long long
#define fi first
#define se second
#define vec vector
#define ALL(x) (x).begin(),(x).end()
#define SZ(x) ((int)x.size())
using namespace std;
const int N=4e5+5;
int n,q;
int c[N];
void INIT(){
cin>>n;
for(int i=1;i<=n;i++) cin>>c[i];
cin>>q;
}
vec<ll> ps;
vec<int> op;
vec<vec<int>> jp;
void SOLVE(){
ps=vec<ll>(n+5,0);
for(int i=1;i<=n;i++) ps[i]=ps[i-1]+c[i];
map<ll,int> las;
las[0]=0;
op=vec<int>(n+5,n+1);
for(int i=1;i<=n;i++){
if(las.find(ps[i])!=las.end()){
op[las[ps[i]]+1]=i;
}
las[ps[i]]=i;
}
vec<ll>().swap(ps);
map<ll,int>().swap(las);
jp=vec<vec<int>>(__lg(n)+5,vec<int>(n+5,n+1));
for(int i=n;i>0;i--){
jp[0][i]=min(jp[0][i+1],op[i]);
}
vec<int>().swap(op);
for(int j=1;(1<<j)<=n;j++){
for(int i=0;i<=n;i++){
jp[j][i]=jp[j-1][jp[j-1][i]+1];
}
}
while(q--){
int l,r;
cin>>l>>r;
int ans=0,u=l;
for(int i=SZ(jp)-1;i>=0;i--){
if(jp[i][u]>r) continue;
u=jp[i][u]+1;
ans+=(1<<i);
}
cout<<ans<<'\n';
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen(NAME ".inp","r")){
freopen(NAME ".inp","r",stdin);
freopen(NAME ".out","w",stdout);
}
INIT();SOLVE();
}
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... | ||||
