Submission #544508

#	Time	Username	Problem	Language	Result	Execution time	Memory
544508		model_code	Ants and Sugar (JOI22_sugar)	C++17	100 / 100	1124 ms	71844 KiB

sugar

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

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

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print(const array<T,N>&v,int suc=1){
	rep(i,N)
		print(v[i],i==int(N)-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

struct SegTree{
	struct N{
		//mx: |ant|-|sugar| の max （ノード内で重み 1 のついた座標が存在すると仮定）
		//mx[i][j]: 左 i 以上，右 j 以上
		//lz: ノード全体に足された sugar の個数
		//mid: 子ノードの間で共有してる sugar の個数
		int mx[2][2],lz,mid;
		N(){
			rep(i,2)rep(j,2)mx[i][j]=0;
			lz=0;
			mid=0;
		}
		void addmid(int v){
			mid+=v;
		}
		void addlazy(int v){
			rep(i,2)rep(j,2)mx[i][j]-=v;
			lz+=v;
		}
		void addant(int v){
			assert(mid==0);//leaf
			rep(i,2)rep(j,2)mx[i][j]+=v;
		}
		void clearlazy(){
			addmid(lz);
			lz=0;
		}
		void update(const N&x,const N&y){
			assert(lz==0);
			rep(i,2)rep(j,2)mx[i][j]=max({x.mx[i][0]+y.mx[0][j],x.mx[i][1]+y.mx[1][j]+mid,-inf});
			rep(i,2)chmax(mx[i][0],x.mx[i][0]);
			rep(j,2)chmax(mx[0][j],y.mx[0][j]);
		}
	};
	vc<N> x;
	int s,h;
	SegTree(int n){
		s=1,h=0;while(s<n){s*=2;h++;}
		x.resize(s*2);
	}
	void push(int i){
		assert(inc(1,i,s-1));
		rep(k,2)x[i*2+k].addlazy(x[i].lz);
		x[i].clearlazy();
	}
	void update(int i){
		x[i].update(x[i*2],x[i*2+1]);
	}
	void dfs(int i,int l,int r,int b,int e,int v){
		assert(max(b,l)<min(e,r));
		if(b<=l&&r<=e){
			x[i].addlazy(v);
			return;
		}
		push(i);
		int m=(l+r)/2;
		if(e<=m){
			dfs(i*2+0,l,m,b,e,v);
		}else if(m<=b){
			dfs(i*2+1,m,r,b,e,v);
		}else{
			x[i].addmid(v);
			dfs(i*2+0,l,m,b,e,v);
			dfs(i*2+1,m,r,b,e,v);
		}
		update(i);
	}
	void addsugar(int b,int e,int v){
		if(b<e)dfs(1,0,s,b,e,v);
	}
	void addant(int i,int v){
		i+=s;
		rep(lv,h)push(i>>(h-lv));
		x[i].addant(v);
		per(lv,h)update(i>>(h-lv));
	}
	int getans(){
		return max(x[1].mx[0][0],0LL);
	}
};

struct Query{
	int t,x,a;
	void readinit(){
		cin>>t>>x>>a;
	}
};

void slv(){
	int q,L;cin>>q>>L;
	vc<Query> qs(q);
	rep(i,q)qs[i].readinit();
	vi xs;
	rep(i,q)if(qs[i].t==1)xs.pb(qs[i].x);
	mkuni(xs);
	int s=si(xs);
	SegTree seg(s);
	int tot=0;
	for(auto w:qs){
		if(w.t==1){
			int i=lwb(xs,w.x);
			seg.addant(i,w.a);
			tot+=w.a;
		}else{
			int l=lwb(xs,w.x-L);
			int r=lwb(xs,w.x+L+1);
			seg.addsugar(l,r,w.a);
		}
		print(tot-seg.getans());
	}
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	//int t;cin>>t;rep(_,t)
	slv();
}

• Subtask 1: 6 / 6
• Subtask 2: 16 / 16
• Subtask 3: 26 / 26
• Subtask 4: 52 / 52