| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 938763 | Alebn | Kitchen (BOI19_kitchen) | C++14 | 2 ms | 348 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>
#define int long long
#define M 16
using namespace std;
int n, m, k, A = 0, B = 0, res = -1;
bool flag = false;
vector<int> a, b;
signed main() {
cin >> n >> m >> k;
a = vector<int>(n), b = vector<int>(m);
for(int i = 0; i < n; i++) {
cin >> a[i];
A += a[i];
if(a[i] < k) flag = true;
}
for(int i = 0; i < m; i++) {
cin >> b[i];
B += b[i];
}
// try every subset
vector<int> diff;
bitset<M> bin;
int sus, sum;
bool check;
for(int i = 0; i < (1 << m); i++) {
sum = 0, sus = 0;
for(int j = 0; j < m; j++) {
if(i & (1 << j)) {
sum += b[j];
sus += min(n, b[j]);
}
}
if(sum >= A && sus >= n * k) {
if(res == -1) res = sum - A;
else res = min(res, sum - A);
}
}
if(flag || res == -1) cout << "Impossible\n";
else cout << res << "\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... | ||||
