# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1205345 | Trn115 | 올림픽 피자 (tutorial5) | C++20 | 388 ms | 1028 KiB |
#include <bits/stdc++.h>
#include "pizza.h"
using namespace std;
int k;
vector<int> cnt;
vector<deque<int>> orders;
int getbit(int x, int i) {return (x >> i) & 1;}
void invertbit(int &x, int i) {x ^= (1 << i);}
void Init()
{
k = 0;
cnt.assign(8, 0);
orders.resize(1 << 8);
}
void Try_Bake() {
pair<int, int> can = {1e9, 0};
for (int i = 0; i < (1 << 8); ++i) {
bool sat = true;
for (int j = 0; j < 8; ++j) {
if (getbit(i, j) == 1 && cnt[j] == 0) {
sat = false;
break;
}
}
if (sat && !orders[i].empty()) {
int v = orders[i].front();
can = min(can, {v, i});
}
}
if (can.first == 1e9) return;
orders[can.second].pop_front();
Bake(can.first);
Try_Bake();
}
void Order(int N, int *A)
{
int x = 0;
for (int i = 0; i < N; ++i) invertbit(x, A[i]);
orders[x].push_back(k++);
Try_Bake();
}
void Delivery(int I)
{
++cnt[I];
Try_Bake();
}
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... |