Submission #947870

#	Time	Username	Problem	Language	Result	Execution time	Memory
947870		pcc	Sum Zero (RMI20_sumzero)	C++17	61 / 100	251 ms	27924 KiB

sumzero

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int B = 18;
const int mxn = 4e5+10;
int N,Q;
map<ll,int> mp;
int dp[2][mxn];
int arr[mxn];
int ans[mxn];
pii req[mxn];

void calc(int lvl){
	bool roll = 0;
	for(int i = 1;i<=N+1;i++)dp[roll][i] = arr[i];
	dp[roll][mxn-1] = mxn-1;
	for(int i = 0;i<lvl;i++){
		roll ^= 1;
		for(int j = N+1;j>=0;j--){
			dp[roll][j] = dp[roll^1][dp[roll^1][j]];
		}
		dp[roll][mxn-1] = mxn-1;
	}
	for(int i = 1;i<=Q;i++){
		auto &[s,e] = req[i];
		if(dp[roll][s]<=e+1){
			ans[i] += 1<<lvl;
			s = dp[roll][s];
		}
	}
	return;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N;
	for(int i = 1;i<=N;i++){
		cin>>arr[i];
	}
	int mn = mxn-1;
	ll sum = 0;
	for(int i = N+1;i>=1;i--){
		sum += arr[i];
		if(mp.find(sum) != mp.end())mn = min(mn,mp[sum]);
		mp[sum] = i;
		arr[i] = mn;
	}
	cin>>Q;
	for(int i = 1;i<=Q;i++){
		cin>>req[i].fs>>req[i].sc;
	}
	for(int i = B-1;i>=0;i--)calc(i);
	for(int i = 1;i<=Q;i++){
		cout<<ans[i]<<'\n';
	}
	return 0;
}

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