oj.uz

답안 #1101447

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101447 2024-10-16T08:32:35 Z LOLOLO K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 14 ms 83788 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(dp[l][k], dp[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++){
			for(int h = j;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
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 12 ms 83536 KB Output is correct
3 Correct 11 ms 83548 KB Output is correct
4 Correct 12 ms 83668 KB Output is correct
5 Correct 14 ms 83548 KB Output is correct
6 Correct 12 ms 83788 KB Output is correct
7 Correct 13 ms 83540 KB Output is correct
8 Correct 12 ms 83536 KB Output is correct
9 Correct 12 ms 83536 KB Output is correct
10 Correct 11 ms 83536 KB Output is correct
11 Incorrect 12 ms 83548 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 13 ms 83704 KB Output is correct
3 Correct 13 ms 83536 KB Output is correct
4 Correct 12 ms 83704 KB Output is correct
5 Correct 12 ms 83536 KB Output is correct
6 Correct 12 ms 83548 KB Output is correct
7 Correct 12 ms 83536 KB Output is correct
8 Correct 11 ms 83536 KB Output is correct
9 Correct 13 ms 83536 KB Output is correct
10 Correct 12 ms 83536 KB Output is correct
11 Incorrect 12 ms 83704 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 12 ms 83536 KB Output is correct
3 Correct 11 ms 83548 KB Output is correct
4 Correct 12 ms 83668 KB Output is correct
5 Correct 14 ms 83548 KB Output is correct
6 Correct 12 ms 83788 KB Output is correct
7 Correct 13 ms 83540 KB Output is correct
8 Correct 12 ms 83536 KB Output is correct
9 Correct 12 ms 83536 KB Output is correct
10 Correct 11 ms 83536 KB Output is correct
11 Incorrect 12 ms 83548 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 83536 KB Output is correct
2 Correct 12 ms 83536 KB Output is correct
3 Correct 11 ms 83548 KB Output is correct
4 Correct 12 ms 83668 KB Output is correct
5 Correct 14 ms 83548 KB Output is correct
6 Correct 12 ms 83788 KB Output is correct
7 Correct 13 ms 83540 KB Output is correct
8 Correct 12 ms 83536 KB Output is correct
9 Correct 12 ms 83536 KB Output is correct
10 Correct 11 ms 83536 KB Output is correct
11 Incorrect 12 ms 83548 KB Output isn't correct
12 Halted 0 ms 0 KB -