Submission #143123

#	Time	Username	Problem	Language	Result	Execution time	Memory
143123		bupjae	올림픽 피자 (tutorial5)	C++17	50 / 100	1070 ms	2084 KiB

tutorial5

#include "pizza.h"

#include <algorithm>
#include <list>

struct order {
    int id;
    int need_mask;
};

int next_id;
int have_mask;
int have[8];
std::list<order> *orders = nullptr;

void Init() {
    next_id = 0;
    have_mask = 0;
    std::fill(have, have+8, 0);
    delete orders;
    orders = new std::list<order>();
}

void check() {
    auto d = orders->begin();
    while (d != orders->end()) {
        if ((d->need_mask & have_mask) == d->need_mask) {
            Bake(d->id);
            for (int i = 0; i < 8; i++) if ((d->need_mask & (1 << i)) != 0 && --have[i] == 0) have_mask &= ~(1 << i);
            d = orders->erase(d);
        } else {
            ++d;
        }
    }
}

void Order(int N, int *A) {
    int k = 0;
    for (int i = 0; i < N; i++) k |= 1 << A[i];
    orders->emplace_back(order{next_id, k});
    ++next_id;
    check();
}

void Delivery(int I) {
    if (have[I] == 0) have_mask |= 1 << I;
    have[I]++;
    check();
}

Compilation message (stderr)

grader.cpp: In function 'int main(int, char**)':
grader.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 0 / 20
• Subtask 4: 0 / 30