# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
736 | CodingIsHard | 올림픽 피자 (tutorial5) | C++98 | 0 ms | 0 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 <vector>
using namespace std;
int num;
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);
}
void Delivery(int I)
{
if(!rest[I])
can |= 1 << I;
rest[I]++;
do
{
int iMin = -1;
bool con = false;
for(int i = 1;i < 256;i++)
{
if((i & can) == i && pos[i] != v[i].size() && (iMin == -1 || v[i][pos[i]] < v[iMin][pos[iMin]]))
{
iMin = i;
con = true;
}
}
if(con)
process(iMin);
} while (con);
}