Submission #402246

#	Time	Username	Problem	Language	Result	Execution time	Memory
402246		nandonathaniel	Sum Zero (RMI20_sumzero)	C++14	61 / 100	643 ms	21700 KiB

sumzero

#include<bits/stdc++.h>
using namespace std;
typedef pair<long long,int> pii;
const int MAXN=400005,LOG=4;
int kiri[MAXN],enter[MAXN],pa[LOG][MAXN],MAX,idx[MAXN],pref[MAXN];
vector<pii> V;
 
int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int N,Q,L,R,A;
	cin >> N;
	memset(kiri,-1,sizeof(kiri));
	memset(idx,-1,sizeof(idx));
	long long sum=0;
	V.push_back({sum,0});
	for(int i=1;i<=N;i++){
		cin >> A;
		sum+=A;
		V.push_back({sum,i});
	}
	sort(V.begin(),V.end());
	for(int i=0;i<V.size();i++){
		if(i==0 || V[i].first!=V[i-1].first)MAX++;
		pref[V[i].second]=MAX;
	}
	idx[pref[0]]=0;
	for(int i=1;i<=N;i++){
		kiri[i]=idx[pref[i]];
		idx[pref[i]]=i;
	}
	int mini=N+1;
	for(int i=N;i>=0;i--){
		//find j minimum st j>i and kiri[j]>=i
		if(enter[i])mini=min(mini,enter[i]);
		pa[0][i]=mini;
		for(int j=1;j<LOG;j++){
			pa[j][i]=pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][i]]]]]]]]]]]]]]]]]]]]]]]]]]];
			if(pa[j][i]==0)pa[j][i]=N+1;
		}
		if(kiri[i]!=-1)enter[kiri[i]]=i;
	}
	cin >> Q;
	while(Q--){
		cin >> L >> R;
		int ans=0,now=pa[0][L-1];
		if(now>R){
			cout << 0 << '\n';
			continue;
		}
		int pkt=1;
		for(int i=1;i<=LOG-1;i++)pkt*=27;
		for(int i=LOG-1;i>=0;i--){
			for(int j=0;j<27;j++){
				if(pa[i][now]<=R){
					ans+=pkt;
					now=pa[i][now];
				}
			}
			pkt/=27;
		}
		cout << ans+1 << '\n';
	}
	return 0;
}

Compilation message (stderr)

sumzero.cpp: In function 'int main()':
sumzero.cpp:22:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for(int i=0;i<V.size();i++){
      |              ~^~~~~~~~~

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