# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
762182 | anha3k25cvp | Kitchen (BOI19_kitchen) | C++14 | 29 ms | 468 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 ll long long
#define ull unsigned long long
#define dl double
#define st first
#define nd second
#define II pair <int, int>
using namespace std;
const int N = 5 + 1e5;
const int inf = 7 + 1e9;
vector <int> a, f;
int main() {
#define TASKNAME ""
ios_base :: sync_with_stdio (0);
cin.tie (0);
if ( fopen( TASKNAME".inp", "r" ) ) {
freopen (TASKNAME".inp", "r", stdin);
freopen (TASKNAME".out", "w", stdout);
}
int n, m, k;
cin >> n >> m >> k;
int val = 0;
for (int i = 1; i <= n; i ++) {
int x;
cin >> x;
if (x < k) {
cout << "Impossible";
return 0;
}
val += x;
}
int ma = 0;
a.assign(m + 1, 0);
for (int i = 1; i <= m; i ++) {
cin >> a[i];
ma += a[i];
}
f.assign(ma + 1, 0);
int ans = inf;
for (int num = 0; num <= m; num ++)
for (int sum = ma; sum >= 0; sum --) {
if (num < m && sum + a[num + 1] <= ma)
f[sum + a[num + 1]] = max(f[sum + a[num + 1]], f[sum] + min(a[num + 1], n));
if (sum >= val && f[sum] >= n * k)
ans = min(ans, sum);
}
if (ans < inf)
cout << ans - val;
else
cout << "Impossible";
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... |