# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303025 | bigg | Kitchen (BOI19_kitchen) | C++14 | 15 ms | 640 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 MAXV = 1e5 + 10;
int dp[MAXV];
int a[310], b[310];
int n, m, k;
int main(){
scanf("%d %d %d", &n, &m, &k);
int soma = 0, mina = 1e9 + 7;
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
mina = min(mina, a[i]);
soma += a[i];
}
for(int i = 1; i <= m; i++) scanf("%d", &b[i]);
if(mina < k){
printf("Impossible\n");
return 0;
}
if(k == 1){
dp[0] = 1;
for(int i = 1; i <= m; i++){
for(int j = 90000 - b[i]; j >= 0; j--){
dp[j + b[i]] |= dp[j];
}
}
for(int i = soma; i <= 90000; i++){
if(dp[i]){
printf("%d\n", i -soma);
return 0;
}
}
printf("Impossible\n");
}
else{
int ans = 1e9 + 7;
for(int i = 0; i <(1<<m); i++){
if(__builtin_popcount(i) < k) continue;
int lsoma = 0;
int chefmin = n*k;
int cheftot = 0;
for(int j = 1; j <= m; j++){
if((1<<(j-1))&i) lsoma += b[j],cheftot += min(n,b[j]);
}
if(cheftot >= chefmin && lsoma >= soma){
ans = min(lsoma - soma, ans);
}
}
if(ans == 1e9 + 7){
printf("Impossible\n");
return 0;
}
printf("%d\n", ans);
}
}
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... |