# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100930 | 2024-10-15T04:20:19 Z | akzytr | Stove (JOI18_stove) | C++17 | 1000 ms | 10212 KB |
#include <bits/stdc++.h> using namespace std; template <typename T> using ve = vector<T>; template <typename T, int sz> using ar = array<T, sz>; 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<ll> times; map<ll, ll> occ; for(ll i = 0; i < N; i++) { ll x; cin >> x; times.pb(x); occ[x] = 1; times.pb(x + 1); } sort(times.begin(), times.end()); times.erase(unique(times.begin(), times.end()), times.end()); ll dp[times.size() + 2][K+1][2]; for(ll i = 0; i < times.size(); i++) { for(ll j = 0; j <= K; j++) { dp[i][j][0] = (ll)1e18; dp[i][j][1] = (ll)1e18; } } for(ll i = times.size() - 1; i >= 0; i--) { if(occ[times[i]]) { break; } for(ll k = 0; k <= K; k++) { dp[i][k][0] = 0; } } for(ll i = times.size() - 1; i >= 0; i--) { for(ll left = K; left >= 1; left--) { // ON if(occ[times[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] - times[i]); } } else { for(ll j = i + 1; j < times.size(); j++) { if(occ[times[j]] == 1) { dp[i][left][0] = min(dp[i][left][0], dp[j][left][1]); break; } } } } } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Correct | 1 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 336 KB | Output is correct |
4 | Correct | 1 ms | 336 KB | Output is correct |
5 | Correct | 1 ms | 336 KB | Output is correct |
6 | Correct | 1 ms | 336 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 ms | 336 KB | Output is correct |
9 | Correct | 1 ms | 336 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Correct | 1 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 336 KB | Output is correct |
4 | Correct | 1 ms | 336 KB | Output is correct |
5 | Correct | 1 ms | 336 KB | Output is correct |
6 | Correct | 1 ms | 336 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 ms | 336 KB | Output is correct |
9 | Correct | 1 ms | 336 KB | Output is correct |
10 | Correct | 157 ms | 1776 KB | Output is correct |
11 | Execution timed out | 1079 ms | 10212 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 336 KB | Output is correct |
2 | Correct | 1 ms | 336 KB | Output is correct |
3 | Correct | 1 ms | 336 KB | Output is correct |
4 | Correct | 1 ms | 336 KB | Output is correct |
5 | Correct | 1 ms | 336 KB | Output is correct |
6 | Correct | 1 ms | 336 KB | Output is correct |
7 | Correct | 1 ms | 336 KB | Output is correct |
8 | Correct | 1 ms | 336 KB | Output is correct |
9 | Correct | 1 ms | 336 KB | Output is correct |
10 | Correct | 157 ms | 1776 KB | Output is correct |
11 | Execution timed out | 1079 ms | 10212 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |