oj.uz

Submission #867020

# Submission time Handle Problem Language Result Execution time Memory
867020 2023-10-27T15:12:50 Z Mizo_Compiler The short shank; Redemption (BOI21_prison) C++17
55 / 100
 1914 ms 524288 KB 
#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];
	}
	if (d == 1) {
		int pr[n], suf[n];
		pr[0] = (a[0] <= t);
		int mn = a[0]+1;
		for (int i = 1; i < n; i++) {
			pr[i] = pr[i-1] + (min(mn, a[i]) <= t);
			mn = min(mn+1, a[i]+1);
		}
		set<int> s;
		suf[n-1] = (a[n-1] <= t);
		if (!suf[n-1])s.insert(n-1);
		for (int i = n-2; i >= 0; i--) {
			int cur = a[i]-i;
			suf[i] = suf[i+1] + (a[i] <= t);
			while (!s.empty()) {
				auto it = s.upper_bound(t-cur);
				if (it == s.begin())break;
				--it;
				suf[i]++;
				s.erase(it);
			}
			if (a[i] > t)s.insert(i);
		}
		ans = pr[n-1];
		for (int i = 0; i+1 < n; i++) {
			ans = min(ans, pr[i] + suf[i+1]);
		}
		cout << ans << "\n";
		return 0;
	}
	int idx[n];
	idx[0] = 0;
	for (int i = 1; i < n; i++) {
		idx[i] = i;
		for (int j = i-1; j >= 0;) {
			if (a[j] + i - j <= t) {
				idx[i] = j;
				break;
			}
			j--;
			if (i - j > t)break;
		}
	}
	segtree ss;
	ss.init(n);
	for (int i = 0; i < n; i++) {
		if (a[i] > t && idx[i] == i)ss.upd(0, n-1, 0, i, -1);
		else ss.upd(0, n-1, 0, i, idx[i]);
	}
	for (int i = 0; i < n; i++) {
		nxt[i] = i;
		if (a[i] > t)continue;
		int l = i+1, r = n-1;
		while (l <= r) {
			int m = (l + r) >> 1;
			if (ss.get(0, n-1, 0, i+1, m) >= i) {
				nxt[i] = m;
				l = m+1;
			} else {
				r = m-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 = max(0, d-i); 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";
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2904 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 53 ms 8108 KB Output is correct
3 Correct 54 ms 8020 KB Output is correct
4 Correct 53 ms 9292 KB Output is correct
5 Correct 81 ms 9052 KB Output is correct
6 Correct 136 ms 16616 KB Output is correct
7 Correct 192 ms 31384 KB Output is correct
8 Correct 134 ms 15184 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2904 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 4 ms 3508 KB Output is correct
23 Correct 28 ms 10520 KB Output is correct
24 Correct 57 ms 18324 KB Output is correct
25 Correct 95 ms 25944 KB Output is correct
26 Correct 142 ms 33988 KB Output is correct
27 Correct 175 ms 41824 KB Output is correct
28 Correct 19 ms 7260 KB Output is correct
29 Correct 21 ms 8168 KB Output is correct
30 Correct 45 ms 12064 KB Output is correct
31 Correct 69 ms 22232 KB Output is correct
32 Correct 56 ms 12120 KB Output is correct
33 Correct 37 ms 11868 KB Output is correct
34 Correct 19 ms 6744 KB Output is correct
35 Correct 197 ms 41844 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 213 ms 27608 KB Output is correct
3 Correct 211 ms 27652 KB Output is correct
4 Correct 1210 ms 27900 KB Output is correct
5 Correct 1382 ms 27732 KB Output is correct
6 Correct 1385 ms 27908 KB Output is correct
7 Correct 1066 ms 27392 KB Output is correct
8 Correct 1094 ms 27652 KB Output is correct
9 Correct 1914 ms 27668 KB Output is correct
10 Correct 1255 ms 27908 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2904 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2648 KB Output is correct
15 Correct 2 ms 2908 KB Output is correct
16 Correct 4 ms 3420 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 2 ms 2392 KB Output is correct
20 Correct 1 ms 2648 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 4 ms 3508 KB Output is correct
23 Correct 28 ms 10520 KB Output is correct
24 Correct 57 ms 18324 KB Output is correct
25 Correct 95 ms 25944 KB Output is correct
26 Correct 142 ms 33988 KB Output is correct
27 Correct 175 ms 41824 KB Output is correct
28 Correct 19 ms 7260 KB Output is correct
29 Correct 21 ms 8168 KB Output is correct
30 Correct 45 ms 12064 KB Output is correct
31 Correct 69 ms 22232 KB Output is correct
32 Correct 56 ms 12120 KB Output is correct
33 Correct 37 ms 11868 KB Output is correct
34 Correct 19 ms 6744 KB Output is correct
35 Correct 197 ms 41844 KB Output is correct
36 Correct 0 ms 2396 KB Output is correct
37 Correct 213 ms 27608 KB Output is correct
38 Correct 211 ms 27652 KB Output is correct
39 Correct 1210 ms 27900 KB Output is correct
40 Correct 1382 ms 27732 KB Output is correct
41 Correct 1385 ms 27908 KB Output is correct
42 Correct 1066 ms 27392 KB Output is correct
43 Correct 1094 ms 27652 KB Output is correct
44 Correct 1914 ms 27668 KB Output is correct
45 Correct 1255 ms 27908 KB Output is correct
46 Correct 0 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2652 KB Output is correct
49 Correct 2 ms 2908 KB Output is correct
50 Correct 3 ms 3420 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2908 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 1 ms 2652 KB Output is correct
55 Correct 2 ms 2908 KB Output is correct
56 Correct 3 ms 3420 KB Output is correct
57 Correct 32 ms 10332 KB Output is correct
58 Correct 59 ms 18328 KB Output is correct
59 Correct 86 ms 26164 KB Output is correct
60 Correct 137 ms 33992 KB Output is correct
61 Correct 169 ms 41820 KB Output is correct
62 Correct 18 ms 7256 KB Output is correct
63 Correct 19 ms 8164 KB Output is correct
64 Correct 33 ms 11868 KB Output is correct
65 Correct 78 ms 22108 KB Output is correct
66 Correct 36 ms 11868 KB Output is correct
67 Correct 37 ms 11868 KB Output is correct
68 Correct 15 ms 6492 KB Output is correct
69 Correct 177 ms 41820 KB Output is correct
70 Correct 0 ms 2396 KB Output is correct
71 Correct 183 ms 27720 KB Output is correct
72 Correct 193 ms 27472 KB Output is correct
73 Correct 1240 ms 27652 KB Output is correct
74 Correct 1384 ms 27656 KB Output is correct
75 Correct 1381 ms 27600 KB Output is correct
76 Correct 1119 ms 27900 KB Output is correct
77 Correct 1033 ms 27464 KB Output is correct
78 Correct 1848 ms 27648 KB Output is correct
79 Correct 1245 ms 27648 KB Output is correct
80 Runtime error 318 ms 524288 KB Execution killed with signal 9
81 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 2 ms 2904 KB Output is correct
5 Correct 3 ms 3420 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 3 ms 3420 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 53 ms 8108 KB Output is correct
14 Correct 54 ms 8020 KB Output is correct
15 Correct 53 ms 9292 KB Output is correct
16 Correct 81 ms 9052 KB Output is correct
17 Correct 136 ms 16616 KB Output is correct
18 Correct 192 ms 31384 KB Output is correct
19 Correct 134 ms 15184 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 4 ms 3420 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 2 ms 2908 KB Output is correct
27 Correct 2 ms 2392 KB Output is correct
28 Correct 1 ms 2648 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 4 ms 3508 KB Output is correct
31 Correct 28 ms 10520 KB Output is correct
32 Correct 57 ms 18324 KB Output is correct
33 Correct 95 ms 25944 KB Output is correct
34 Correct 142 ms 33988 KB Output is correct
35 Correct 175 ms 41824 KB Output is correct
36 Correct 19 ms 7260 KB Output is correct
37 Correct 21 ms 8168 KB Output is correct
38 Correct 45 ms 12064 KB Output is correct
39 Correct 69 ms 22232 KB Output is correct
40 Correct 56 ms 12120 KB Output is correct
41 Correct 37 ms 11868 KB Output is correct
42 Correct 19 ms 6744 KB Output is correct
43 Correct 197 ms 41844 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 213 ms 27608 KB Output is correct
46 Correct 211 ms 27652 KB Output is correct
47 Correct 1210 ms 27900 KB Output is correct
48 Correct 1382 ms 27732 KB Output is correct
49 Correct 1385 ms 27908 KB Output is correct
50 Correct 1066 ms 27392 KB Output is correct
51 Correct 1094 ms 27652 KB Output is correct
52 Correct 1914 ms 27668 KB Output is correct
53 Correct 1255 ms 27908 KB Output is correct
54 Correct 0 ms 2396 KB Output is correct
55 Correct 1 ms 2396 KB Output is correct
56 Correct 1 ms 2652 KB Output is correct
57 Correct 2 ms 2908 KB Output is correct
58 Correct 3 ms 3420 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2908 KB Output is correct
61 Correct 1 ms 2396 KB Output is correct
62 Correct 1 ms 2652 KB Output is correct
63 Correct 2 ms 2908 KB Output is correct
64 Correct 3 ms 3420 KB Output is correct
65 Correct 32 ms 10332 KB Output is correct
66 Correct 59 ms 18328 KB Output is correct
67 Correct 86 ms 26164 KB Output is correct
68 Correct 137 ms 33992 KB Output is correct
69 Correct 169 ms 41820 KB Output is correct
70 Correct 18 ms 7256 KB Output is correct
71 Correct 19 ms 8164 KB Output is correct
72 Correct 33 ms 11868 KB Output is correct
73 Correct 78 ms 22108 KB Output is correct
74 Correct 36 ms 11868 KB Output is correct
75 Correct 37 ms 11868 KB Output is correct
76 Correct 15 ms 6492 KB Output is correct
77 Correct 177 ms 41820 KB Output is correct
78 Correct 0 ms 2396 KB Output is correct
79 Correct 183 ms 27720 KB Output is correct
80 Correct 193 ms 27472 KB Output is correct
81 Correct 1240 ms 27652 KB Output is correct
82 Correct 1384 ms 27656 KB Output is correct
83 Correct 1381 ms 27600 KB Output is correct
84 Correct 1119 ms 27900 KB Output is correct
85 Correct 1033 ms 27464 KB Output is correct
86 Correct 1848 ms 27648 KB Output is correct
87 Correct 1245 ms 27648 KB Output is correct
88 Runtime error 318 ms 524288 KB Execution killed with signal 9
89 Halted 0 ms 0 KB -