oj.uz

Submission #406059

# Submission time Handle Problem Language Result Execution time Memory
406059 2021-05-17T07:30:57 Z maomao90 The short shank; Redemption (BOI21_prison) C++17
35 / 100
 163 ms 61252 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 4005

int n, d, t;
int ti[MAXN];
int cost[MAXN][MAXN];
ll dp[MAXN][MAXN];

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][j] = LINF;
	REP (k, optl, min(optr + 1, j)) {
		if (dp[i][j] > dp[i - 1][k] + cost[k + 1][j]) {
			dp[i][j] = dp[i - 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]);
	}
	REP (i, 1, n + 1) {
		ll r = -1;
		int cur = 0;
		REP (j, i, n + 1) {
			if (t >= ti[j]) mxto(r, t - ti[j] + j);
			if (r >= j) cur++;
			cost[i][j] = cur;
		}
	}
	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][n]);
	return 0;
}

Compilation message

prison.cpp: In function 'void dnc(int, int, int, int, int)':
prison.cpp:34:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |  int j = lo + hi >> 1;
      |          ~~~^~~~
prison.cpp: In function 'int main()':
prison.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  scanf("%d%d%d", &n, &d, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
prison.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   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 2 ms 2252 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 3 ms 3148 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 3 ms 3116 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 3 ms 2892 KB Output is correct
10 Correct 3 ms 3148 KB Output is correct
11 Correct 4 ms 3532 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 13 ms 376 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 2 ms 2252 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 3 ms 3148 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 3 ms 3116 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 3 ms 2892 KB Output is correct
10 Correct 3 ms 3148 KB Output is correct
11 Correct 4 ms 3532 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 2252 KB Output is correct
14 Correct 2 ms 2380 KB Output is correct
15 Correct 3 ms 3148 KB Output is correct
16 Correct 4 ms 3532 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 3020 KB Output is correct
19 Correct 2 ms 2892 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 3148 KB Output is correct
22 Correct 4 ms 3532 KB Output is correct
23 Correct 68 ms 48792 KB Output is correct
24 Correct 91 ms 51908 KB Output is correct
25 Correct 117 ms 55120 KB Output is correct
26 Correct 137 ms 58212 KB Output is correct
27 Correct 163 ms 61252 KB Output is correct
28 Correct 59 ms 47476 KB Output is correct
29 Correct 63 ms 47740 KB Output is correct
30 Correct 75 ms 49476 KB Output is correct
31 Correct 105 ms 53560 KB Output is correct
32 Correct 118 ms 49476 KB Output is correct
33 Correct 105 ms 49300 KB Output is correct
34 Correct 51 ms 47188 KB Output is correct
35 Correct 155 ms 61236 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 Runtime error 13 ms 460 KB Execution killed with signal 11
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 2 ms 2252 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 3 ms 3148 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 3 ms 3116 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 3 ms 2892 KB Output is correct
10 Correct 3 ms 3148 KB Output is correct
11 Correct 4 ms 3532 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 2252 KB Output is correct
14 Correct 2 ms 2380 KB Output is correct
15 Correct 3 ms 3148 KB Output is correct
16 Correct 4 ms 3532 KB Output is correct
17 Correct 2 ms 2764 KB Output is correct
18 Correct 3 ms 3020 KB Output is correct
19 Correct 2 ms 2892 KB Output is correct
20 Correct 3 ms 2892 KB Output is correct
21 Correct 3 ms 3148 KB Output is correct
22 Correct 4 ms 3532 KB Output is correct
23 Correct 68 ms 48792 KB Output is correct
24 Correct 91 ms 51908 KB Output is correct
25 Correct 117 ms 55120 KB Output is correct
26 Correct 137 ms 58212 KB Output is correct
27 Correct 163 ms 61252 KB Output is correct
28 Correct 59 ms 47476 KB Output is correct
29 Correct 63 ms 47740 KB Output is correct
30 Correct 75 ms 49476 KB Output is correct
31 Correct 105 ms 53560 KB Output is correct
32 Correct 118 ms 49476 KB Output is correct
33 Correct 105 ms 49300 KB Output is correct
34 Correct 51 ms 47188 KB Output is correct
35 Correct 155 ms 61236 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Runtime error 13 ms 460 KB Execution killed with signal 11
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 2 ms 2252 KB Output is correct
3 Correct 2 ms 2380 KB Output is correct
4 Correct 3 ms 3148 KB Output is correct
5 Correct 4 ms 3532 KB Output is correct
6 Correct 2 ms 2764 KB Output is correct
7 Correct 3 ms 3116 KB Output is correct
8 Correct 2 ms 2764 KB Output is correct
9 Correct 3 ms 2892 KB Output is correct
10 Correct 3 ms 3148 KB Output is correct
11 Correct 4 ms 3532 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Runtime error 13 ms 376 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -