# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13904 | minsu | 올림픽 피자 (tutorial5) | C++14 | 98 ms | 1860 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 <queue>
#include <algorithm>
using namespace std;
const int INF=987654321;
queue<int> pizza[1<<8];
int on=0,cnt[8];
void Init(){
}
void chk(){
int avpiz=0, minnum=INF, minq;
for(int i=0;i<8;i++)
if(cnt[i]) avpiz|=1<<i;
for(int i=0;i<1<<8;i++){
if(i - (i & avpiz) == 0 && !pizza[i].empty()){
if(minnum>pizza[i].front()){
minnum=pizza[i].front();
minq=i;
}
}
}
if(minnum!=INF){
Bake(minnum); pizza[minq].pop();
for(int i=0;i<8;i++)
if(minq & (1<<i)){
cnt[i]--;
}
# | 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... |