| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 343587 |
2021-01-04T08:51:11 Z |
_ani |
K blocks (IZhO14_blocks) |
C++17 |
|
1 ms |
364 KB |
#define BUGO(x) cerr << #x << " = " << (x) << '\n';
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
using ll = long long;
ll dp[100'002][102], a[100'002];
ll mn[4 * 100'002][102];
struct el {
ll x; int ind;
};
bool operator<(const el& a, const el& b) {
return a.x < b.x;
}
void Add(int v, int vl, int vr, int k, int pos) {
if(vl==vr){
mn[v][k] = dp[pos][k];
return;
}
int m = (vl + vr) / 2;
if(pos <= m)
Add(v * 2, vl, m, k, pos);
else Add(v * 2 + 1, m + 1, vr, k, pos);
mn[v][k] = min(mn[v * 2][k], mn[v * 2 + 1][k]);
}
ll Mn(int v, int vl, int vr, int k, int l, int r){
if(vl == l && vr == r){
return mn[v][k];
}
int m = (vl + vr) / 2;
ll res = 1'000'000'000'000'000'000;
if(l <= m) res = min(res, Mn(v * 2, vl, m, k, l, min(r, m)));
if(r > m) res = min(res, Mn(v * 2 + 1, m + 1, vr, k, max(l, m + 1), r));
return res;
}
stack <el> x;
int main()
{
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
for (int curk = 1; curk <= k; curk++)
dp[i][curk] = 1'000'000'000'000'000'000;
for (int i = 1; i <= n; i++)
for (int curk = 1; curk <= k; curk++) {
el prev = {1'000'000'000'000'000'000, 0};
while(!x.empty() && x.top().x < a[i])
x.pop();
if(!x.empty()) prev = x.top();
x.push({a[i], i});
dp[i][curk] = min(prev.x, Mn(1, 0, n, k - 1, prev.ind, i - 1) + a[i]);
Add(1, 1, n, curk, i);
}
/*for (int i = 1; i <= n; i++)
{
for (int curk = 0; curk <= k; curk++)
cerr << dp[i][curk] << ' ';
cerr << '\n';
}*/
cout << dp[n][k] << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
