# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143128 | bupjae | 올림픽 피자 (tutorial5) | C++17 | 83 ms | 2828 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 "pizza.h"
#include <algorithm>
#include <list>
int next_id;
int have_mask;
int have[8];
std::list<int> *orders[256];
void Init() {
next_id = 0;
have_mask = 0;
std::fill(have, have + 8, 0);
for (int i = 0; i < 256; i++) {
if (orders[i] != nullptr) delete orders[i];
orders[i] = new std::list<int>();
}
}
void check() {
while (true) {
int id = -1;
int need;
for (int i = 0; i < 256; i++) {
if ((have_mask | i) != have_mask || orders[i]->empty()) continue;
int tid = orders[i]->front();
if (id == -1 || id > tid) {
need = i;
id = tid;
}
}
if (id == -1) break;
Bake(id);
orders[need]->pop_front();
for (int i = 0; i < 8; i++) if ((need & (1 << i)) != 0 && --have[i] == 0) have_mask &= ~(1 << i);
}
}
void Order(int N, int *A) {
int k = 0;
for (int i = 0; i < N; i++) k |= 1 << A[i];
orders[k]->push_back(next_id++);
check();
}
void Delivery(int I) {
if (have[I] == 0) have_mask |= 1 << I;
have[I]++;
check();
}
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... |