# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134962 | Bodo171 | Kitchen (BOI19_kitchen) | C++14 | 414 ms | 4216 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 <fstream>
#include <bitset>
#include <algorithm>
using namespace std;
const int nmax=305;
bitset<nmax*nmax> pot,dp[nmax];
int minim[nmax*nmax];
int a[nmax];
int n,m,k,sum,i,j,x;
int main()
{
//freopen("data.in","r",stdin);
ios_base::sync_with_stdio(false);
cin>>n>>m>>k;
for(i=1;i<=n;i++)
{
cin>>x;sum+=x;
if(x<k)
{
cout<<"Impossible\n";
return 0;
}
}
for(i=1;i<=m;i++)
cin>>a[i];
sort(a+1,a+m+1);
pot[0]=1;
for(i=1;i<=m&&a[i]<=n;i++)
{
# | 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... |