Submission #456380

#	Time	Username	Problem	Language	Result	Execution time	Memory
456380		AdamGS	Sum Zero (RMI20_sumzero)	C++17	22 / 100	134 ms	21160 KiB

sumzero

#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") 
#pragma GCC option("arch=native","tune=native","no-zero-upper") 
#pragma GCC target("avx2","popcnt","rdrnd","bmi2")
#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, LG=20;
ll T[LIM], nxt[LIM][LG];
map<ll,ll>mp;
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n;
	cin >> n;
	ll sum=0;
	rep(i, n) {
		cin >> T[i+1];
		sum+=T[i+1];
	}
	for(int i=n; i>=0; --i) {
		if(!mp[sum]) nxt[i][0]=n+1;
		else nxt[i][0]=mp[sum];
		mp[sum]=i;
		sum-=T[i];
		if(i<n) nxt[i][0]=min(nxt[i][0], nxt[i+1][0]);
	}
	rep(i, LG) nxt[n+1][i]=n+1;
	for(int j=1; j<LG; ++j) {
		rep(i, n+1) nxt[i][j]=nxt[nxt[i][j-1]][j-1];
	}
	int q;
	cin >> q;
	while(q--) {
		int l, r;
		cin >> l >> r; --l;
		int ans=0;
		for(int i=LG-1; i>=0; --i) if(nxt[l][i]<=r) {
			ans+=1<<i;
			l=nxt[l][i];
		}
		cout << ans << '\n';
	}
}

Compilation message (stderr)

sumzero.cpp:2: warning: ignoring '#pragma GCC option' [-Wunknown-pragmas]
    2 | #pragma GCC option("arch=native","tune=native","no-zero-upper")
      |

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