Submission #639692

#	Time	Username	Problem	Language	Result	Execution time	Memory
639692		maomao90	Sum Zero (RMI20_sumzero)	C++17	0 / 100	29 ms	63316 KiB

sumzero

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
 
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
 
#ifndef DEBUG
#define cerr if (0) cerr
#endif
 
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 400005;
const int MAXL = 20;

int n, q;
ll c[MAXN];
ii lr[MAXN];
map<ll, int> lst;
int p[MAXL][MAXN * 2];
int st[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
	cin >> c[i];
	c[i] += c[i - 1];
    }
    vii rgs;
    REP (i, 0, n + 1) {
	if (lst.find(c[i]) != lst.end()) {
	    rgs.pb({lst[c[i]], i});
	}
	lst[c[i]] = i;
    }
    cin >> q;
    REP (i, 1, q + 1) {
	cin >> lr[i].FI >> lr[i].SE;
	lr[i].FI--;
	rgs.pb({-i, lr[i].FI});
    }
    sort(ALL(rgs), [&] (ii l, ii r) {
	    return l.SE < r.SE;
	    });
    int ptr = 0;
    memset(p, -1, sizeof p);
    REP (i, 0, SZ(rgs)) {
	while (ptr < i && rgs[ptr].SE <= rgs[i].FI) {
	    p[0][ptr] = i;
	    ptr++;
	}
    }
    REP (i, 0, SZ(rgs)) {
	cerr << rgs[i].FI << ' ' << rgs[i].SE << ": " << p[0][i] << '\n';
    }
    REP (k, 1, MAXL) {
	REP (i, 0, SZ(rgs)) {
	    if (p[k - 1][i] == -1) {
		p[k][i] = -1;
	    } else {
		p[k][i] = p[k - 1][p[k - 1][i]];
	    }
	}
    }
    REP (i, 0, SZ(rgs)) {
	if (rgs[i].FI < 0) {
	    st[-rgs[i].FI] = p[0][i];
	}
    }
    REP (i, 1, q + 1) {
	auto [l, r] = lr[i];
	int u = st[i];
	if (u == -1 || rgs[u].SE > r) {
	    cout << 0 << '\n';
	    continue;
	}
	int ans = 0;
	RREP (k, MAXL - 1, 0) {
	    if (p[k][u] == -1) {
		continue;
	    }
	    if (rgs[p[k][u]].SE <= r) {
		ans += 1 << k;
		u = p[k][u];
	    }
	}
	cout << ans + 1 << '\n';
    }
    return 0;
}

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