# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747738 | nguyentunglam | Kitchen (BOI19_kitchen) | C++17 | 36 ms | 1308 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>
#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++) if (g[j] >= 0) {
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 (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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |