제출 #688668

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
688668		Antekb	푸드 코트 (JOI21_foodcourt)	C++14	100 / 100	720 ms	58816 KiB

foodcourt

#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int N=(1<<18), INF=1e9+5, mod=1e9+7, mod2=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint operator^(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=(*this)^(m/2);
		a*=a;
		return a*((*this)^(m&1));
	}
	modint odw(){
		return (*this)^((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}
int kto[N], ans[N], co[N];
vector<pair<ll, int> > quer[N];
vector<pii> pocz[N], kon[N];
ll mi[N+N], ma[N+N], gdzie[N+N], sum[N+N], sum2[N+N];//gdzie - cos co daje minimum
void upd(int v){
	assert(v<N);
	int l=v+v, r=l+1;
	sum[v]=sum[l]+sum[r];
	sum2[v]=sum2[l]+sum2[r];
	ma[v]=max(ma[l],sum[l]+ma[r]);
	if(mi[l]>=mi[r]+sum[l]){
		gdzie[v]=gdzie[r];
		mi[v]=mi[r]+sum[l];
	}
	else{
		gdzie[v]=gdzie[l];
		mi[v]=mi[l];
	}
}
void ust(int v, ll k){
	//deb(v, k);
	v+=N;
	sum[v]=mi[v]=ma[v]=k;
	if(k>=0)sum2[v]=k;
	gdzie[v]=v-N;
	v/=2;
	while(v){
		upd(v);
		v/=2;
	}
}
int licz(int v, ll k){
	//deb(v, k);
	//deb(sum[N/4], sum[N/4+1], sum[N/8+1]);
	int vv=v;
	ll s=0, s2=0, res=0, id=0;
	v+=N;
	while(v!=1){
		if(v&1){
			v--;
			s+=sum[v];
			s2+=sum2[v];
			//deb(v, sum[v]);
			res=min(res, mi[v]-s);
		}
		v/=2;
	}
	res+=s;
	k=s-res-k;
	//deb(s, res, k);
	if(k<0)return 0;
	s=0;
	v=vv+N;
	/*while(v!=1){
		if(v&1){
			v--;
			if(sum[v]-mi[v]>k-s){
				while(v<N){
					int l=v+v, r=l+1;
					//deb(v, l, r );
					if(sum[r]-mi[r]>k-s)v=r;
					else{
						v=l;
						s+=sum[r];
					}
				}
				//deb(v-N);
				return v+1-N;
			}
			else s+=sum[v];
		}
		v/=2;
	}*/
	while(v!=1){
		if(v&1){
			v--;
			if(sum2[v]>k){
				while(v<N){
					int l=v+v, r=l+1;
					//deb(v, l, r );
					if(sum2[r]>k)v=r;
					else{
						v=l;
						k-=sum2[r];
					}
				}
				//deb(v-N);
				return v-N;
			}
			else k-=sum2[v];
		}
		v/=2;
	}
	assert(false);
}
int main(){
	//factinit();
	//BOOST;
	int n, m, q;
	cin>>n>>m>>q;
	int wsk=1;
	for(int i=1; i<=q; i++){
		int t;
		cin>>t;
		if(t==3){
			int a;
			ll b;
			cin>>a>>b;
			co[i]=wsk++;
			quer[a].eb(b, i);
		}
		else{
			int l, r;
			cin>>l>>r;
			if(t==1)cin>>kto[i];
			int k;
			cin>>k;
			if(t==2)k=-k;
			pocz[l].eb(k, i);
			kon[r].eb(k, i);
		}
	}
	for(int i=1; i<=n; i++){
		for(int j=0; j<pocz[i].size(); j++){
			ust(pocz[i][j].nd, pocz[i][j].st);
		}
		for(int j=0; j<quer[i].size(); j++){
			int t=licz(quer[i][j].nd, quer[i][j].st);
			ans[co[quer[i][j].nd]]=kto[t];
		}
		for(int j=0; j<kon[i].size(); j++){
			ust(kon[i][j].nd, 0);
		}
	}
	for(int i=1; i<wsk;i++){
		cout<<ans[i]<<"\n";
	}
}

컴파일 시 표준 에러 (stderr) 메시지

foodcourt.cpp: In function 'int licz(int, ll)':
foodcourt.cpp:152:23: warning: unused variable 'id' [-Wunused-variable]
  152 |  ll s=0, s2=0, res=0, id=0;
      |                       ^~
foodcourt.cpp: In function 'int main()':
foodcourt.cpp:240:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  240 |   for(int j=0; j<pocz[i].size(); j++){
      |                ~^~~~~~~~~~~~~~~
foodcourt.cpp:243:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  243 |   for(int j=0; j<quer[i].size(); j++){
      |                ~^~~~~~~~~~~~~~~
foodcourt.cpp:247:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  247 |   for(int j=0; j<kon[i].size(); j++){
      |                ~^~~~~~~~~~~~~~

• 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