Submission #18937

#TimeUsernameProblemLanguageResultExecution timeMemory
18937dltldls95올림픽 피자 (tutorial5)C++98
0 / 100
1000 ms5236 KiB
#include <iostream> #include <cstring> #include "pizza.h" #define C(a) memset((a),0,sizeof(a)) using namespace std; int order[100000][8]; int ordered[100000]; int firstorder = -1; int lastorder = -1; int currentFood[8]; void Init() { C(order); C(ordered); } void CheckAll() { for(int i = firstorder; i < lastorder; i++) { if(!ordered[i]) continue; bool bakable = true; for(int j = 0; j < 8; j++) { if(order[i][j] == 1 && currentFood[j] == 0) bakable = false; } if(bakable) { Bake(i); ordered[i] = 0; for(int j = 0; j < 8; j++) { if(order[i][j]) currentFood[j]--; } if(i == firstorder) { for(int j = firstorder+1; j < 100000; j++) { if(ordered[j]) { firstorder = j; } } } } } } void Order(int n, int* a) { if(firstorder == -1) firstorder = 0; lastorder++; for(int i = 0; i < n; i++) { order[lastorder][a[i]]++; ordered[i] = 1; } CheckAll(); } void Delivery(int l) { currentFood[l]++; CheckAll(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...