oj.uz

Submission #336890

# Submission time Handle Problem Language Result Execution time Memory
336890 2020-12-17T07:24:32 Z seedkin 올림픽 피자 (tutorial5) C
70 / 100
 1000 ms 2432 KB 
#include "pizza.h"

struct Order {
  int next;
  int prev;
  int need[8];
  int needCnt;
};

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;
  }
}

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].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) {
    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

grader.c: In function 'main':
grader.c:65:3: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result]

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 364 KB Output is correct
2 Correct 17 ms 364 KB Output is correct
3 Correct 17 ms 492 KB Output is correct
4 Correct 18 ms 364 KB Output is correct
5 Correct 17 ms 364 KB Output is correct
6 Correct 17 ms 364 KB Output is correct
7 Correct 17 ms 364 KB Output is correct
8 Correct 17 ms 364 KB Output is correct
9 Correct 17 ms 364 KB Output is correct
10 Correct 17 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1516 KB Output is correct
2 Correct 45 ms 2028 KB Output is correct
3 Correct 40 ms 1388 KB Output is correct
4 Correct 45 ms 2156 KB Output is correct
5 Correct 47 ms 2304 KB Output is correct
6 Correct 47 ms 2412 KB Output is correct
7 Correct 37 ms 1260 KB Output is correct
8 Correct 49 ms 2432 KB Output is correct
9 Correct 44 ms 1900 KB Output is correct
10 Correct 36 ms 1280 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 1516 KB Time limit exceeded
2 Halted 0 ms 0 KB -