# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120980 | TadijaSebez | Pyramid Base (IOI08_pyramid_base) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=1000050;
const int M=2*N;
const int P=400050;
int root,tsz,mn[M],lzy[M],ls[M],rs[M];
void Set(int &c, int ss, int se, int qs, int qe, int f)
{
if(qs>qe || qs>se || ss>qe) return;
if(!c) c=++tsz;
if(qs<=ss && qe>=se){ lzy[c]+=f;mn[c]+=f;return;}
int mid=ss+se>>1;
Set(ls[c],ss,mid,qs,qe,f);
Set(rs[c],mid+1,se,qs,qe,f);
mn[c]=min(mn[ls[c]],mn[rs[c]])+lzy[c];
}
void Clear(){ for(int i=1;i<=tsz;i++) ls[i]=rs[i]=mn[i]=lzy[i]=0;tsz=root=0;}
struct Event
{
int tme,l,r,f;
Event(int a, int b, int c, int d):tme(a),l(b),r(c),f(d){}
bool operator < (Event b) const { return tme<b.tme;}
};
int x1[P],x2[P],y1[P],y2[P],cost[P],p,n,m,B;
bool Check(int sz)
{
Clear();
vector<Event> evs;
for(int i=1;i<=p;i++)
{
evs.pb(Event(x1[i]-sz+1,y1[i]-sz+1,y2[i],cost[i]));
evs.pb(Event(x2[i]+1,y1[i]-sz+1,y2[i],-cost[i]));
}
sort(evs.begin(),evs.end());
int lst=0;
for(int i=0;i<evs.size();i++)
{
int t=evs[i].tme-lst;
lst=evs[i].tme;
if(t>0 && lst>1 && mn[root]<=B) return 1;
Set(root,1,m-sz+1,evs[i].l,evs[i].r,evs[i].f);
if(lst>n-sz+1) break;
}
return 0;
}
int main()
{
scanf("%i %i %i %i",&n,&m,&B,&p);
for(int i=1;i<=p;i++) scanf("%i %i %i %i %i",&x1[i],&y1[i],&x2[i],&y2[i],&cost[i]);
int top=min(n,m),bot=1,mid,ans=0;
while(top>=bot)
{
mid=top+bot>>1;
if(Check(mid)) ans=mid,bot=mid+1;
else top=mid-1;
}
printf("%i\n",ans);
return 0;
}