Submission #653422

#	Time	Username	Problem	Language	Result	Execution time	Memory
653422		inksamurai	The short shank; Redemption (BOI21_prison)	C++17	55 / 100	2064 ms	25308 KiB

prison

#include <bits/stdc++.h>
#define int ll
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3D2ZDxo ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

signed main(){
_3D2ZDxo;
	int n,k,t;
	cin>>n>>k>>t;
	k=min(k,n);
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	vi dl(n,-1);
	set<pii> st;
	rep(i,n){
		if(sz(st)){
			auto it=st.lower_bound({i,-1});
			if(it!=st.end()){
				dl[i]=(*it).se;
			}
		}
		int val=t-a[i]+i;
		while(sz(st)){
			auto it=st.begin();
			pii p=*it;
			if(p.fi>val) break;
			st.erase(it);
		}
		st.insert({val,i});
	}
	vi usd(n);
	int ans=n;
	rep(i,n){
		if(a[i]<=t){
			usd[i]=1;
		}else if(dl[i]==-1){
			usd[i]=1;
			ans-=1;
		}
	}
	while(k){
		vi cnt(n);
		rep(i,n){
			if(usd[i]) continue;
			cnt[dl[i]]+=1;
			if(i+1<n){
				cnt[i+1]-=1;
			}
		}
		rng(i,1,n){
			cnt[i]+=cnt[i-1];
		}
		int pvt=-1;
		int ma=0;
		rep(i,n){
			if(cnt[i]>ma){
				ma=cnt[i];
				pvt=i;
			}
		}
		rep(i,n){
			if(usd[i]) continue;
			if(dl[i]<=pvt and pvt<=i){
				usd[i]=1;
				ans-=1;
			}
		}
		k-=1;
	}
	print(ans);
}

• Subtask 1: 15 / 15
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 10 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20