| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1355519 | ElayV13 | Sum Zero (RMI20_sumzero) | C++20 | 6 ms | 508 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=400001;
int n,q;
int a[N];
int f[N];
signed main(){
cin>>n;
for(int i=1;i<=n;i++) f[i]=-1;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++){
int sum=0;
for(int j=i;j<=n;j++){
sum+=a[j];
if(!sum){
f[i]=j;
break;
}
}
}
cin>>q;
while(q--){
int l,r;
cin>>l>>r;
int res=0;
while(l<=r){
if(f[l]==-1) ++l;
else{
l=f[l]+1;
if(l-1<=r) ++res;
}
}
cout<<res<<'\n';
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
