| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 745869 | vjudge1 | Kitchen (BOI19_kitchen) | C++17 | 3 ms | 312 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 <vector>
#include <queue>
#include <algorithm>
using namespace std;
struct meal {
int t, k;
bool operator<(const meal& m)const {
return k < m.k;
}
};
int sum1, sum2;
int check(int mask, vector<int>& ch, vector<meal>& m) {
priority_queue<meal> q;
int x = sum1, y = sum2;
for (int i = 0; i < ch.size(); i++) {
if (((1 << i)&mask) == 0)continue;
x -= ch[i];
y -= min((int)m.size(), ch[i]);
}
if (y > 0 || x > 0)return INT32_MAX;
return -x;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, k;
cin >> n >> m >> k;
vector<meal> meals(n);
bool b = 1;
for (int i = 0; i < n; i++) {
cin >> meals[i].t;
meals[i].k = k;
if (meals[i].t < k)b = 0;
sum1 += meals[i].t;
sum2 += k;
}
vector<int> ch(m);
for (int& i : ch)cin >> i;
int ans = INT32_MAX;
for (int i = 0; i < (1 << m); i++) {
ans = min(ans, check(i, ch, meals));
}
if (ans == INT32_MAX || !b)cout << "Impossible\n";
else cout << ans << endl;
}
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... | ||||
