# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747733 | 2023-05-24T15:22:41 Z | nguyentunglam | Kitchen (BOI19_kitchen) | C++17 | 27 ms | 1364 KB |
#include<bits/stdc++.h> #define fi first #define se second #define endl "\n" #define ii pair<int, int> using namespace std; const int N = 310, M = 300 * 300; vector<int> lst[2]; int f[M + 10], g[M + 10], h[M + 10]; int main() { #define task "" cin.tie(0) -> sync_with_stdio(0); if (fopen ("task.inp", "r")) { freopen ("task.inp", "r", stdin); freopen ("task.out", "w", stdout); } if (fopen (task".inp", "r")) { freopen (task".inp", "r", stdin); freopen (task".out", "w", stdout); } int n, m, k; cin >> n >> m >> k; int sum = 0, ans = 1e9; for(int i = 1; i <= n; i++) { int x; cin >> x; if (x < k) return cout << "Impossible", 0; sum += x; } for(int i = 1; i <= m; i++) { int x; cin >> x; if (x <= n) lst[0].push_back(x); else lst[1].push_back(x); } f[0] = 1; for(int &val : lst[0]) for(int j = M; j >= val; j--) if (f[j - val]) f[j] = 1; h[M + 1] = 1e9; for(int j = M; j >= 0; j--) { h[j] = f[j] ? j : h[j + 1]; g[j] = -1e9; } g[0] = 0; for(int &val : lst[1]) for(int j = M; j >= val; j--) g[j] = max(g[j], g[j - val] + 1); for(int j = 0; j <= M; j++) { int tmp = max(n * k - g[j] * n, sum - j); tmp = max(tmp, 0); if (tmp > M) continue; int i = h[tmp]; ans = min(ans, j + i - sum); } if (ans > 1e8) return cout << "Impossible", 0; cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 980 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 980 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1232 KB | Output is correct |
2 | Correct | 17 ms | 1168 KB | Output is correct |
3 | Correct | 21 ms | 1152 KB | Output is correct |
4 | Correct | 27 ms | 1140 KB | Output is correct |
5 | Incorrect | 23 ms | 1364 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 980 KB | Output is correct |
2 | Incorrect | 5 ms | 980 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 980 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |