# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546200 | MilosMilutinovic | Kitchen (BOI19_kitchen) | C11 | 74 ms | 92108 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 <stdio.h>
#define N 300
#define N_ 90000
#define INF 0x3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N], bb[N], dp[N][N_];
int n, m, k, i, j, s, mn;
scanf("%d%d%d", &n, &m, &k);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]), s += aa[i];
for (i = 0; i < m; i++)
scanf("%d", &bb[i]);
mn = aa[0];
for (i = 1; i < n; i++)
mn = min(mn, aa[i]);
if (mn < k) {
printf("Impossible");
return 0;
}
for (i = 0; i < m; i++)
for (j = 0; j < N_; j++)
dp[i][j] = -INF;
dp[0][0] = 0;
dp[0][bb[0]] = min(n, bb[0]);
for (i = 1; i < m; i++)
for (j = 0; j < N_; j++)
dp[i][j] = max(dp[i - 1][j], (bb[i] <= j ? dp[i - 1][j - bb[i]] + min(n, bb[i]) : INF));
int ans = -1;
for (i = N_ - 1; i >= s; i--)
if (dp[m - 1][i] >= n * k)
ans = i - s;
if (ans == -1)
printf("Impossible");
else
printf("%d", ans);
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... |