# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100951 | 2024-10-15T05:15:20 Z | akzytr | Stove (JOI18_stove) | C++17 | 1 ms | 336 KB |
#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; } sort(times.begin(), times.end()); int dp[times.size() + 2][K + 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--) { for(int left = K; left >= 0; left--) { if(i == times.size() - 1 || times[i].fi + 1 != times[i + 1].fi) { mi_left2[left] = min(mi_left2[left], (tk == 0 ? 0 : (int)1e9) + times[i].fi); mi_left2[left] = min(mi_left2[left], mi_left[left] + times[i].fi); } if(left == 0) { break; } mi_left[left] = mi_left2[left - 1] - times[i].fi; } tk = 1; } cout <<mi_left2[K] <<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 336 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |