제출 #1225706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225706		MuhammadSaram	Sum Zero (RMI20_sumzero)	C++20	61 / 100	293 ms	35976 KiB

sumzero

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int M = 4e5+1, lg = 19;

int nxt[M+2][3],ans[M],a[M];
pair<int,int> ind[M];
map<ll,int> mp;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(NULL), cout.tie(NULL);
	
	int n;
	cin>>n;
	ll su=0;
	mp[0]=0;
	for (int i=1;i<=n;i++)
		cin>>a[i],su+=a[i],mp[su]=0;
	int id=0;
	for (auto [i,j]:mp) ind[id]={-1,-1},mp[i]=id++;
	set<int> se={n+1};
	for (int i=n+1;i>=1;i--)
	{
		id=mp[su];
		ind[id].second=ind[id].first,ind[id].first=i-1;
		if (~ind[id].second) se.insert(ind[id].second);
		nxt[i][2]=*se.begin();
		su-=a[i-1];
	}
	mp.clear(),se.clear();
	nxt[n+2][2]=n+1;
	int q;
	cin>>q;
	int l[q],r[q];
	for (int i=0;i<q;i++)
		cin>>l[i]>>r[i];
	for (int lim=lg-1;lim>=0;lim--)
	{
		for (int i=1;i<=n+2;i++)
			nxt[i][0]=nxt[i][2];
		for (int p=1;p<=lim;p++)
			for (int i=1;i<=n+2;i++)
				nxt[i][p%2]=nxt[nxt[i][1-p%2]+1][1-p%2];
		for (int i=0;i<q;i++)
			if (nxt[l[i]][lim%2]<=r[i])
				ans[i]+=(1<<lim),l[i]=nxt[l[i]][lim%2]+1;
	}
	for (int i=0;i<q;i++)
		cout<<ans[i]<<'\n';
	
	return 0;
}

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