| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 745867 | vjudge1 | Kitchen (BOI19_kitchen) | C++17 | 1092 ms | 296 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>
using namespace std;
struct meal {
int t, k;
bool operator<(const meal& m)const {
return k < m.k;
}
};
int check(int mask, vector<int>& ch, vector<meal>& m) {
priority_queue<meal> q;
int sum = 0;
for (meal i : m) {
q.push(i);
sum += i.t;
}
for (int i = 0; i < ch.size(); i++) {
if (((1 << i)&mask) == 0)continue;
sum -= ch[i];
vector<meal> out;
for (int j = 0; j < ch[i]; j++) {
if (q.empty())break;
meal x = q.top();
q.pop();
x.k--;
out.push_back(x);
}
for (meal j : out)q.push(j);
}
if (q.top().k > 0 || sum > 0)return INT32_MAX;
return -sum;
}
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;
}
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... | ||||
