Submission #457457

#	Time	Username	Problem	Language	Result	Execution time	Memory
457457		AdamGS	Sum Zero (RMI20_sumzero)	C++14	61 / 100	658 ms	23240 KiB

sumzero

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=4e5+7;
int pot[6];
map<ll,ll>mp;
int main() {
        ios_base::sync_with_stdio(0); cin.tie(0);
        pot[0]=1;
        for(int i=1; i<6; ++i) pot[i]=pot[i-1]*10;
        int n;
        cin >> n;
        ll sum=0;
        int T[n+2];
        T[0]=0;
        T[n+1]=n+1;
        rep(i, n) {
                cin >> T[i+1];
                sum+=T[i+1];
        }
        for(int i=n; i>=0; --i) {
                ll a=T[i];
                T[i]=0;
                if(!mp[sum]) T[i]=n+1;
                else T[i]=mp[sum];
                mp[sum]=i;
                sum-=a;
                if(i<n) T[i]=min(T[i], T[i+1]);
        }
        mp.clear();
        int nxt[n+2][5];
        rep(i, 5) nxt[n+1][i]=n+1;
        rep(i, n+1) nxt[i][0]=T[T[T[T[T[T[T[T[T[T[i]]]]]]]]]];
        for(int j=1; j<5; ++j) {
rep(i, n+1)nxt[i][j]=nxt[nxt[nxt[nxt[nxt[nxt[nxt[nxt[nxt[nxt[i][j-1]][j-1]][j-1]][j-1]][j-1]][j-1]][j-1]][j-1]][j-1]][j-1];
        }
        int q;
        cin >> q;
        while(q--) {
                int l, r;
                cin >> l >> r; --l;
                int ans=0, i=4;
                while(i>=0) {
                        if(nxt[l][i]<=r) {
                                ans+=pot[i+1];
                                l=nxt[l][i];
                        } else --i;
                }
                while(T[l]<=r) {
                        l=T[l];
                        ++ans;
                }
                cout << ans << '\n';
        }
}

• Subtask 1: 22 / 22
• Subtask 2: 39 / 39
• Subtask 3: 0 / 39