oj.uz

답안 #859936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
859936 2023-10-11T08:25:06 Z OAleksa K개의 묶음 (IZhO14_blocks) C++14
53 / 100
 1000 ms 12892 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
#define int long long
const int maxn = 1e5 + 69;
const int maxk = 110;
const int lg = 17;
const int inf = 1e18;
int a[maxn], n, k, dp[maxn][maxk], st[maxn][lg];
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while(tt--) {
		cin >> n >> k;
		for (int i = 1;i <= n;i++)
			cin >> a[i];
		for (int i = 1;i <= n;i++)
			st[i][0] = a[i];
		for (int i = 0;i <= n;i++) {
			for (int j = 0;j <= k;j++)
				dp[i][j] = inf;
		}
		dp[0][0] = 0;
		for (int j = 1;j < lg;j++)
			for (int i = 1;i + (1 << j) <= n + 1;i++)
				st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
		for (int j = 1;j <= k;j++) {
			for (int i = 1;i <= n;i++) {
				for (int x = i - 1;x >= 0;x--) {
					int q = log2(i - x);
					int mx = max(st[x + 1][q], st[i - (1 << q) + 1][q]);
					dp[i][j] = min(dp[i][j], mx + dp[x][j - 1]);
				}
			}
		}
		cout << dp[n][k];
	}	
   return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2508 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2508 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2508 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2404 KB Output is correct
9 Correct 0 ms 2404 KB Output is correct
10 Correct 1 ms 2404 KB Output is correct
11 Correct 1 ms 2404 KB Output is correct
12 Correct 1 ms 2404 KB Output is correct
13 Correct 1 ms 2404 KB Output is correct
14 Correct 0 ms 2404 KB Output is correct
15 Correct 0 ms 2404 KB Output is correct
16 Correct 1 ms 2532 KB Output is correct
17 Correct 1 ms 2404 KB Output is correct
18 Correct 1 ms 2400 KB Output is correct
19 Correct 1 ms 2408 KB Output is correct
20 Correct 1 ms 2408 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2508 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2508 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2508 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 0 ms 2404 KB Output is correct
27 Correct 0 ms 2404 KB Output is correct
28 Correct 1 ms 2404 KB Output is correct
29 Correct 1 ms 2404 KB Output is correct
30 Correct 1 ms 2404 KB Output is correct
31 Correct 1 ms 2404 KB Output is correct
32 Correct 0 ms 2404 KB Output is correct
33 Correct 0 ms 2404 KB Output is correct
34 Correct 1 ms 2532 KB Output is correct
35 Correct 1 ms 2404 KB Output is correct
36 Correct 1 ms 2400 KB Output is correct
37 Correct 1 ms 2408 KB Output is correct
38 Correct 1 ms 2408 KB Output is correct
39 Correct 4 ms 2408 KB Output is correct
40 Correct 1 ms 2408 KB Output is correct
41 Correct 1 ms 2408 KB Output is correct
42 Correct 1 ms 2408 KB Output is correct
43 Correct 1 ms 2408 KB Output is correct
44 Correct 1 ms 2524 KB Output is correct
45 Correct 1 ms 2436 KB Output is correct
46 Correct 1 ms 2408 KB Output is correct
47 Correct 0 ms 2408 KB Output is correct
48 Correct 1 ms 2520 KB Output is correct
49 Correct 1 ms 2408 KB Output is correct
50 Correct 1 ms 2408 KB Output is correct
51 Correct 2 ms 2408 KB Output is correct
52 Correct 2 ms 2408 KB Output is correct
53 Correct 6 ms 2408 KB Output is correct
54 Correct 7 ms 2520 KB Output is correct
55 Correct 4 ms 2396 KB Output is correct
56 Correct 6 ms 2396 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2508 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2508 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 0 ms 2508 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 0 ms 2404 KB Output is correct
27 Correct 0 ms 2404 KB Output is correct
28 Correct 1 ms 2404 KB Output is correct
29 Correct 1 ms 2404 KB Output is correct
30 Correct 1 ms 2404 KB Output is correct
31 Correct 1 ms 2404 KB Output is correct
32 Correct 0 ms 2404 KB Output is correct
33 Correct 0 ms 2404 KB Output is correct
34 Correct 1 ms 2532 KB Output is correct
35 Correct 1 ms 2404 KB Output is correct
36 Correct 1 ms 2400 KB Output is correct
37 Correct 1 ms 2408 KB Output is correct
38 Correct 1 ms 2408 KB Output is correct
39 Correct 4 ms 2408 KB Output is correct
40 Correct 1 ms 2408 KB Output is correct
41 Correct 1 ms 2408 KB Output is correct
42 Correct 1 ms 2408 KB Output is correct
43 Correct 1 ms 2408 KB Output is correct
44 Correct 1 ms 2524 KB Output is correct
45 Correct 1 ms 2436 KB Output is correct
46 Correct 1 ms 2408 KB Output is correct
47 Correct 0 ms 2408 KB Output is correct
48 Correct 1 ms 2520 KB Output is correct
49 Correct 1 ms 2408 KB Output is correct
50 Correct 1 ms 2408 KB Output is correct
51 Correct 2 ms 2408 KB Output is correct
52 Correct 2 ms 2408 KB Output is correct
53 Correct 6 ms 2408 KB Output is correct
54 Correct 7 ms 2520 KB Output is correct
55 Correct 4 ms 2396 KB Output is correct
56 Correct 6 ms 2396 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Execution timed out 1062 ms 12892 KB Time limit exceeded
59 Halted 0 ms 0 KB -