Submission #853891

#	Time	Username	Problem	Language	Result	Execution time	Memory
853891		divad	Sum Zero (RMI20_sumzero)	C++14	61 / 100	233 ms	15956 KiB

sumzero

#include <bits/stdc++.h>
#define ends saradanciu
using namespace std;
const int LMAX = 20;
const int NMAX = 1e5+2;
int n,q,c[NMAX],x,y,nxt[LMAX][NMAX],vf[NMAX];
int ends[NMAX];

int main()
{
    cin >> n;
    map<int, int> mp;
    int pref = 0;
    mp[pref] = 0;
    for(int i = 1; i <= n; i++){
        cin >> c[i];
        pref += c[i];
        if(mp.count(pref)){
            ends[mp[pref]+1] = i;
        }
        mp[pref] = i;
    }
    set<int> s;
    s.insert(n+1);
    nxt[0][n+1] = n+2;
    for(int i = n; i >= 1; i--){
        if(ends[i] != 0){
            s.insert(ends[i]);
        }
        nxt[0][i] = *s.lower_bound(i)+1;
    }
    for(int j = 1; j < LMAX; j++){
        for(int i = n+1; i >= 1; i--){
            nxt[j][i] = nxt[j-1][nxt[j-1][i]];
        }
        for(int i = 1; i <= n+1; i++){
            if(nxt[j][i] == 0){
                nxt[j][i] = n+2;
            }
        }
    }
    cin >> q;
    while(q--){
        cin >> x >> y;
        int ans = 0;
        for(int i = LMAX-1; i >= 0; i--){
            if(nxt[i][x]-1 <= y){
                ans += (1<<i);
                x = nxt[i][x];
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

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