oj.uz

Submission #848832

# Submission time Handle Problem Language Result Execution time Memory
848832 2023-09-13T14:54:25 Z TAhmed33 The short shank; Redemption (BOI21_prison) C++
55 / 100
 2000 ms 56288 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 25;
#define mid ((l + r) >> 1)
#define tl (node + 1)
#define tr (node + 2 * (mid - l + 1))
struct SegmentTree {
	int arr[MAXN], tree[2 * MAXN];
	void build (int l, int r, int node) {
		if (l == r) {
			tree[node] = arr[l];
		} else {
			build(l, mid, tl); build(mid + 1, r, tr);
			tree[node] = min(tree[tl], tree[tr]);
		}
	}
	int getfirst (int l, int r, int a, int b, int node) {
		if (tree[node] >= a) return 0;
		if (l == r) return l;
		if (tree[tl] >= a) return getfirst(mid + 1, r, a, b, tr);
		if (mid < b) return getfirst(mid + 1, r, a, b, tr);
		int k = getfirst(l, mid, a, b, tl);
		if (k == 0) return getfirst(mid + 1, r, a, b, tr);
		return k;
	}
} cur;
int pref[MAXN];
int last[MAXN][19];
vector <int> dp1, dp2;
int n, d, t;
int tt[MAXN];
int cost (int i, int j) {
	int u = i;
	for (int x = 18; x >= 0; x--) {
		if (last[u][x] && last[u][x] <= j) u = last[u][x];
	}
	int x = pref[i] - pref[u];
	x += min(j - u + 1, max(0, t - tt[u] + 1));
	return x;
}
void calc (int l, int r, int opt1, int opt2) {
	if (l > r) return;
	pair <int, int> ll = {1e9, -1};
	for (int j = max(opt1, mid); j <= opt2; j++) {
		ll = min(ll, {cost(mid, j) + dp1[j + 1], j});
	}
	dp2[mid] = ll.first; int opt = ll.second;
	calc(l, mid - 1, opt1, opt);
	calc(mid + 1, r, opt, opt2);
}
int main () {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> d >> t;
	for (int i = 1; i <= n; i++) {
		cin >> tt[i];
		cur.arr[i] = tt[i] - i;
	}
	cur.build(1, n, 1);
	for (int i = 1; i <= n; i++) last[i][0] = cur.getfirst(1, n, tt[i] - i, i + 1, 1);
	for (int i = n; i >= 1; i--) {
		if (last[i][0] == 0) {
			pref[i] = min(n - i + 1, max(0, t - tt[i] + 1));
			continue;
		}
		pref[i] = pref[last[i][0]];
		int j = last[i][0] - 1;
		pref[i] += min(j - i + 1, max(0, t - tt[i] + 1));
	}
	for (int j = 1; j <= 18; j++) {
		for (int i = 1; i <= n; i++) {
			last[i][j] = last[last[i][j - 1]][j - 1];
		}
	}
	dp1.resize(n + 1); dp2.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		dp1[i] = cost(i, n);
	}
	for (int j = 1; j <= d; j++) {
		calc(1, n, 1, n);
		swap(dp1, dp2);
	}
	cout << dp1[1] << '\n';
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8684 KB Output is correct
5 Correct 11 ms 8552 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 7 ms 8660 KB Output is correct
8 Correct 3 ms 8684 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 412 ms 56180 KB Output is correct
3 Correct 430 ms 56288 KB Output is correct
4 Correct 403 ms 54700 KB Output is correct
5 Correct 461 ms 53236 KB Output is correct
6 Correct 567 ms 55396 KB Output is correct
7 Correct 421 ms 55096 KB Output is correct
8 Correct 695 ms 55240 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8684 KB Output is correct
5 Correct 11 ms 8552 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 7 ms 8660 KB Output is correct
8 Correct 3 ms 8684 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 3 ms 8692 KB Output is correct
15 Correct 7 ms 8696 KB Output is correct
16 Correct 11 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 6 ms 8536 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 7 ms 8540 KB Output is correct
22 Correct 12 ms 8680 KB Output is correct
23 Correct 117 ms 10588 KB Output is correct
24 Correct 215 ms 10800 KB Output is correct
25 Correct 341 ms 10792 KB Output is correct
26 Correct 419 ms 10584 KB Output is correct
27 Correct 522 ms 10792 KB Output is correct
28 Correct 73 ms 10588 KB Output is correct
29 Correct 89 ms 10588 KB Output is correct
30 Correct 165 ms 10776 KB Output is correct
31 Correct 320 ms 10780 KB Output is correct
32 Correct 144 ms 10776 KB Output is correct
33 Correct 149 ms 10840 KB Output is correct
34 Correct 75 ms 10768 KB Output is correct
35 Correct 490 ms 10584 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8536 KB Output is correct
2 Correct 490 ms 18368 KB Output is correct
3 Correct 521 ms 18512 KB Output is correct
4 Correct 473 ms 18012 KB Output is correct
5 Correct 337 ms 18264 KB Output is correct
6 Correct 356 ms 18272 KB Output is correct
7 Correct 677 ms 18156 KB Output is correct
8 Correct 637 ms 18136 KB Output is correct
9 Correct 539 ms 18160 KB Output is correct
10 Correct 496 ms 18012 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8684 KB Output is correct
5 Correct 11 ms 8552 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 7 ms 8660 KB Output is correct
8 Correct 3 ms 8684 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 2 ms 8540 KB Output is correct
14 Correct 3 ms 8692 KB Output is correct
15 Correct 7 ms 8696 KB Output is correct
16 Correct 11 ms 8540 KB Output is correct
17 Correct 1 ms 8540 KB Output is correct
18 Correct 6 ms 8536 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 4 ms 8540 KB Output is correct
21 Correct 7 ms 8540 KB Output is correct
22 Correct 12 ms 8680 KB Output is correct
23 Correct 117 ms 10588 KB Output is correct
24 Correct 215 ms 10800 KB Output is correct
25 Correct 341 ms 10792 KB Output is correct
26 Correct 419 ms 10584 KB Output is correct
27 Correct 522 ms 10792 KB Output is correct
28 Correct 73 ms 10588 KB Output is correct
29 Correct 89 ms 10588 KB Output is correct
30 Correct 165 ms 10776 KB Output is correct
31 Correct 320 ms 10780 KB Output is correct
32 Correct 144 ms 10776 KB Output is correct
33 Correct 149 ms 10840 KB Output is correct
34 Correct 75 ms 10768 KB Output is correct
35 Correct 490 ms 10584 KB Output is correct
36 Correct 1 ms 8536 KB Output is correct
37 Correct 490 ms 18368 KB Output is correct
38 Correct 521 ms 18512 KB Output is correct
39 Correct 473 ms 18012 KB Output is correct
40 Correct 337 ms 18264 KB Output is correct
41 Correct 356 ms 18272 KB Output is correct
42 Correct 677 ms 18156 KB Output is correct
43 Correct 637 ms 18136 KB Output is correct
44 Correct 539 ms 18160 KB Output is correct
45 Correct 496 ms 18012 KB Output is correct
46 Correct 1 ms 8540 KB Output is correct
47 Correct 3 ms 8536 KB Output is correct
48 Correct 3 ms 8540 KB Output is correct
49 Correct 7 ms 8540 KB Output is correct
50 Correct 11 ms 8540 KB Output is correct
51 Correct 1 ms 8540 KB Output is correct
52 Correct 9 ms 8664 KB Output is correct
53 Correct 3 ms 8536 KB Output is correct
54 Correct 4 ms 8688 KB Output is correct
55 Correct 7 ms 8540 KB Output is correct
56 Correct 12 ms 8536 KB Output is correct
57 Correct 143 ms 10788 KB Output is correct
58 Correct 229 ms 10792 KB Output is correct
59 Correct 326 ms 10788 KB Output is correct
60 Correct 421 ms 10584 KB Output is correct
61 Correct 534 ms 10792 KB Output is correct
62 Correct 71 ms 10588 KB Output is correct
63 Correct 82 ms 10792 KB Output is correct
64 Correct 156 ms 10588 KB Output is correct
65 Correct 324 ms 10776 KB Output is correct
66 Correct 144 ms 10588 KB Output is correct
67 Correct 155 ms 10780 KB Output is correct
68 Correct 80 ms 10588 KB Output is correct
69 Correct 495 ms 10588 KB Output is correct
70 Correct 1 ms 8540 KB Output is correct
71 Correct 507 ms 18364 KB Output is correct
72 Correct 493 ms 18536 KB Output is correct
73 Correct 471 ms 18016 KB Output is correct
74 Correct 370 ms 18512 KB Output is correct
75 Correct 339 ms 18280 KB Output is correct
76 Correct 689 ms 18156 KB Output is correct
77 Correct 657 ms 18160 KB Output is correct
78 Correct 520 ms 18148 KB Output is correct
79 Correct 515 ms 18160 KB Output is correct
80 Execution timed out 2041 ms 18268 KB Time limit exceeded
81 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 3 ms 8540 KB Output is correct
4 Correct 7 ms 8684 KB Output is correct
5 Correct 11 ms 8552 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 7 ms 8660 KB Output is correct
8 Correct 3 ms 8684 KB Output is correct
9 Correct 4 ms 8536 KB Output is correct
10 Correct 7 ms 8540 KB Output is correct
11 Correct 12 ms 8540 KB Output is correct
12 Correct 1 ms 8536 KB Output is correct
13 Correct 412 ms 56180 KB Output is correct
14 Correct 430 ms 56288 KB Output is correct
15 Correct 403 ms 54700 KB Output is correct
16 Correct 461 ms 53236 KB Output is correct
17 Correct 567 ms 55396 KB Output is correct
18 Correct 421 ms 55096 KB Output is correct
19 Correct 695 ms 55240 KB Output is correct
20 Correct 1 ms 8536 KB Output is correct
21 Correct 2 ms 8540 KB Output is correct
22 Correct 3 ms 8692 KB Output is correct
23 Correct 7 ms 8696 KB Output is correct
24 Correct 11 ms 8540 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 6 ms 8536 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 7 ms 8540 KB Output is correct
30 Correct 12 ms 8680 KB Output is correct
31 Correct 117 ms 10588 KB Output is correct
32 Correct 215 ms 10800 KB Output is correct
33 Correct 341 ms 10792 KB Output is correct
34 Correct 419 ms 10584 KB Output is correct
35 Correct 522 ms 10792 KB Output is correct
36 Correct 73 ms 10588 KB Output is correct
37 Correct 89 ms 10588 KB Output is correct
38 Correct 165 ms 10776 KB Output is correct
39 Correct 320 ms 10780 KB Output is correct
40 Correct 144 ms 10776 KB Output is correct
41 Correct 149 ms 10840 KB Output is correct
42 Correct 75 ms 10768 KB Output is correct
43 Correct 490 ms 10584 KB Output is correct
44 Correct 1 ms 8536 KB Output is correct
45 Correct 490 ms 18368 KB Output is correct
46 Correct 521 ms 18512 KB Output is correct
47 Correct 473 ms 18012 KB Output is correct
48 Correct 337 ms 18264 KB Output is correct
49 Correct 356 ms 18272 KB Output is correct
50 Correct 677 ms 18156 KB Output is correct
51 Correct 637 ms 18136 KB Output is correct
52 Correct 539 ms 18160 KB Output is correct
53 Correct 496 ms 18012 KB Output is correct
54 Correct 1 ms 8540 KB Output is correct
55 Correct 3 ms 8536 KB Output is correct
56 Correct 3 ms 8540 KB Output is correct
57 Correct 7 ms 8540 KB Output is correct
58 Correct 11 ms 8540 KB Output is correct
59 Correct 1 ms 8540 KB Output is correct
60 Correct 9 ms 8664 KB Output is correct
61 Correct 3 ms 8536 KB Output is correct
62 Correct 4 ms 8688 KB Output is correct
63 Correct 7 ms 8540 KB Output is correct
64 Correct 12 ms 8536 KB Output is correct
65 Correct 143 ms 10788 KB Output is correct
66 Correct 229 ms 10792 KB Output is correct
67 Correct 326 ms 10788 KB Output is correct
68 Correct 421 ms 10584 KB Output is correct
69 Correct 534 ms 10792 KB Output is correct
70 Correct 71 ms 10588 KB Output is correct
71 Correct 82 ms 10792 KB Output is correct
72 Correct 156 ms 10588 KB Output is correct
73 Correct 324 ms 10776 KB Output is correct
74 Correct 144 ms 10588 KB Output is correct
75 Correct 155 ms 10780 KB Output is correct
76 Correct 80 ms 10588 KB Output is correct
77 Correct 495 ms 10588 KB Output is correct
78 Correct 1 ms 8540 KB Output is correct
79 Correct 507 ms 18364 KB Output is correct
80 Correct 493 ms 18536 KB Output is correct
81 Correct 471 ms 18016 KB Output is correct
82 Correct 370 ms 18512 KB Output is correct
83 Correct 339 ms 18280 KB Output is correct
84 Correct 689 ms 18156 KB Output is correct
85 Correct 657 ms 18160 KB Output is correct
86 Correct 520 ms 18148 KB Output is correct
87 Correct 515 ms 18160 KB Output is correct
88 Execution timed out 2041 ms 18268 KB Time limit exceeded
89 Halted 0 ms 0 KB -