제출 #653292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
653292		inksamurai	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	100 ms	16260 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...);}

void chmin(pii&a,pii b){
	if(a.fi>b.fi){
		a=b;
	}else if(a.fi==b.fi){
		a.se=max(a.se,b.se);
	}
}

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,-2);
	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});
	}
	assert(n<=4000);
	const int inf=1e9;
	vec(vec(pii)) dp(n+1,vec(pii)(k+1,{inf,-1}));
	dp[0][0]={0,-1};
	rng(i,1,n+1){
		if(a[i-1]<=t){
			rep(j,k+1){
				chmin(dp[i][j],{dp[i-1][j].fi+1,dp[i-1][j].se});
			}
		}else if(dl[i-1]==-2){
			dp[i]=dp[i-1];
		}else{
			rep(j,k+1){
				int r=dp[i-1][j].se;
				if(r>dl[i-1]){
					chmin(dp[i][j],dp[i-1][j]);
				}else{
					chmin(dp[i][j],{dp[i-1][j].fi+1,dp[i-1][j].se});
				}
				if(j){
					chmin(dp[i][j],{dp[i-1][j-1].fi,i-1});
				}
			}
		}
	}
	int ans=n;
	rep(j,k+1){
		ans=min(ans,dp[n][j].fi);
	}
	cout<<ans<<"\n";
}

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