# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336897 | seedkin | 올림픽 피자 (tutorial5) | C11 | 1075 ms | 3052 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"
struct Order {
int next[8];
int prev[8];
int need[8];
int needCnt;
int live;
};
int order_num;
int material[8];
struct Order order[100000];
int root[8];
int last[8];
int check(int need[8], int needCnt) {
for(int i =0; i< needCnt; i++) {
if(material[need[i]] == 0) return 0;
}
return 1;
}
void Init() {
order_num = 0;
for(int i = 0; i < 8; i++) {
material[i] = 0;
root[i] = -1;
Compilation message (stderr)
# | 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... |