# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
402647 | Nicholas_Patrick | Kitchen (BOI19_kitchen) | C++17 | 130 ms | 13544 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 <cstdio>
#include <queue>
#include <bitset>
#include <algorithm>
using namespace std;
const int maxall=300;
const int maxrow=maxall*maxall+1;
int main(){
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
vector<int> a(n), b(m);
int A=0;
for(int& i: a){
scanf("%d", &i);
A+=i;
}
for(int& i: b)
scanf("%d", &i);
if(*min_element(a.begin(), a.end())<k){
printf("Impossible\n");
return 0;
}
sort(b.begin(), b.end());
auto it=upper_bound(b.begin(), b.end(), n);
bitset<maxrow> smallsums;
smallsums[0]=true;
for(auto i=b.begin(); i!=it; i++)
smallsums|=smallsums<<*i;
bitset<maxrow*(maxall+1)> mask;
for(int i=0; i<maxrow; i++)
mask[i+maxrow*min(i/n, maxall)]=smallsums[i];
//bottleneck
for(auto i=it; i!=b.end(); i++)
mask|=mask<<(maxrow+*i)|mask<<*i;
for(int i=A; i<maxrow; i++){
if(mask[i+k*maxrow]){
printf("%d\n", i-A);
return 0;
}
}
printf("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... |