oj.uz

Submission #406150

# Submission time Handle Problem Language Result Execution time Memory
406150 2021-05-17T08:50:55 Z maomao90 The short shank; Redemption (BOI21_prison) C++17
35 / 100
 1238 ms 16344 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 75000
#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 4 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 548 KB Output is correct
5 Correct 22 ms 544 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 13 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 13 ms 460 KB Output is correct
11 Correct 24 ms 544 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 14 ms 2396 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 4 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 548 KB Output is correct
5 Correct 22 ms 544 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 13 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 13 ms 460 KB Output is correct
11 Correct 24 ms 544 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 13 ms 548 KB Output is correct
16 Correct 22 ms 548 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 11 ms 544 KB Output is correct
19 Correct 4 ms 460 KB Output is correct
20 Correct 7 ms 544 KB Output is correct
21 Correct 13 ms 460 KB Output is correct
22 Correct 26 ms 460 KB Output is correct
23 Correct 226 ms 1308 KB Output is correct
24 Correct 433 ms 1300 KB Output is correct
25 Correct 675 ms 1292 KB Output is correct
26 Correct 848 ms 1300 KB Output is correct
27 Correct 1089 ms 1308 KB Output is correct
28 Correct 135 ms 1228 KB Output is correct
29 Correct 162 ms 1292 KB Output is correct
30 Correct 331 ms 1272 KB Output is correct
31 Correct 659 ms 1228 KB Output is correct
32 Correct 465 ms 1228 KB Output is correct
33 Correct 475 ms 1276 KB Output is correct
34 Correct 125 ms 1272 KB Output is correct
35 Correct 1120 ms 1272 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1238 ms 16344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 548 KB Output is correct
5 Correct 22 ms 544 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 13 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 13 ms 460 KB Output is correct
11 Correct 24 ms 544 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 3 ms 432 KB Output is correct
14 Correct 5 ms 460 KB Output is correct
15 Correct 13 ms 548 KB Output is correct
16 Correct 22 ms 548 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 11 ms 544 KB Output is correct
19 Correct 4 ms 460 KB Output is correct
20 Correct 7 ms 544 KB Output is correct
21 Correct 13 ms 460 KB Output is correct
22 Correct 26 ms 460 KB Output is correct
23 Correct 226 ms 1308 KB Output is correct
24 Correct 433 ms 1300 KB Output is correct
25 Correct 675 ms 1292 KB Output is correct
26 Correct 848 ms 1300 KB Output is correct
27 Correct 1089 ms 1308 KB Output is correct
28 Correct 135 ms 1228 KB Output is correct
29 Correct 162 ms 1292 KB Output is correct
30 Correct 331 ms 1272 KB Output is correct
31 Correct 659 ms 1228 KB Output is correct
32 Correct 465 ms 1228 KB Output is correct
33 Correct 475 ms 1276 KB Output is correct
34 Correct 125 ms 1272 KB Output is correct
35 Correct 1120 ms 1272 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Incorrect 1238 ms 16344 KB Output isn't correct
38 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 4 ms 460 KB Output is correct
3 Correct 5 ms 460 KB Output is correct
4 Correct 12 ms 548 KB Output is correct
5 Correct 22 ms 544 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 13 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 6 ms 460 KB Output is correct
10 Correct 13 ms 460 KB Output is correct
11 Correct 24 ms 544 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Runtime error 14 ms 2396 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -