# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546201 | 2022-04-06T15:59:37 Z | MilosMilutinovic | Kitchen (BOI19_kitchen) | C | 73 ms | 92204 KB |
#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
# | 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 | Incorrect | 73 ms | 92204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 12 ms | 14292 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 | - |