# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100960 | akzytr | Stove (JOI18_stove) | C++17 | 1057 ms | 2128 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 <bits/stdc++.h>
using namespace std;
template <typename T> using ve = vector<T>;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define endl '\n'
int main() {
int N, K;
cin >> N >> K;
ve<pair<int, int>> times(N);
for(int i = 0; i < N; i++) {
scanf("%d", ×[i].fi);
times[i].se = 1;
}
int mi_left[K + 1] = {};
int mi_left2[K + 1] = {};
bool tk = false;
for(int i = 0; i <= K; i++) {
mi_left[i] = 0;
mi_left2[i] = 1e9;
}
for(int i = times.size() - 1; i >= 0; i--) {
if(i == times.size() - 1 || times[i].fi + 1 != times[i + 1].fi) {
for(int left = K; left >= 0; left--) {
mi_left2[left] = min(mi_left2[left], (tk == 0 ? 0 : (int)1e9) + times[i].fi + 1);
if(left == 0) {
break;
}
mi_left2[left] = min(mi_left2[left], mi_left[left] + times[i].fi + 1);
}
}
tk = 1;
for(int left = K; left >= 0; left--) {
mi_left2[left] = min(mi_left2[left], (int)1e9 + times[i].fi);
if(left == 0) {
break;
}
mi_left[left] = min((int)1e9, mi_left2[left - 1] - times[i].fi);
}
}
cout << mi_left[K] << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |