Submission #525353

#	Time	Username	Problem	Language	Result	Execution time	Memory
525353		Koosha_mv	Food Court (JOI21_foodcourt)	C++14	100 / 100	954 ms	66704 KiB

foodcourt

#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll

const int N=3e5+99,inf=1e15,mv=54457;

int n,m,q,a[N],b[N],c[N],k[N],type[N],ans[N],seg[2][N<<2],lazy[2][N<<2];
vector<int> ad[N],dl[N],Q[N];

void shift(int ,int ,int ,int );

void add(int L,int R,int val,int s,int id=1,int l=1,int r=q+1){
	if(r<=L || R<=l) return ;
	if(L<=l && r<=R){
		//cout<<l<<" "<<r<<" "<<val<<endl;
		seg[s][id]+=val;
		lazy[s][id]+=val;
		return ;
	}
	int mid=(l+r)>>1;
	shift(id,l,r,s);
	add(L,R,val,s,id<<1,l,mid);
	add(L,R,val,s,id<<1|1,mid,r);
	seg[s][id]=min(seg[s][id<<1],seg[s][id<<1|1]);
}
int query(int L,int R,int s,int id=1,int l=1,int r=q+1){
	if(r<=L || R<=l) return inf;
	if(L<=l && r<=R){
		return seg[s][id];
	}
	int mid=(l+r)>>1;
	shift(id,l,r,s);
	return min(query(L,R,s,id<<1,l,mid),query(L,R,s,id<<1|1,mid,r));
}
void shift(int id,int l,int r,int s){
	int mid=(l+r)>>1;
	/*lazy[s][id<<1]+=lazy[s][id];
	lazy[s][id<<1|1]+=lazy[s][id];
	
	seg[s][id<<1]+=lazy[s][id];
	seg[s][id<<1|1]+=lazy[s][id];*/
	add(l,mid,lazy[s][id],s,id<<1,l,mid);
	add(mid,r,lazy[s][id],s,id<<1|1,mid,r);
	lazy[s][id]=0;
}
int pur(int x,int id=1,int l=1,int r=q+1){
	if(l+1==r){
		//eror(seg[1][id]);
		//eror(l);
		return l;
	}
	int mid=(l+r)>>1;
	shift(id,l,r,1);	
	if(-(seg[1][id<<1])<x) return pur(x,id<<1|1,mid,r);
	return pur(x,id<<1,l,mid);
}

main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	cin>>n>>m>>q;
	f(i,1,q+1){
		cin>>type[i];
		if(type[i]==1){
			cin>>a[i]>>b[i]>>c[i]>>k[i];
			if(b[i]<mv || mv<a[i]){
			//	eror(100);
			}
			ad[a[i]].pb(i);
			dl[b[i]].pb(i);
		}
		if(type[i]==2){
			cin>>a[i]>>b[i]>>k[i];
			if(b[i]<mv || mv<a[i]){
			//	eror(100);
			}
			ad[a[i]].pb(i);
			dl[b[i]].pb(i);
		}
		if(type[i]==3){
			cin>>a[i]>>b[i];
			Q[a[i]].pb(i);
		}
	}
	f(i,1,n+1){
		for(auto x : ad[i]){
			if(type[x]==1){
				add(x,q+1,k[x],0);
				add(x,q+1,-k[x],1);
			}
			if(type[x]==2){
				add(x,q+1,-k[x],0);
			}
		}
		for(auto x : Q[i]){
			//if(x!=3) continue ;
			int res=query(x,x+1,0)-min(0ll,query(1,x+1,0)),cnt=(-query(x,x+1,1))-res+b[x];
			if(b[x]>res){
				ans[x]=0;
				continue ;
			}
			ans[x]=pur(cnt);
			//cout<<x<<" -> "<<query(x,x+1,0)<<" "<<min(0ll,query(1,x+1,0))<<" "<<cnt<<" "<<ans[x]<<endl;
		}
		for(auto x : dl[i]){
			if(type[x]==1){
				add(x,q+1,-k[x],0);
				add(x,q+1,k[x],1);
			}
			if(type[x]==2){
				add(x,q+1,k[x],0);
			}
		}
	}
	f(i,1,q+1){
		if(type[i]==3){
			cout<<c[ans[i]]<<" ";
		}
	}
}
/*
183326 218318 6
1 29240 156379 22166 957318472
1 14054 181502 82845 97183925
1 35854 69866 32334 322730299
1 1384 7230 115069 454256926
1 44192 158235 8750 84192710
3 54457 1077490708

183326 218318 5
1 29240 156379 22166 957318472
1 14054 181502 82845 97183925
1 35854 69866 32334 322730299
1 44192 158235 8750 84192710
3 54457 1077490708

3 5 7
1 2 3 5 2
1 1 2 2 4
3 2 3
2 1 3 3
3 1 2
1 2 3 4 2
3 3 2
*/

Compilation message (stderr)

foodcourt.cpp:77:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   77 | main(){
      | ^~~~

• Subtask 1: 2 / 2
• Subtask 2: 5 / 5
• Subtask 3: 7 / 7
• Subtask 4: 21 / 21
• Subtask 5: 15 / 15
• Subtask 6: 13 / 13
• Subtask 7: 26 / 26
• Subtask 8: 11 / 11