# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336891 | 2020-12-17T07:31:47 Z | seedkin | 올림픽 피자 (tutorial5) | C | 1000 ms | 7936 KB |
#include "pizza.h" struct Order { int next; int prev; int need[8]; int needCnt; int c[8]; }; int order_num; int material[8]; struct Order order[100000]; int root = -1; int last = -1; 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; root = -1; last = -1; for(int i = 0; i < 8; i++) { material[i] = 0; } for(int i =0; i< 100000; i++) { for(int j =0; j < 8; j++) { order[i].c[j] = 0; } } } void Order(int N, int *A) { int r = check(A, N); if(r) { Bake(order_num); order_num++; for(int i =0; i < N; i++) { material[A[i]]--; } return; } order[order_num].needCnt = N; for(int i =0; i < N; i++) { order[order_num].need[i] = A[i]; order[order_num].c[A[i]] = 1; } order[order_num].next = -1; order[order_num].prev = -1; if(root == -1) { root = order_num; last = order_num; order_num++; return; } order[last].next = order_num; order[order_num].prev = last; last = order_num; order_num++; return; } void Delivery(int I) { material[I]++; if(root == -1) return; if(material[I] > 1) return; int cur = root; while(cur != -1) { if(order[cur].c[I] == 0) { cur = order[cur].next; continue; } int r = check(order[cur].need, order[cur].needCnt); if(r) { Bake(cur); for(int i =0; i < order[cur].needCnt; i++) { material[order[cur].need[i]]--; } if(cur == root) { root = order[cur].next; if( root != -1) order[root].prev = -1; cur = root; continue; } if ( cur == last) { last = order[cur].prev; if(last != -1) order[last].next = -1; break; } order[order[cur].prev].next = order[cur].next; order[order[cur].next].prev = order[cur].prev; } cur = order[cur].next; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 7788 KB | Output is correct |
2 | Correct | 5 ms | 7788 KB | Output is correct |
3 | Correct | 5 ms | 7788 KB | Output is correct |
4 | Correct | 5 ms | 7788 KB | Output is correct |
5 | Correct | 5 ms | 7788 KB | Output is correct |
6 | Correct | 5 ms | 7788 KB | Output is correct |
7 | Correct | 5 ms | 7788 KB | Output is correct |
8 | Correct | 4 ms | 7788 KB | Output is correct |
9 | Correct | 6 ms | 7788 KB | Output is correct |
10 | Correct | 4 ms | 7808 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 25 ms | 7788 KB | Output is correct |
2 | Correct | 23 ms | 7788 KB | Output is correct |
3 | Correct | 25 ms | 7916 KB | Output is correct |
4 | Correct | 25 ms | 7788 KB | Output is correct |
5 | Correct | 24 ms | 7916 KB | Output is correct |
6 | Correct | 25 ms | 7788 KB | Output is correct |
7 | Correct | 24 ms | 7788 KB | Output is correct |
8 | Correct | 23 ms | 7808 KB | Output is correct |
9 | Correct | 23 ms | 7788 KB | Output is correct |
10 | Correct | 25 ms | 7788 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 7916 KB | Output is correct |
2 | Correct | 53 ms | 7916 KB | Output is correct |
3 | Correct | 56 ms | 7916 KB | Output is correct |
4 | Correct | 50 ms | 7916 KB | Output is correct |
5 | Correct | 52 ms | 7808 KB | Output is correct |
6 | Correct | 52 ms | 7916 KB | Output is correct |
7 | Correct | 41 ms | 7916 KB | Output is correct |
8 | Correct | 50 ms | 7788 KB | Output is correct |
9 | Correct | 46 ms | 7916 KB | Output is correct |
10 | Correct | 41 ms | 7916 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1088 ms | 7936 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |