oj.uz

Submission #406144

# Submission time Handle Problem Language Result Execution time Memory
406144 2021-05-17T08:47:45 Z maomao90 The short shank; Redemption (BOI21_prison) C++17
55 / 100
 2000 ms 106140 KB 
#include <bits/stdc++.h> 
using namespace std;

#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 2000005
#define MAXL 22

int n, d, t;
int ti[MAXN];
ll dp[2][MAXN];
int lst[MAXN];
ii p[MAXL][MAXN];
int id[MAXN * 2], val[MAXN * 2];

int fw[MAXN];
void incre(int p, int v) {
	for (; p <= n; p += p & -p) mxto(fw[p], v);
}
int query(int p) {
	int res = 0;
	for (; p > 0; p -= p & -p) mxto(res, fw[p]);
	return res;
}

ll cost(int l, int r) {
	ll res = 0;
	int cur = id[l];
	RREP (k, MAXL - 1, 0) {
		if (p[k][cur].FI != -1 && val[p[k][cur].FI] <= r) {
			res += p[k][cur].SE;
			cur = p[k][cur].FI;
		}
	}
	assert(p[0][cur].FI == -1 || val[p[0][cur].FI] > r);
	if (p[0][cur].SE > 0) {
		res += r - val[cur] + 1;
	}
	return res;
}

void dnc(int i, int lo, int hi, int optl, int optr) {
	if (lo > hi) return;
	int j = lo + hi >> 1;
	int opt = -1;
	dp[i % 2][j] = LINF;
	REP (k, max(1, optl), min(optr + 1, j)) {
		if (dp[i % 2][j] > dp[(i + 1) % 2][k] + cost(k + 1, j)) {
			dp[i % 2][j] = dp[(i + 1) % 2][k] + cost(k + 1, j);
			opt = k;
		}
	}
	dnc(i, lo, j - 1, optl, opt);
	dnc(i, j + 1, hi, opt, optr);
}

int main() {
	scanf("%d%d%d", &n, &d, &t);
	REP (i, 1, n + 1) {
		scanf("%d", &ti[i]);
		fw[i] = -1;
	}
	RREP (i, n, 1) {
		int r = min(n, t - ti[i] + i);
		if (ti[i] > t) r = -1;
		if (r != -1) {
			mxto(r, query(r));
		}
		incre(i, r);
		lst[i] = r;
	}
	int cnt = n + 1;
	id[n + 1] = n + 1;
	val[n + 1] = n + 1;
	RREP (i, n, 1) {
		id[i] = i;
		val[i] = i;
		if (lst[i] != -1) {
			if (lst[i] == i) {
				id[i] = ++cnt;
				val[cnt] = i;
				p[0][i] = MP(id[i + 1], 0);
				p[0][cnt] = MP(i + 1, 1);
			} else {
				p[0][i] = MP(lst[i], lst[i] - i + 1);
			}
		} else {
			p[0][i] = MP(id[i + 1], 0);
		}
	}
	p[0][n + 1] = MP(-1, 0);
	REP (k, 1, MAXL) {
		REP (i, 1, cnt + 2) {
			if (p[k - 1][i].FI == -1) {
			   	p[k][i] = p[k - 1][i];
			} else {
				p[k][i] = p[k - 1][p[k - 1][i].FI];
				p[k][i].SE += p[k - 1][i].SE;
			}
		}
	}
	REP (i, 1, n + 1) {
		dp[0][i] = cost(1, i);
	}
	REP (i, 1, d + 1) {
		dnc(i, 1, n, 1, n);
	}
	printf("%lld\n", dp[d % 2][n]);
	return 0;
}

/*
5 1 42                          
13 37 47 11 42

5 2 5 
1 9 4 6 7
*/

Compilation message

prison.cpp: In function 'void dnc(int, int, int, int, int)':
prison.cpp:63:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   63 |  int j = lo + hi >> 1;
      |          ~~~^~~~
prison.cpp: In function 'int main()':
prison.cpp:77:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |  scanf("%d%d%d", &n, &d, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
prison.cpp:79:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |   scanf("%d", &ti[i]);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 7 ms 560 KB Output is correct
4 Correct 12 ms 556 KB Output is correct
5 Correct 24 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 11 ms 556 KB Output is correct
8 Correct 4 ms 556 KB Output is correct
9 Correct 7 ms 580 KB Output is correct
10 Correct 13 ms 628 KB Output is correct
11 Correct 26 ms 628 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 718 ms 106140 KB Output is correct
3 Correct 758 ms 105660 KB Output is correct
4 Correct 836 ms 105744 KB Output is correct
5 Correct 811 ms 105448 KB Output is correct
6 Correct 893 ms 105760 KB Output is correct
7 Correct 982 ms 105752 KB Output is correct
8 Correct 922 ms 105644 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 7 ms 560 KB Output is correct
4 Correct 12 ms 556 KB Output is correct
5 Correct 24 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 11 ms 556 KB Output is correct
8 Correct 4 ms 556 KB Output is correct
9 Correct 7 ms 580 KB Output is correct
10 Correct 13 ms 628 KB Output is correct
11 Correct 26 ms 628 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 5 ms 588 KB Output is correct
15 Correct 12 ms 588 KB Output is correct
16 Correct 22 ms 632 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 11 ms 588 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 6 ms 588 KB Output is correct
21 Correct 18 ms 624 KB Output is correct
22 Correct 25 ms 628 KB Output is correct
23 Correct 263 ms 1364 KB Output is correct
24 Correct 449 ms 1364 KB Output is correct
25 Correct 690 ms 1356 KB Output is correct
26 Correct 865 ms 1380 KB Output is correct
27 Correct 1117 ms 1476 KB Output is correct
28 Correct 141 ms 1356 KB Output is correct
29 Correct 173 ms 1380 KB Output is correct
30 Correct 351 ms 1404 KB Output is correct
31 Correct 684 ms 1456 KB Output is correct
32 Correct 490 ms 1356 KB Output is correct
33 Correct 518 ms 1476 KB Output is correct
34 Correct 126 ms 1356 KB Output is correct
35 Correct 1186 ms 1356 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1072 ms 16812 KB Output is correct
3 Correct 1000 ms 16792 KB Output is correct
4 Correct 1245 ms 16508 KB Output is correct
5 Correct 1321 ms 16788 KB Output is correct
6 Correct 1334 ms 16788 KB Output is correct
7 Correct 1433 ms 16620 KB Output is correct
8 Correct 1419 ms 16572 KB Output is correct
9 Correct 1609 ms 16572 KB Output is correct
10 Correct 1656 ms 16568 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 7 ms 560 KB Output is correct
4 Correct 12 ms 556 KB Output is correct
5 Correct 24 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 11 ms 556 KB Output is correct
8 Correct 4 ms 556 KB Output is correct
9 Correct 7 ms 580 KB Output is correct
10 Correct 13 ms 628 KB Output is correct
11 Correct 26 ms 628 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 3 ms 588 KB Output is correct
14 Correct 5 ms 588 KB Output is correct
15 Correct 12 ms 588 KB Output is correct
16 Correct 22 ms 632 KB Output is correct
17 Correct 3 ms 556 KB Output is correct
18 Correct 11 ms 588 KB Output is correct
19 Correct 4 ms 588 KB Output is correct
20 Correct 6 ms 588 KB Output is correct
21 Correct 18 ms 624 KB Output is correct
22 Correct 25 ms 628 KB Output is correct
23 Correct 263 ms 1364 KB Output is correct
24 Correct 449 ms 1364 KB Output is correct
25 Correct 690 ms 1356 KB Output is correct
26 Correct 865 ms 1380 KB Output is correct
27 Correct 1117 ms 1476 KB Output is correct
28 Correct 141 ms 1356 KB Output is correct
29 Correct 173 ms 1380 KB Output is correct
30 Correct 351 ms 1404 KB Output is correct
31 Correct 684 ms 1456 KB Output is correct
32 Correct 490 ms 1356 KB Output is correct
33 Correct 518 ms 1476 KB Output is correct
34 Correct 126 ms 1356 KB Output is correct
35 Correct 1186 ms 1356 KB Output is correct
36 Correct 1 ms 460 KB Output is correct
37 Correct 1072 ms 16812 KB Output is correct
38 Correct 1000 ms 16792 KB Output is correct
39 Correct 1245 ms 16508 KB Output is correct
40 Correct 1321 ms 16788 KB Output is correct
41 Correct 1334 ms 16788 KB Output is correct
42 Correct 1433 ms 16620 KB Output is correct
43 Correct 1419 ms 16572 KB Output is correct
44 Correct 1609 ms 16572 KB Output is correct
45 Correct 1656 ms 16568 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 4 ms 556 KB Output is correct
48 Correct 5 ms 588 KB Output is correct
49 Correct 13 ms 632 KB Output is correct
50 Correct 23 ms 560 KB Output is correct
51 Correct 2 ms 588 KB Output is correct
52 Correct 11 ms 588 KB Output is correct
53 Correct 5 ms 588 KB Output is correct
54 Correct 6 ms 624 KB Output is correct
55 Correct 14 ms 628 KB Output is correct
56 Correct 29 ms 588 KB Output is correct
57 Correct 240 ms 1384 KB Output is correct
58 Correct 448 ms 1372 KB Output is correct
59 Correct 733 ms 1364 KB Output is correct
60 Correct 872 ms 1364 KB Output is correct
61 Correct 1110 ms 1368 KB Output is correct
62 Correct 143 ms 1376 KB Output is correct
63 Correct 186 ms 1356 KB Output is correct
64 Correct 344 ms 1356 KB Output is correct
65 Correct 675 ms 1356 KB Output is correct
66 Correct 488 ms 1356 KB Output is correct
67 Correct 485 ms 1356 KB Output is correct
68 Correct 126 ms 1356 KB Output is correct
69 Correct 1166 ms 1352 KB Output is correct
70 Correct 1 ms 460 KB Output is correct
71 Correct 1083 ms 16784 KB Output is correct
72 Correct 1042 ms 16796 KB Output is correct
73 Correct 1250 ms 16508 KB Output is correct
74 Correct 1332 ms 16792 KB Output is correct
75 Correct 1318 ms 16788 KB Output is correct
76 Correct 1396 ms 16572 KB Output is correct
77 Correct 1459 ms 16572 KB Output is correct
78 Correct 1557 ms 16572 KB Output is correct
79 Correct 1609 ms 16576 KB Output is correct
80 Execution timed out 2075 ms 16836 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 460 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 7 ms 560 KB Output is correct
4 Correct 12 ms 556 KB Output is correct
5 Correct 24 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 11 ms 556 KB Output is correct
8 Correct 4 ms 556 KB Output is correct
9 Correct 7 ms 580 KB Output is correct
10 Correct 13 ms 628 KB Output is correct
11 Correct 26 ms 628 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 718 ms 106140 KB Output is correct
14 Correct 758 ms 105660 KB Output is correct
15 Correct 836 ms 105744 KB Output is correct
16 Correct 811 ms 105448 KB Output is correct
17 Correct 893 ms 105760 KB Output is correct
18 Correct 982 ms 105752 KB Output is correct
19 Correct 922 ms 105644 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 3 ms 588 KB Output is correct
22 Correct 5 ms 588 KB Output is correct
23 Correct 12 ms 588 KB Output is correct
24 Correct 22 ms 632 KB Output is correct
25 Correct 3 ms 556 KB Output is correct
26 Correct 11 ms 588 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 6 ms 588 KB Output is correct
29 Correct 18 ms 624 KB Output is correct
30 Correct 25 ms 628 KB Output is correct
31 Correct 263 ms 1364 KB Output is correct
32 Correct 449 ms 1364 KB Output is correct
33 Correct 690 ms 1356 KB Output is correct
34 Correct 865 ms 1380 KB Output is correct
35 Correct 1117 ms 1476 KB Output is correct
36 Correct 141 ms 1356 KB Output is correct
37 Correct 173 ms 1380 KB Output is correct
38 Correct 351 ms 1404 KB Output is correct
39 Correct 684 ms 1456 KB Output is correct
40 Correct 490 ms 1356 KB Output is correct
41 Correct 518 ms 1476 KB Output is correct
42 Correct 126 ms 1356 KB Output is correct
43 Correct 1186 ms 1356 KB Output is correct
44 Correct 1 ms 460 KB Output is correct
45 Correct 1072 ms 16812 KB Output is correct
46 Correct 1000 ms 16792 KB Output is correct
47 Correct 1245 ms 16508 KB Output is correct
48 Correct 1321 ms 16788 KB Output is correct
49 Correct 1334 ms 16788 KB Output is correct
50 Correct 1433 ms 16620 KB Output is correct
51 Correct 1419 ms 16572 KB Output is correct
52 Correct 1609 ms 16572 KB Output is correct
53 Correct 1656 ms 16568 KB Output is correct
54 Correct 1 ms 460 KB Output is correct
55 Correct 4 ms 556 KB Output is correct
56 Correct 5 ms 588 KB Output is correct
57 Correct 13 ms 632 KB Output is correct
58 Correct 23 ms 560 KB Output is correct
59 Correct 2 ms 588 KB Output is correct
60 Correct 11 ms 588 KB Output is correct
61 Correct 5 ms 588 KB Output is correct
62 Correct 6 ms 624 KB Output is correct
63 Correct 14 ms 628 KB Output is correct
64 Correct 29 ms 588 KB Output is correct
65 Correct 240 ms 1384 KB Output is correct
66 Correct 448 ms 1372 KB Output is correct
67 Correct 733 ms 1364 KB Output is correct
68 Correct 872 ms 1364 KB Output is correct
69 Correct 1110 ms 1368 KB Output is correct
70 Correct 143 ms 1376 KB Output is correct
71 Correct 186 ms 1356 KB Output is correct
72 Correct 344 ms 1356 KB Output is correct
73 Correct 675 ms 1356 KB Output is correct
74 Correct 488 ms 1356 KB Output is correct
75 Correct 485 ms 1356 KB Output is correct
76 Correct 126 ms 1356 KB Output is correct
77 Correct 1166 ms 1352 KB Output is correct
78 Correct 1 ms 460 KB Output is correct
79 Correct 1083 ms 16784 KB Output is correct
80 Correct 1042 ms 16796 KB Output is correct
81 Correct 1250 ms 16508 KB Output is correct
82 Correct 1332 ms 16792 KB Output is correct
83 Correct 1318 ms 16788 KB Output is correct
84 Correct 1396 ms 16572 KB Output is correct
85 Correct 1459 ms 16572 KB Output is correct
86 Correct 1557 ms 16572 KB Output is correct
87 Correct 1609 ms 16576 KB Output is correct
88 Execution timed out 2075 ms 16836 KB Time limit exceeded
89 Halted 0 ms 0 KB -