# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1246741 | hainam2k9 | Sum Zero (RMI20_sumzero) | C++20 | 358 ms | 28076 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][9],LG=0;
const int pow5[]={1,5,25,125,625,3125,15625,78125,390625};
map<ll,int> pos;
void calcLG(int n){
while(n>=5) ++LG, n/=5;
}
int main()
{
tt;
if(fopen((NAME + ".INP").c_str(), "r")) fo;
cin >> n;
for(int i = 1; i<=n; ++i)
cin >> a[i];
calcLG(n);
memset(nxt,0x3f,sizeof(nxt));
pos[0]=n+1;
ll sum=0;
for(int i = n; i>0; --i){
sum+=a[i];
if(pos.count(sum)) nxt[i][0]=pos[sum]-1;
nxt[i][0]=min(nxt[i][0],nxt[i+1][0]);
for(int j = 1; j<=LG; ++j){
int cur=nxt[i][j-1];
for(int k = 0; k<4; ++k)
if(cur<=n) cur=nxt[cur+1][j-1];
nxt[i][j]=cur;
}
pos[sum]=i;
}
cin >> q;
while(q--){
int l,r,rs=0;
cin >> l >> r;
for(int i = LG; i>=0; --i){
int cur=nxt[l][i],cnt=1;
if(cur>r) continue;
for(int j = 0; j<3; ++j)
if(cur<=n&&nxt[cur+1][i]<=r) ++cnt, cur=nxt[cur+1][i];
rs+=cnt*pow5[i], l=cur+1;
}
cout << rs << "\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... |