| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 578 | gs13068 | 올림픽 피자 (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"grader.h"
#include<vector>
void Init(){}
int v[256][100000];
int f[256],b[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][b[j]++]=ordern++;
do
{
min=-1;
flag=false;
for(i=0;i<256;i++)
{
if(i&can!=i)continue;
flag=true;
if(f[i]<b[i]&&(v[i][f[i]]<v[min][f[min]]||min==-1))
min=i;
}
if(flag)
{
Bake(v[min][f[min]]);
f[min]++;
for(i=0;i<8;i++)
{
if(max&(1<<i))
{
jaeryo[i]--;
if(jaeryo[i]==0)
can^=1<<i;
}
}
}
}while(flag);
}
void Delivery(int x)
{
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;
flag=true;
if(f[i]<b[i]&&(v[i][f[i]]<v[min][f[min]]||min==-1))
min=i;
}
if(flag)
{
Bake(v[min][f[min]]);
f[min]++;
for(i=0;i<8;i++)
{
if(max&(1<<i))
{
jaeryo[i]--;
if(jaeryo[i]==0)
can^=1<<i;
}
}
}
}while(flag);
}