# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100939 | akzytr | Stove (JOI18_stove) | C++17 | 1068 ms | 10064 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<ll, ll>> times(N);
for(ll i = 0; i < N; i++) {
cin >> times[i].fi;
times[i].se = 1;
}
for(int i = 0; i < N - 1; i++) {
if(times[i + 1].fi != times[i].fi + 1) {
times.push_back({times[i].fi + 1, 0ll});
}
}
times.push_back({times[N - 1].fi + 1, 0ll});
sort(times.begin(), times.end());
ve<ll> occ(times.size(), 0);
for(int i = 0; i < times.size(); i++) {
occ[i] = times[i].se;
}
ll dp[times.size() + 2][K + 1][2];
ll mi_left[K + 1] = {};
bool tk = false;
for(int i = 0; i <= K; i++) {
mi_left[i] = 0;
}
for(ll i = times.size() - 1; i >= 0; i--) {
for(ll left = K; left >= 0; left--) {
tk = (tk || occ[i]);
dp[i][left][0] = (!tk ? 0 : (ll)1e18);
dp[i][left][1] = (ll)1e18;
if(left == 0){
break;
}
if(occ[i]) {
for(ll j = i + 1; j < times.size(); j++) {
dp[i][left][1] = min(dp[i][left][1], dp[j][left - 1][0] + times[j].fi - times[i].fi);
}
mi_left[left] = dp[i][left][1];
} else {
dp[i][left][0] = mi_left[left];
}
}
}
cout << min(dp[0][K][0], dp[0][K][1]) << endl;
}
/*
Subtask 1) N<=20 & Ti<=20
N * K * T greedy
DP[i][left][on] which means the stove is on on the i'th day
DP[i][left][off]
*/
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... |