제출 #866968

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
866968		Mizo_Compiler	The short shank; Redemption (BOI21_prison)	C++17	35 / 100	2078 ms	41752 KiB

prison

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 5e5+5;
int n, a[N], d, t, nxt[N];
struct segtree {
	vector<int> t;
	void init(int sz) {
		t.resize(4*sz);	
	}
	void upd(int l, int r, int x, int i, int v) {
		if (l == r) {
			t[x] = v;
			return;
		}
		int m = (l + r) >> 1;
		if (i <= m)upd(l, m, x*2+1, i, v);
		else upd(m+1, r, x*2+2, i, v);
		t[x] = min(t[x*2+1], t[x*2+2]);
	}
	int get(int li, int ri, int x, int l, int r) {
		if (li >= l && ri <= r)return t[x];
		if (li > r || ri < l)return n;
		int m = (li + ri) >> 1;
		return min(get(li, m, x*2+1, l, r), get(m+1, ri, x*2+2, l, r));
	}
};

int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> d >> t;
	int ans = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n; i++) {
		nxt[i] = i;
		if (a[i] > t)continue;
		int mn = min(a[i]+1, a[i+1]);
		while (nxt[i]+1 < n && mn <= t) {
			nxt[i]++;
			mn = min({mn+1, a[nxt[i]]+1, a[nxt[i]+1]});
		}
	}
	segtree s[d+1];
	int dp[n][d+1];
	for (int j = 0; j <= d; j++) {
		dp[n-1][j] = (a[n-1] <= t);
		s[j].init(n);
		s[j].upd(0, n-1, 0, n-1, (a[n-1] <= t) + n-1);
	}
	for (int i = n-2; i >= 0; i--) {
		for (int j = 0; j <= d; j++) {
			if (a[i] > t) {
				dp[i][j] = dp[i+1][j];
				s[j].upd(0, n-1, 0, i, dp[i][j] + i);
				continue;
			}
			dp[i][j] = (nxt[i]+1 < n ? dp[nxt[i]+1][j] + nxt[i]-i+1 : n-i);
			if (j && nxt[i] > i) {
				dp[i][j] = min(dp[i][j], s[j-1].get(0, n-1, 0, i+1, nxt[i]) - i);
			}
			s[j].upd(0, n-1, 0, i, dp[i][j] + i);
		}
	}
	cout << dp[0][d] << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

prison.cpp: In function 'int main()':
prison.cpp:39:6: warning: unused variable 'ans' [-Wunused-variable]
   39 |  int ans = 0;
      |      ^~~

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