# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299865 | ly20 | Kitchen (BOI19_kitchen) | C++17 | 4 ms | 512 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;
const int MAXN = 310;
bool dp[MAXN * MAXN];
int sm[MAXN];
int n, m, k;
int main() {
bool ok = true;
scanf("%d %d %d", &n, &m, &k);
int ms = 0;
for(int i = 0; i < n; i++) {
int a;
scanf("%d", &a); ms += a;
if(a < k) ok = false;
}
//printf("%d\n", ms);
if(m < k) ok = false;
dp[0] = 1;
for(int i = 0; i < m; i++) {
int a;
scanf("%d", &a);
for(int j = MAXN * MAXN - 1; j >= a; j--) {
int p = min(n, a);
if(dp[j - a]) {
//printf("%d\n", j);
dp[j] = 1;
int t = p + sm[j - a];
sm[j] = max(t, sm[j]);
//printf("%d\n", sm[j]);
}
}
}
int ft = ms - 1;
for(int i = ms; i < MAXN * MAXN; i++) {
if(sm[i] >= n * k) {
//printf("%d\n", i);
ft = i;
break;
}
}
if(ft == ms - 1 || !ok) printf("Impossible\n");
else printf("%d\n", ft - ms);
return 0;
}
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... |