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 <vector>
using namespace std;
int num , can;
int pos[256] , rest[8];
vector<int> p[256];
void Init() {}
void process(int pizza)
{
    pos[pizza]++;
    for(int i = 0;i < 8;i++)
    {
        if(pizza & (1 << i))
        {
            rest[i]--;
            if(rest[i] == 0)
                can ^= 1 << i;
        }
    }
}
void Order(int N, int *A)
{
    int pizza = 0;
    for(int i = 0;i < N;i++)
        pizza |= 1 << A[i];
    
    p[pizza].push_back(num++);
    if((pizza & can) == pizza)
        process(pizza) , Bake(num - 1);
}
void Delivery(int I)
{
    if(++rest[I] == 1)
        can |= 1 << I;
    bool con;
    do
    {
        int iMin = -1;
        con = false;
        for(int i = 1;i < 256;i++)
        {
            if((i & can) == i && pos[i] != p[i].size() && (iMin == -1 || p[i][pos[i]] < p[iMin][pos[iMin]]))
            {
                iMin = i;
                con = true;
            }
        }
        
        if(con)
            Bake(p[iMin][pos[iMin]]) , process(iMin);
        
    } while (con);
}
| # | 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... |