Submission #5162

#TimeUsernameProblemLanguageResultExecution timeMemory
5162CodingIsHard올림픽 피자 (tutorial5)C++98
100 / 100
60 ms1524 KiB
#include "pizza.h" #include <queue> using namespace std; int num , can; int rest[8]; queue<int> p[256]; void Init() {} void process(int pizza) { Bake(p[pizza].front()); p[pizza].pop(); for(int i = 0;i < 8;i++) if(pizza & (1 << 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(num++); if((pizza & can) == pizza) process(pizza); } void Delivery(int I) { if(++rest[I] == 1) { can |= 1 << I; int iMin = -1; for(int i = can;i > 0;i = (i - 1) & can) { if(!p[i].empty() && (iMin == -1 || p[i].front() < p[iMin].front())) iMin = i; } if(iMin != -1) process(iMin); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...