# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915769 | RaulAndrei01 | Kitchen (BOI19_kitchen) | C++14 | 28 ms | 768 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<iostream>
#include<vector>
using namespace std;
const int NMAX = 400;
const int INF = 1e7;
int a[NMAX+1] , b[NMAX+1];
int dp[NMAX*NMAX+1]; // dp[sum] = cate ore max sunt eligibile pt n*k
int main ()
{
int n, m, k;
cin >> n >> m >> k;
int sumA = 0;
bool bad = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sumA += a[i];
if (a[i] < k) bad = 1;
}
int sumB = 0;
for (int i = 1; i <= m; i++)
{
cin >> b[i];
sumB += b[i];
}
if (bad || sumB < sumA) {
cout << "Impossible\n";
return 0;
}
for (int i = 0; i <= sumB; i++)
{
dp[i] = -INF;
}
dp[0] = 0;
for (int i = 1; i <= m; i++)
{
for (int sum = sumB; sum >= b[i]; sum--)
{
int addToNK = min(b[i] , n);
dp[sum] = max(dp[sum] , dp[sum-b[i]] + addToNK);
}
}
int ans = 0;
for (int i = sumA; i <= sumB; i++)
{
if (dp[i] >= n*k)
{
cout << i - sumA << '\n';
return 0;
}
}
cout << "Impossible\n";
}
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... |