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>
void Init(){}
std::vector<int> v[256];
int f[256];
int ordern;
int jaeryo[8];
int can;
void Order(int n,int *a)
{
bool flag;
int i,j=0,min;
for(i=0;i<n;i++)j=j|(1<<a[i]);
v[j].push_back(ordern++);
do
{
min=-1;
flag=false;
for(i=0;i<256;i++)
{
if((i&can)!=i)continue;
if(f[i]<v[i].size()&&(v[i][f[i]]<v[min][f[min]]||min==-1))
{
flag=true;
min=i;
}
}
if(flag)
{
Bake(v[min][f[min]]);
f[min]++;
for(i=0;i<8;i++)
{
if(min&(1<<i))
{
jaeryo[i]--;
if(jaeryo[i]==0)
can^=1<<i;
}
}
}
}while(flag);
}
void Delivery(int x)
{
int i,min;
bool flag;
if(jaeryo[x]==0)can|=1<<x;
jaeryo[x]++;
do
{
min=-1;
flag=false;
for(i=0;i<256;i++)
{
if(i&can!=i)continue;
if(f[i]<v[i].size()&&(v[i][f[i]]<v[min][f[min]]||min==-1))
{
flag=true;
min=i;
}
}
if(flag)
{
Bake(v[min][f[min]]);
f[min]++;
for(i=0;i<8;i++)
{
if(min&(1<<i))
{
jaeryo[i]--;
if(jaeryo[i]==0)
can^=1<<i;
}
}
}
}while(flag);
}
# | 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... |