# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1246713 | hainam2k9 | Sum Zero (RMI20_sumzero) | C++20 | 15 ms | 31808 KiB |
#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 4e5+5;
const string NAME = "";
int n,q,a[MAXN],nxt[MAXN][20];
map<ll,int> pos;
int query(int l, int r){
int rs=0;
for(int i = __lg(n); i>=0; --i)
if(nxt[l][i]<=r) rs|=1<<i, l=nxt[l][i]+1;
return rs;
}
int main()
{
tt;
if(fopen((NAME + ".INP").c_str(), "r")) fo;
cin >> n;
for(int i = 1; i<=n; ++i)
cin >> a[i];
memset(nxt,0x3f,sizeof(nxt));
ll sum=0;
for(int i = n; i>0; --i){
sum+=a[i];
nxt[i][0]=(pos[sum]==0 ? n : pos[sum]-1);
nxt[i][0]=min(nxt[i][0],nxt[i+1][0]);
pos[sum]=i;
for(int j = 1; j<=__lg(n); ++j)
if(nxt[i][j-1]<n) nxt[i][j]=nxt[nxt[i][j-1]+1][j-1];
}
cin >> q;
while(q--){
int l,r;
cin >> l >> r;
cout << query(l,r) << "\n";
}
}
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... |