# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1136168 | BuiDucManh123 | Sum Zero (RMI20_sumzero) | C++20 | 333 ms | 47080 KiB |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define taskname ""
using namespace std;
const int lg=20;
int n,i,j,q,ans,l,r,f[lg+9][400009];
ll a[400009];
map<ll,int>check;
int main() {
if (fopen(taskname".inp","r")) {
freopen(taskname".inp","r",stdin);
freopen(taskname".out","w",stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(i=0;i<lg;i++)
for(j=0;j<=n;j++)
f[i][j]=-1;
for(i=1;i<=n;i++){
cin>>a[i];
a[i]+=a[i-1];
if(check[a[i]]==0&&a[i]!=0) check[a[i]]=-1;
f[0][i]=max(check[a[i]],f[0][i-1]);
check[a[i]]=i;
}
for(i=1;i<lg;i++)
for(j=1;j<=n;j++){
if(f[i-1][j]!=-1){
f[i][j]=f[i-1][f[i-1][j]];
}else{
f[i][j]=-1;
}
}
cin>>q;
while(q--){
cin>>l>>r;
ans=0;
for(i=lg-1;i>=0;i--){
if(f[i][r]>=l-1){
ans+=(1<<i);
r=f[i][r];
}
}cout<<ans<<"\n";
}
return 0;
}
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... |