제출 #894443

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894443		vjudge1	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	0 ms	348 KiB

prison

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,d,T; cin>>n>>d>>T;
	vector<int> v(n); for(int& i : v) cin>>i;
	// MATRESSES ONLY CAN BE PLACED between a good and a bad --> covers a segment of just bad, so i place a matress in the ones that "recover" more spits
	vector<int> newv(n,0); newv[0] = v[0];
	set<int> good;
	for(int i = 0; i<n; i++){
		if(v[i] <= T) good.insert(i);
	}
	vector<int> canplace;
	for(int i = 1; i<n; i++){
		newv[i] = min(newv[i-1]+1,v[i]);
		if(v[i] > T && v[i-1] < T){
			// TAKE ACTUAL BEST VALUE
			int len = *good.lower_bound(i) - i;
			len = min(len, T-newv[i-1]);
			canplace.push_back(len);
		}
	}
	sort(canplace.begin(),canplace.end());
	int sz = canplace.size();
	for(int i = 0; i<min(sz,d); i++){
		canplace.pop_back();
	}
	// will revel
	int ans = 0;
	for(int i : canplace) ans+=i;
	ans+=good.size();
	cout<<ans<<endl;
}

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