Submission #422072

#	Time	Username	Problem	Language	Result	Execution time	Memory
422072		errorgorn	Food Court (JOI21_foodcourt)	C++17	100 / 100	791 ms	62084 KiB

foodcourt

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ii pair<ll,ll>
#define fi first
#define se second
#define endl '\n'

#define puf push_front
#define pof pop_front
#define pub push_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound

#define rep(x,s,e) for (auto x=s-(s>e);x!=e-(s>e);s<e?x++:x--)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int) (x).size()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll INF=1e18;

struct node{
	int s,e,m;
	ll val=0,lazy=0;
	node *l,*r;
	
	node (int _s,int _e){
		s=_s,e=_e,m=s+e>>1;
		
		if (s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	
	void propo(){
		if (lazy){
			val+=lazy;
			if (s!=e){
				l->lazy+=lazy;
				r->lazy+=lazy;
			}
			lazy=0;
		}
	}
	
	void update(int i,int j,ll k){
		if (s==i && e==j) lazy+=k;
		else{
			if (j<=m) l->update(i,j,k);
			else if (m<i) r->update(i,j,k);
			else l->update(i,m,k),r->update(m+1,j,k);
			
			l->propo(),r->propo();
			val=min(l->val,r->val);
		}
	}
	
	ll query(int i,int j){
		propo();
		
		if (s==i && e==j) return val;
		else if (j<=m) return l->query(i,j);
		else if (m<i) return r->query(i,j);
		else return min(l->query(i,m),r->query(m+1,j));
	}
} *root=new node(0,250005);

ll fen[250005];

void add(ll i,ll j){
	while (i<250005){
		fen[i]+=j;
		i+=i&-i;
	}
}

ll query(int i){
	ll res=0;
	while (i){
		res+=fen[i];
		i-=i&-i;
	}
	return res;
}

ll search(ll i){
	int curr=0;
	for (int u=1<<17;u;u>>=1){
		if (curr+u<250005 && fen[curr+u]<=i){
			curr+=u;
			i-=fen[curr];
		}
	}
	
	return curr;
}

struct upd{
	ll pos;
	ll t;
	ll num;
	int typ;
};

int n,m,q;
vector<upd> u;
vector<ii> qu[250005]; //(length,time)

int id[250005];

ll ans[250005];

int main(){
	cin.tie(0);
	cout.tie(0);
	cin.sync_with_stdio(false);
	
	memset(ans,-1,sizeof(ans));
	
	cin>>n>>m>>q;
	
	ll a,b,c,d;
	rep(x,1,q+1){
		cin>>a;
		
		if (a==1){
			cin>>a>>b>>c>>d;
			
			u.pub(upd({a,x,d,1}));
			u.pub(upd({b+1,x,-d,1}));
			
			id[x]=c;
		}
		else if (a==2){
			cin>>a>>b>>c;
		
			u.pub(upd({a,x,-c,0}));
			u.pub(upd({b+1,x,c,0}));
		}
		else{
			cin>>a>>b;
			qu[a].pub(ii(b,x));
		}
	}
	
	sort(all(u),[](upd i,upd j){
		return i.pos>j.pos;
	});
	
	rep(x,1,n+1){
		while (!u.empty() && u.back().pos==x){
			//cout<<"update: "<<u.back().t<<" "<<u.back().num<<endl;
			root->update(u.back().t,250005,u.back().num);
			if (u.back().typ) add(u.back().t,u.back().num);
			u.pob();
		}
		
		for (auto &it:qu[x]){
			ll num=root->query(it.se,it.se)-root->query(0,it.se);
			
			//cout<<it.se<<" "<<num<<endl;
			
			if (num<it.fi) ans[it.se]=0;
			else{
				ll tot=query(it.se);
				
				//cout<<tot<<" "<<num<<" "<<it.fi<<endl;
				it.fi+=tot-num;
				
				int temp=search(it.fi-1);
				//cout<<temp<<endl;
				ans[it.se]=id[temp+1];
			}
		}
	}
	
	rep(x,1,q+1) if (ans[x]!=-1) cout<<ans[x]<<endl;
}

Compilation message (stderr)

foodcourt.cpp: In constructor 'node::node(int, int)':
foodcourt.cpp:31:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |   s=_s,e=_e,m=s+e>>1;
      |               ~^~

• 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