# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127015 | TadijaSebez | Kitchen (BOI19_kitchen) | C++11 | 29 ms | 760 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 N=305;
int dp[N*N],a[N],b[N];
int main()
{
int n,m,k;
scanf("%i %i %i",&n,&m,&k);
int A=0;
bool ok=1;
for(int i=1;i<=n;i++)
{
scanf("%i",&a[i]);
A+=a[i];
if(a[i]<k) ok=0;
}
for(int i=1;i<N*N;i++) dp[i]=-1e9;
for(int i=1;i<=m;i++)
{
scanf("%i",&b[i]);
for(int j=N*N-1;j>=b[i];j--)
{
dp[j]=max(dp[j],dp[j-b[i]]+min(b[i],n));
}
}
if(!ok) return 0*printf("Impossible\n");
for(int i=A;i<N*N;i++)
{
if(dp[i]>=k*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... |