Submission #410812

#	Time	Username	Problem	Language	Result	Execution time	Memory
410812		Jasiekstrz	Pyramid Base (IOI08_pyramid_base)	C++17	100 / 100	1358 ms	69660 KiB

pyramid_base

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=4e5;
const int P=11e5;
struct Rec
{
	int x1,x2,y1,y2;
	int val;
};
bool comp(Rec &a,Rec &b)
{
	return a.x1<b.x1;
}
Rec tab[N+10];
int pot;
int tree[2*P+10];
int upd[2*P+10];
int pref[2*P+10];
int suf[2*P+10];
bool all[2*P+10];
int clr[2*P+10];
Rec ev1[2*N+10];
void merge(int i)
{
	if(clr[2*i] && clr[2*i+1])
	{
		tree[i]=pref[i]=suf[i]=0;
		all[i]=false;
	}
	else if(clr[2*i])
	{
		tree[i]=tree[2*i+1];
		suf[i]=suf[2*i+1];
		pref[i]=0;
		all[i]=false;
	}
	else if(clr[2*i+1])
	{
		tree[i]=tree[2*i];
		suf[i]=0;
		pref[i]=pref[2*i];
		all[i]=false;
	}
	else
	{
		all[i]=(all[2*i] && all[2*i+1]);
		pref[i]=(all[2*i] ? pref[2*i]+pref[2*i+1]:pref[2*i]);
		suf[i]=(all[2*i+1] ? suf[2*i]+suf[2*i+1]:suf[2*i+1]);
		tree[i]=max({tree[2*i],tree[2*i+1],suf[2*i]+pref[2*i+1]});
	}
	return;
}
void add0(int i,int l,int r,int ls,int rs,int c)
{
	if(r<ls || rs<l)
		return;
	else if(ls<=l && r<=rs)
	{
		clr[i]+=c;
		return;
	}
	int mid=(l+r)/2;
	add0(2*i,l,mid,ls,rs,c);
	add0(2*i+1,mid+1,r,ls,rs,c);
	merge(i);
	return;
}
int solve0(int m,int n,int p)
{
	for(int i=1;i<=p;i++)
	{
		ev1[2*i-1]=ev1[2*i]=tab[i];
		ev1[2*i-1].x2=0;
		ev1[2*i].x1=ev1[2*i].x2; ev1[2*i].x2=1;
	}
	sort(ev1+1,ev1+2*p+1,comp);
	for(pot=1;pot<=n;pot*=2);
	for(int i=pot;i<=pot+n-1;i++)
	{
		tree[i]=pref[i]=suf[i]=1;
		all[i]=true;
		clr[i]=0;
	}
	for(int i=pot+n;i<2*pot;i++)
	{
		tree[i]=pref[i]=suf[i]=0;
		all[i]=false;
		clr[i]=0;
	}
	for(int i=pot-1;i>=1;i--)
		merge(i);
	int ans=0;
	for(int i=1,j=0,l=1,r=1;i<=m;i++)
	{
		while(l<=2*p && ev1[l].x1<i)
		{
			if(ev1[l].x2==1)
				add0(1,1,pot,ev1[l].y1,ev1[l].y2,-1);
			l++;
		}
		while(j<=m && tree[1]>=j-i+1 && clr[1]==0)
		{
			j++;
			while(r<=2*p && ev1[r].x1<=j)
			{
				if(ev1[r].x2==0)
					add0(1,1,pot,ev1[r].y1,ev1[r].y2,1);
				r++;
			}
		}
		ans=max(ans,j-i);
	}
	return ans;
}
void pushdown1(int i)
{
	for(int it:{2*i,2*i+1})
	{
		tree[it]+=upd[i];
		upd[it]+=upd[i];
	}
	upd[i]=0;
	return;
}
void add1(int i,int l,int r,int ls,int rs,int c)
{
	if(r<ls || rs<l)
		return;
	else if(ls<=l && r<=rs)
	{
		tree[i]+=c;
		upd[i]+=c;
		return;
	}
	pushdown1(i);
	int mid=(l+r)/2;
	add1(2*i,l,mid,ls,rs,c);
	add1(2*i+1,mid+1,r,ls,rs,c);
	tree[i]=min(tree[2*i],tree[2*i+1]);
	return;
}
bool check1(int m,int n,int b,int p,int d)
{
	for(int i=1;i<=p;i++)
	{
		ev1[2*i-1]=ev1[2*i]=tab[i];
		ev1[2*i-1].x2=0;
		ev1[2*i].x1=ev1[2*i].x2+d; ev1[2*i].x2=1;
	}
	sort(ev1+1,ev1+2*p+1,comp);
	for(int i=1;i<=n-d+1;i++)
		tree[pot+i-1]=0;
	for(int i=n-d+2;i<=pot;i++)
		tree[pot+i-1]=b+1;
	for(int i=pot-1;i>=1;i--)
		tree[i]=min(tree[2*i],tree[2*i+1]);
	for(int i=1;i<2*pot;i++)
		upd[i]=0;
	for(int i=1,it=1;i<=m;i++)
	{
		while(it<=2*p && ev1[it].x1<=i)
		{
			if(ev1[it].x2==0)
				add1(1,1,pot,max(1,ev1[it].y1-d+1),ev1[it].y2,ev1[it].val);
			else
				add1(1,1,pot,max(1,ev1[it].y1-d+1),ev1[it].y2,-ev1[it].val);
			it++;
		}
		if(d<=i && tree[1]<=b)
		{
			//cerr<<i<<" "<<tree[1]<<"\n";
			return true;
		}
	}
	return false;
}
int solve1(int m,int n,int b,int p)
{
	for(pot=1;pot<=n;pot*=2);
	int bg=0,en=min(n,m);
	while(bg<en)
	{
		int mid=(bg+en+1)/2;
		if(check1(m,n,b,p,mid))
			bg=mid;
		else
			en=mid-1;
	}
	return bg;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int m,n,b,p;
	cin>>m>>n>>b>>p;
	for(int i=1;i<=p;i++)
		cin>>tab[i].x1>>tab[i].y1>>tab[i].x2>>tab[i].y2>>tab[i].val;
	if(b==0)
		cout<<solve0(m,n,p)<<"\n";
	else
		cout<<solve1(m,n,b,p)<<"\n";
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7
• Subtask 11: 7 / 7
• Subtask 12: 7 / 7
• Subtask 13: 10 / 10
• Subtask 14: 10 / 10
• Subtask 15: 10 / 10