Submission #659992

#	Time	Username	Problem	Language	Result	Execution time	Memory
659992		ymm	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	64 ms	9760 KiB

prison

#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 1<<21;
int a[N];
int b[N];
int n, d, t;
priority_queue<int> pq;

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n >> d >> t;
	int lst = 1e9+10;
	Loop (i,0,n) {
		cin >> a[i];
		b[i] = min(lst+1, a[i]);
		lst = b[i];
	}
	int cnt = 0;
	int ans = 0;
	Loop (i,0,n) {
		if (a[i] > t && b[i] <= t) {
			++cnt;
		} else {
			if (cnt)
				pq.push(cnt);
			cnt = 0;
		}
		if (b[i] <= t)
			++ans;
	}
	if (cnt)
		pq.push(cnt);
	while (pq.size() && d--) {
		ans -= pq.top();
		pq.pop();
	}
	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