oj.uz

Submission #406152

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

#pragma(once)

#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 75005
#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];
inline void incre(int p, int v) {
	for (; p <= n; p += p & -p) mxto(fw[p], v);
}
inline int query(int p) {
	int res = 0;
	for (; p > 0; p -= p & -p) mxto(res, fw[p]);
	return res;
}

inline int cost(int l, int r) {
	int 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;
		}
	}
	if (p[0][cur].SE > 0) {
		res += r - val[cur] + 1;
	}
	return res;
}

inline 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 & 1][j] = LINF;
	REP (k, max(1, optl), min(optr + 1, j)) {
		if (dp[i & 1][j] > dp[(i + 1) & 1][k] + cost(k + 1, j)) {
			dp[i & 1][j] = dp[(i + 1) & 1][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 & 1][n]);
	return 0;
}

/*
5 1 42                          
13 37 47 11 42

5 2 5 
1 9 4 6 7
*/

Compilation message

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

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 540 KB Output is correct
5 Correct 22 ms 464 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 14 ms 540 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 14 ms 536 KB Output is correct
11 Correct 25 ms 460 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Runtime error 26 ms 1632 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 540 KB Output is correct
5 Correct 22 ms 464 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 14 ms 540 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 14 ms 536 KB Output is correct
11 Correct 25 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 388 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 14 ms 536 KB Output is correct
16 Correct 28 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 13 ms 540 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 460 KB Output is correct
21 Correct 13 ms 536 KB Output is correct
22 Correct 25 ms 536 KB Output is correct
23 Correct 238 ms 1228 KB Output is correct
24 Correct 436 ms 1232 KB Output is correct
25 Correct 687 ms 1232 KB Output is correct
26 Correct 847 ms 1232 KB Output is correct
27 Correct 1192 ms 1228 KB Output is correct
28 Correct 186 ms 1248 KB Output is correct
29 Correct 170 ms 1228 KB Output is correct
30 Correct 427 ms 1228 KB Output is correct
31 Correct 724 ms 1228 KB Output is correct
32 Correct 487 ms 1228 KB Output is correct
33 Correct 483 ms 1244 KB Output is correct
34 Correct 144 ms 1228 KB Output is correct
35 Correct 1196 ms 1232 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1154 ms 15836 KB Output is correct
3 Correct 1156 ms 16352 KB Output is correct
4 Correct 1310 ms 16292 KB Output is correct
5 Correct 1351 ms 16348 KB Output is correct
6 Correct 1375 ms 16352 KB Output is correct
7 Correct 1384 ms 16352 KB Output is correct
8 Correct 1406 ms 16348 KB Output is correct
9 Correct 1534 ms 16344 KB Output is correct
10 Correct 1612 ms 16368 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 540 KB Output is correct
5 Correct 22 ms 464 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 14 ms 540 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 14 ms 536 KB Output is correct
11 Correct 25 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 388 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 14 ms 536 KB Output is correct
16 Correct 28 ms 460 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 13 ms 540 KB Output is correct
19 Correct 5 ms 460 KB Output is correct
20 Correct 6 ms 460 KB Output is correct
21 Correct 13 ms 536 KB Output is correct
22 Correct 25 ms 536 KB Output is correct
23 Correct 238 ms 1228 KB Output is correct
24 Correct 436 ms 1232 KB Output is correct
25 Correct 687 ms 1232 KB Output is correct
26 Correct 847 ms 1232 KB Output is correct
27 Correct 1192 ms 1228 KB Output is correct
28 Correct 186 ms 1248 KB Output is correct
29 Correct 170 ms 1228 KB Output is correct
30 Correct 427 ms 1228 KB Output is correct
31 Correct 724 ms 1228 KB Output is correct
32 Correct 487 ms 1228 KB Output is correct
33 Correct 483 ms 1244 KB Output is correct
34 Correct 144 ms 1228 KB Output is correct
35 Correct 1196 ms 1232 KB Output is correct
36 Correct 2 ms 332 KB Output is correct
37 Correct 1154 ms 15836 KB Output is correct
38 Correct 1156 ms 16352 KB Output is correct
39 Correct 1310 ms 16292 KB Output is correct
40 Correct 1351 ms 16348 KB Output is correct
41 Correct 1375 ms 16352 KB Output is correct
42 Correct 1384 ms 16352 KB Output is correct
43 Correct 1406 ms 16348 KB Output is correct
44 Correct 1534 ms 16344 KB Output is correct
45 Correct 1612 ms 16368 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 5 ms 440 KB Output is correct
49 Correct 12 ms 540 KB Output is correct
50 Correct 23 ms 536 KB Output is correct
51 Correct 2 ms 432 KB Output is correct
52 Correct 11 ms 540 KB Output is correct
53 Correct 4 ms 460 KB Output is correct
54 Correct 6 ms 460 KB Output is correct
55 Correct 13 ms 460 KB Output is correct
56 Correct 24 ms 460 KB Output is correct
57 Correct 232 ms 1276 KB Output is correct
58 Correct 428 ms 1276 KB Output is correct
59 Correct 667 ms 1280 KB Output is correct
60 Correct 842 ms 1272 KB Output is correct
61 Correct 1090 ms 1268 KB Output is correct
62 Correct 142 ms 1228 KB Output is correct
63 Correct 167 ms 1228 KB Output is correct
64 Correct 338 ms 1256 KB Output is correct
65 Correct 663 ms 1228 KB Output is correct
66 Correct 468 ms 1248 KB Output is correct
67 Correct 469 ms 1228 KB Output is correct
68 Correct 124 ms 1228 KB Output is correct
69 Correct 1141 ms 1248 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1018 ms 16348 KB Output is correct
72 Correct 974 ms 16408 KB Output is correct
73 Correct 1231 ms 16192 KB Output is correct
74 Correct 1287 ms 16392 KB Output is correct
75 Correct 1300 ms 16352 KB Output is correct
76 Correct 1327 ms 16348 KB Output is correct
77 Correct 1381 ms 16452 KB Output is correct
78 Correct 1507 ms 16348 KB Output is correct
79 Correct 1590 ms 16384 KB Output is correct
80 Execution timed out 2082 ms 16272 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 332 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 540 KB Output is correct
5 Correct 22 ms 464 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 14 ms 540 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 14 ms 536 KB Output is correct
11 Correct 25 ms 460 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Runtime error 26 ms 1632 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -