| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 753270 | Olympia | K blocks (IZhO14_blocks) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <map>
#include <set>
using namespace std;
vector<int64_t> p;
const int MX = 30;
//const int MX = 30;
struct SparseTable {
int64_t dp[MX][18];
int64_t query (int l, int r) {
int sz = log2(r - l + 1);
return min(dp[l][sz], dp[r - (1 << sz) + 1][sz]);
}
void upd (vector<int64_t> &a) {
for (int j = 0; j < 18; j++) {
for (int i = 0; i < a.size(); i++) {
if (j == 0) {
dp[i][j] = a[i];
} else {
dp[i][j] = min(dp[i][j - 1], dp[min(i + (1 << (j - 1)), (int)a.size() - 1)][j - 1]);
}
}
}
}
};
int64_t query (vector<int64_t>& val, int l, int r) {
int64_t ans = 1e17;
for (int i = l; i <= r; i++) {
ans = min(ans, val[i]);
}
return ans;
}
void process (vector<int64_t> &val, vector<pair<pair<int,int>, int>> intervals) {
reverse(intervals.begin(), intervals.end());
set<int> unused;
for (int i = 0; i < val.size(); i++) {
unused.insert(i);
}
for (auto& p: intervals) {
while (unused.lower_bound(p.first.first) != unused.end() and *unused.lower_bound(p.first.first) <= p.first.second) {
auto it = unused.lower_bound(p.first.first);
val[*it] = p.second;
unused.erase(*it);
}
}
}
int main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, K;
cin >> N >> K;
vector<int64_t> arr(N);
for (int i = 0; i < N; i++) {
cin >> arr[i];
}
int64_t INF = 1e17;
vector<int64_t> cur(N + 1);
p.assign(N + 1, INF), cur.assign(N + 1, INF);
for (int j = 1; j <= N; j++) {
p[j] = ((j == 1) ? arr[0] : max(p[j - 1], arr[j - 1]));
}
for (int i = 0; i < arr.size(); i++) {
arr[i] = -arr[i];
}
SparseTable st_a;
st_a.upd(arr);
for (int i = 0; i < arr.size(); i++) {
arr[i] = -arr[i];
}
int nxt[N];
for (int j = 0; j < N; j++) {
int l = 0;
int r = j;
while (l != r) {
int m = (l + r)/2;
if (st_a.query(m, j) == -arr[j]) {
r = m;
} else {
l = m + 1;
}
}
nxt[j] = l;
}
while (__builtin_popcount(p.size()) != 1) {
p.push_back(0);
cur.push_back(0);
}
SparseTable st_p;
vector<int64_t> val;
val.assign(N + 1, 0);
for (int i = 2; i <= K; i++) {
for (int j = 0; j < val.size(); j++) {
val[j] = 0;
}
st_p.upd(p);
vector<pair<pair<int,int>,int>> vec;
for (int j = 1; j <= N; j++) {
vec.push_back(make_pair(make_pair(nxt[j - 1], j - 1), arr[j - 1]));
}
process(val, vec);
for (int j = 0; j < val.size(); j++) {
val[j] += p[j];
}
for (int j = 1; j <= N; j++) {
if (j == 1) {
cur[j] = p[0] + arr[0];
} else {
cur[j] = min(query(val, 0, nxt[j - 1] - 1), arr[j - 1] + st_p.query(nxt[j - 1], j - 1));
}
}
swap(cur, p);
if (p == cur) {
break;
}
}
cout << p[N];
}