Submission #171580

#	Time	Username	Problem	Language	Result	Execution time	Memory
171580		MvC	Cake (CEOI14_cake)	C++11	100 / 100	1485 ms	18556 KiB

cake

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=3e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,j,e,st,ed,p,sg[4*nmax],q,mx,a[nmax],vl;
char c;
vector<pair<int,int> >vc;
set<pair<int,int> >s;
set<pair<int,int> >::iterator it;
void upd(int x,int l,int r,int p,int v)
{
	if(l==r)
	{
		sg[x]=v;
		return;
	}
	int mid=(l+r)/2;
	if(p<=mid)upd(2*x,l,mid,p,v);
	else upd(2*x+1,mid+1,r,p,v);
	sg[x]=max(sg[2*x],sg[2*x+1]);
}
int qry(int x,int l,int r,int tl,int tr)
{
	if(tl>r || l>tr)return 0;
	if(tl<=l && r<=tr)return sg[x];
	int mid=(l+r)/2;
	return max(qry(2*x,l,mid,tl,tr),qry(2*x+1,mid+1,r,tl,tr));
}
int lft(int x,int l,int r,int tl,int tr,int v)
{
	if(l>r || tl>tr)return -1;
	if(sg[x]<v)return -1;
	if(l==r)return l;
	int mid=(l+r)/2,rt=-1;
	if(tl<=l && r<=tr)
	{
		if(sg[2*x+1]>v)return lft(2*x+1,mid+1,r,tl,tr,v);
		if(sg[2*x]>v)return lft(2*x,l,mid,tl,tr,v);
		return -1;
	}
	if(tr>mid)rt=lft(2*x+1,mid+1,r,tl,tr,v);
	if(tl<=mid && rt==-1)rt=lft(2*x,l,mid,tl,tr,v);
	return rt;
}
int rgt(int x,int l,int r,int tl,int tr,int v)
{
	if(l>r || tl>tr)return -1;
	if(sg[x]<v)return -1;
	if(l==r)return l;
	int mid=(l+r)/2,rt=-1;
	if(tl<=l && r<=tr)
	{
		if(sg[2*x]>v)return rgt(2*x,l,mid,tl,tr,v);
		if(sg[2*x+1]>v)return rgt(2*x+1,mid+1,r,tl,tr,v);
		return -1;
	}
	if(tl<=mid)rt=rgt(2*x,l,mid,tl,tr,v);
	if(tr>mid && rt==-1)rt=rgt(2*x+1,mid+1,r,tl,tr,v);
	return rt;
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>st;
	for(i=1;i<=n;i++)
	{
		cin>>a[i];
		s.in(mkp(a[i],i));
		upd(1,1,n,i,a[i]);
	}
	cin>>q;
	while(q--)
	{
		cin>>c;
		if(c=='E')
		{
			cin>>i>>e;
			vc.clear();
			it=s.end(),it--;
			for(j=1;j<e;j++)vc.pb(*it),it--;
			vc.pb(mkp(a[i],i));
			reverse(vc.begin(),vc.end());
			it=s.end(),it--;
			vl=(it->fr)+1;
			for(j=0;j<e;j++)s.er(s.fd(vc[j]));
			vc[0].fr=vl;
			for(j=1;j<e;j++)vc[j].fr=vc[j-1].fr+1;
			for(j=0;j<e;j++)
			{
				s.in(vc[j]);
				upd(1,1,n,vc[j].sc,vc[j].fr);
				a[vc[j].sc]=vc[j].fr;
			}
			//for(j=1;j<=n;j++)cout<<a[j]<<" ";
			//cout<<endl;
		}
		else
		{
			cin>>ed;
			if(ed==st)cout<<0<<'\n';
			else if(ed<st)
			{
				mx=qry(1,1,n,ed,st-1);
				p=rgt(1,1,n,st+1,n,mx);
				if(p==-1)p=n+1;
				cout<<p-ed-1<<'\n';
			}
			else
			{
				mx=qry(1,1,n,st+1,ed);
				p=lft(1,1,n,1,st-1,mx);
				if(p==-1)p=0;
				cout<<ed-p-1<<'\n';
			}
		}
	}
	return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50