| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1101432 |
2024-10-16T08:27:36 Z |
LOLOLO |
K blocks (IZhO14_blocks) |
C++14 |
|
14 ms |
83912 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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 2 |
Correct |
12 ms |
83532 KB |
Output is correct |
| 3 |
Correct |
12 ms |
83708 KB |
Output is correct |
| 4 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 5 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 6 |
Correct |
13 ms |
83912 KB |
Output is correct |
| 7 |
Correct |
12 ms |
83704 KB |
Output is correct |
| 8 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 9 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 10 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 11 |
Incorrect |
12 ms |
83536 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 2 |
Correct |
12 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 |
14 ms |
83536 KB |
Output is correct |
| 6 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 7 |
Correct |
12 ms |
83704 KB |
Output is correct |
| 8 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 9 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 10 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 11 |
Incorrect |
12 ms |
83564 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 2 |
Correct |
12 ms |
83532 KB |
Output is correct |
| 3 |
Correct |
12 ms |
83708 KB |
Output is correct |
| 4 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 5 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 6 |
Correct |
13 ms |
83912 KB |
Output is correct |
| 7 |
Correct |
12 ms |
83704 KB |
Output is correct |
| 8 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 9 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 10 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 11 |
Incorrect |
12 ms |
83536 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 2 |
Correct |
12 ms |
83532 KB |
Output is correct |
| 3 |
Correct |
12 ms |
83708 KB |
Output is correct |
| 4 |
Correct |
11 ms |
83536 KB |
Output is correct |
| 5 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 6 |
Correct |
13 ms |
83912 KB |
Output is correct |
| 7 |
Correct |
12 ms |
83704 KB |
Output is correct |
| 8 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 9 |
Correct |
12 ms |
83536 KB |
Output is correct |
| 10 |
Correct |
13 ms |
83536 KB |
Output is correct |
| 11 |
Incorrect |
12 ms |
83536 KB |
Output isn't correct |
| 12 |
Halted |
0 ms |
0 KB |
- |
