# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928913 | Faisal_Saqib | Kitchen (BOI19_kitchen) | C++17 | 22 ms | 940 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>
using namespace std;
const int N=301;
int a[N],b[N],c[N];
int dp[(N-1)*N];
signed main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
int n,m,k;
cin>>n>>m>>k;
int s1=0;
int s2=n*k;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(a[i]<k)
{
cout<<"Impossible\n";
exit(0);
}
s1+=a[i];
}
int mx=300*300;
for(int j=0;j<=mx;j++)
dp[j]=-1e9;
dp[0]=0;
int ans=-1;
for(int j=0;j<m;j++)
{
cin>>b[j];
c[j]=min(n,b[j]);
}
for(int j=0;j<m;j++)
{
for(int s3=mx-b[j];s3>=0;s3--)
{
dp[s3+b[j]]=max(dp[s3+b[j]],dp[s3]+c[j]);
}
}
for(int s3=s1;s3<=mx;s3++)
if(dp[s3]>=s2)
{
cout<<s3-s1<<'\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... |