oj.uz

답안 #1101471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101471 2024-10-16T08:48:20 Z LOLOLO K개의 묶음 (IZhO14_blocks) C++14
53 / 100
 52 ms 85840 KB 
#include <bits/stdc++.h>
#define int long long
#define f first
#define pii pair<int, int>
#define s second
 
const int N = 1e5 + 5;
const int block = 450;
const int oo = 99999989;
const int base = 31;
 
using namespace std;
 
int n, a[N], dp[N][105], rmq[N][20], k;
 
int get(int l, int r){
	if(r == l) return rmq[l][0];
	int k = __lg(r - l + 1);
	return max(rmq[l][k], rmq[r - (1 << k) + 1][k]);
}
 
signed main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
 
	
	cin >> n >> k;
	for(int i = 1;i <= n;i++) cin >> a[i], rmq[i][0] = a[i];
	
	for(int j = 1;(1 << j) <= n;j++){
		for(int i = 1; i + (1 << j) - 1 <= n;i++){
			rmq[i][j] = max(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
		}
	}
	
	memset(dp, 0x4f, sizeof(dp));
	dp[0][1] = 0;
	for(int i = 1;i <= n;i++) dp[i][1] = max(dp[i - 1][1], a[i]);
	
	
	for(int j = 2;j <= k;j++){
		for(int i = j;i <= n;i++){
		  
		  int tmp = (i - 40) * (n * k > 1e5);
			for(int h = max(j, tmp);h <= i;h++){
				dp[i][j] = min(dp[i][j], dp[h - 1][j - 1] + get(h,  i));
			}
		}
	}
	cout << dp[n][k];
	return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 11 ms 83536 KB Output is correct
3 Correct 12 ms 83536 KB Output is correct
4 Correct 12 ms 83536 KB Output is correct
5 Correct 12 ms 83536 KB Output is correct
6 Correct 11 ms 83536 KB Output is correct
7 Correct 13 ms 83548 KB Output is correct
8 Correct 12 ms 83536 KB Output is correct
9 Correct 12 ms 83756 KB Output is correct
10 Correct 11 ms 83572 KB Output is correct
11 Correct 11 ms 83704 KB Output is correct
12 Correct 13 ms 83960 KB Output is correct
13 Correct 13 ms 83536 KB Output is correct
14 Correct 12 ms 83536 KB Output is correct
15 Correct 12 ms 83716 KB Output is correct
16 Correct 11 ms 83540 KB Output is correct
17 Correct 12 ms 83536 KB Output is correct
18 Correct 12 ms 83644 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 83536 KB Output is correct
2 Correct 13 ms 83536 KB Output is correct
3 Correct 14 ms 83536 KB Output is correct
4 Correct 13 ms 83536 KB Output is correct
5 Correct 15 ms 83536 KB Output is correct
6 Correct 13 ms 83684 KB Output is correct
7 Correct 12 ms 83536 KB Output is correct
8 Correct 13 ms 83536 KB Output is correct
9 Correct 12 ms 83536 KB Output is correct
10 Correct 14 ms 83536 KB Output is correct
11 Correct 12 ms 83788 KB Output is correct
12 Correct 11 ms 83536 KB Output is correct
13 Correct 12 ms 83536 KB Output is correct
14 Correct 13 ms 83536 KB Output is correct
15 Correct 12 ms 83536 KB Output is correct
16 Correct 13 ms 83548 KB Output is correct
17 Correct 14 ms 83568 KB Output is correct
18 Correct 13 ms 83536 KB Output is correct
19 Correct 14 ms 83536 KB Output is correct
20 Correct 12 ms 83536 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 11 ms 83536 KB Output is correct
3 Correct 12 ms 83536 KB Output is correct
4 Correct 12 ms 83536 KB Output is correct
5 Correct 12 ms 83536 KB Output is correct
6 Correct 11 ms 83536 KB Output is correct
7 Correct 13 ms 83548 KB Output is correct
8 Correct 12 ms 83536 KB Output is correct
9 Correct 12 ms 83756 KB Output is correct
10 Correct 11 ms 83572 KB Output is correct
11 Correct 11 ms 83704 KB Output is correct
12 Correct 13 ms 83960 KB Output is correct
13 Correct 13 ms 83536 KB Output is correct
14 Correct 12 ms 83536 KB Output is correct
15 Correct 12 ms 83716 KB Output is correct
16 Correct 11 ms 83540 KB Output is correct
17 Correct 12 ms 83536 KB Output is correct
18 Correct 12 ms 83644 KB Output is correct
19 Correct 14 ms 83536 KB Output is correct
20 Correct 13 ms 83536 KB Output is correct
21 Correct 14 ms 83536 KB Output is correct
22 Correct 13 ms 83536 KB Output is correct
23 Correct 15 ms 83536 KB Output is correct
24 Correct 13 ms 83684 KB Output is correct
25 Correct 12 ms 83536 KB Output is correct
26 Correct 13 ms 83536 KB Output is correct
27 Correct 12 ms 83536 KB Output is correct
28 Correct 14 ms 83536 KB Output is correct
29 Correct 12 ms 83788 KB Output is correct
30 Correct 11 ms 83536 KB Output is correct
31 Correct 12 ms 83536 KB Output is correct
32 Correct 13 ms 83536 KB Output is correct
33 Correct 12 ms 83536 KB Output is correct
34 Correct 13 ms 83548 KB Output is correct
35 Correct 14 ms 83568 KB Output is correct
36 Correct 13 ms 83536 KB Output is correct
37 Correct 14 ms 83536 KB Output is correct
38 Correct 12 ms 83536 KB Output is correct
39 Correct 13 ms 83536 KB Output is correct
40 Correct 12 ms 83544 KB Output is correct
41 Correct 11 ms 83536 KB Output is correct
42 Correct 12 ms 83536 KB Output is correct
43 Correct 12 ms 83536 KB Output is correct
44 Correct 14 ms 83536 KB Output is correct
45 Correct 14 ms 83548 KB Output is correct
46 Correct 12 ms 83704 KB Output is correct
47 Correct 12 ms 83536 KB Output is correct
48 Correct 12 ms 83536 KB Output is correct
49 Correct 13 ms 83532 KB Output is correct
50 Correct 14 ms 83536 KB Output is correct
51 Correct 13 ms 83536 KB Output is correct
52 Correct 13 ms 83540 KB Output is correct
53 Correct 14 ms 83536 KB Output is correct
54 Correct 12 ms 83536 KB Output is correct
55 Correct 13 ms 83536 KB Output is correct
56 Correct 13 ms 83536 KB Output is correct
57 Correct 12 ms 83704 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 11 ms 83536 KB Output is correct
3 Correct 12 ms 83536 KB Output is correct
4 Correct 12 ms 83536 KB Output is correct
5 Correct 12 ms 83536 KB Output is correct
6 Correct 11 ms 83536 KB Output is correct
7 Correct 13 ms 83548 KB Output is correct
8 Correct 12 ms 83536 KB Output is correct
9 Correct 12 ms 83756 KB Output is correct
10 Correct 11 ms 83572 KB Output is correct
11 Correct 11 ms 83704 KB Output is correct
12 Correct 13 ms 83960 KB Output is correct
13 Correct 13 ms 83536 KB Output is correct
14 Correct 12 ms 83536 KB Output is correct
15 Correct 12 ms 83716 KB Output is correct
16 Correct 11 ms 83540 KB Output is correct
17 Correct 12 ms 83536 KB Output is correct
18 Correct 12 ms 83644 KB Output is correct
19 Correct 14 ms 83536 KB Output is correct
20 Correct 13 ms 83536 KB Output is correct
21 Correct 14 ms 83536 KB Output is correct
22 Correct 13 ms 83536 KB Output is correct
23 Correct 15 ms 83536 KB Output is correct
24 Correct 13 ms 83684 KB Output is correct
25 Correct 12 ms 83536 KB Output is correct
26 Correct 13 ms 83536 KB Output is correct
27 Correct 12 ms 83536 KB Output is correct
28 Correct 14 ms 83536 KB Output is correct
29 Correct 12 ms 83788 KB Output is correct
30 Correct 11 ms 83536 KB Output is correct
31 Correct 12 ms 83536 KB Output is correct
32 Correct 13 ms 83536 KB Output is correct
33 Correct 12 ms 83536 KB Output is correct
34 Correct 13 ms 83548 KB Output is correct
35 Correct 14 ms 83568 KB Output is correct
36 Correct 13 ms 83536 KB Output is correct
37 Correct 14 ms 83536 KB Output is correct
38 Correct 12 ms 83536 KB Output is correct
39 Correct 13 ms 83536 KB Output is correct
40 Correct 12 ms 83544 KB Output is correct
41 Correct 11 ms 83536 KB Output is correct
42 Correct 12 ms 83536 KB Output is correct
43 Correct 12 ms 83536 KB Output is correct
44 Correct 14 ms 83536 KB Output is correct
45 Correct 14 ms 83548 KB Output is correct
46 Correct 12 ms 83704 KB Output is correct
47 Correct 12 ms 83536 KB Output is correct
48 Correct 12 ms 83536 KB Output is correct
49 Correct 13 ms 83532 KB Output is correct
50 Correct 14 ms 83536 KB Output is correct
51 Correct 13 ms 83536 KB Output is correct
52 Correct 13 ms 83540 KB Output is correct
53 Correct 14 ms 83536 KB Output is correct
54 Correct 12 ms 83536 KB Output is correct
55 Correct 13 ms 83536 KB Output is correct
56 Correct 13 ms 83536 KB Output is correct
57 Correct 12 ms 83704 KB Output is correct
58 Incorrect 52 ms 85840 KB Output isn't correct
59 Halted 0 ms 0 KB -