Submission #639694

#	Time	Username	Problem	Language	Result	Execution time	Memory
639694		maomao90	Sum Zero (RMI20_sumzero)	C++17	0 / 100	15 ms	21076 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;
int c[MAXN];
ii lr[MAXN];
map<ll, int> lst;
vii rgs, orgs;
int p[MAXN];
vi adj[MAXN];
int ans[MAXN];

vi ask[MAXN];
bool vis[MAXN];
vi stk;
void dfs(int u) {
    stk.pb(u);
    for (int i : ask[u]) {
	int lo = 0, hi = SZ(stk) - 1;
	while (lo < hi) {
	    int mid = lo + hi + 1 >> 1;
	    if (rgs[stk[mid]].SE <= lr[i].SE) {
		lo = mid;
	    } else {
		hi = mid - 1;
	    }
	}
	ans[i] = lo + (rgs[stk[lo]].SE <= lr[i].SE);
    }
    for (int v : adj[u]) {
	vis[v] = 1;
	dfs(v);
    }
    stk.pop_back();
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 1, n + 1) {
	cin >> c[i];
    }
    ll sm = 0;
    REP (i, 0, n + 1) {
	sm += c[i];
	if (lst.find(sm) != lst.end()) {
	    rgs.pb({lst[sm], i});
	}
	lst[sm] = i;
    }
    cin >> q;
    REP (i, 1, q + 1) {
	cin >> lr[i].FI >> lr[i].SE;
	lr[i].FI--;
	orgs.pb({-i, lr[i].FI});
    }
    sort(ALL(rgs), [&] (ii l, ii r) {
	    return l.SE < r.SE;
	    });
    sort(ALL(orgs), [&] (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[ptr] = i;
	    ptr++;
	}
    }
    int optr = 0;
    REP (i, 0, SZ(rgs)) {
	while (optr < SZ(orgs) && orgs[ptr].SE <= rgs[i].FI) {
	    ask[i].pb(optr);
	    optr++;
	}
    }
    REP (i, 0, SZ(rgs)) {
	adj[p[i]].pb(i);
    }
    RREP (i, SZ(rgs) - 1, 0) {
	if (vis[i]) {
	    continue;
	}
	vis[i] = 1;
	dfs(i);
    }
    REP (i, 1, q + 1) {
	cout << ans[i] << '\n';
    }
    return 0;
}

Compilation message (stderr)

sumzero.cpp: In function 'void dfs(int)':
sumzero.cpp:55:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |      int mid = lo + hi + 1 >> 1;
      |                ~~~~~~~~^~~

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