# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
216111 | MKopchev | Kitchen (BOI19_kitchen) | C++14 | 1097 ms | 10108 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 nmax=3e2+42;
void no()
{
printf("Impossible");
exit(0);
}
int take_min(int a,int b)
{
if(a==-1)return b;
return min(a,b);
}
bool can[nmax*nmax][nmax];//sum, chefs
int n,m,k;
int main()
{
scanf("%i%i%i",&n,&m,&k);
int sum=0,dish;
for(int i=1;i<=n;i++)
{
scanf("%i",&dish);
if(dish<k)no();
sum=sum+dish;
}
can[0][0]=1;
int chef,ret=-1,total=0;
for(int i=1;i<=m;i++)
{
scanf("%i",&chef);
total=total+chef;
for(int j=total;j>=0;j--)
for(int p=i;p>=1;p--)
if(j>=chef&&can[j-chef][p-1])can[j][p]=1;
}
for(int j=total;j>=sum;j--)
for(int p=m;p>=k;p--)
if(can[j][p])ret=take_min(ret,j-sum);
if(ret==-1)no();
printf("%i\n",ret);
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... |