oj.uz

Submission #1002996

# Submission time Handle Problem Language Result Execution time Memory
1002996 2024-06-19T23:45:05 Z MilosMilutinovic Counting Mushrooms (IOI20_mushrooms) C++14
84.3284 / 100
 5 ms 880 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

int count_mushrooms(int n) {
  if (n <= 227) {
    int res = 1;
    for (int i = 1; i < n; i++) {
      res += 1 - use_machine({0, i});
    }
    return res;
  }
  const int C = 70;
  vector<int> a(1, 0);
  vector<int> b;
  for (int i = 1; i <= 2; i++) {
    if (use_machine({0, i})) {
      b.push_back(i); 
    } else {
      a.push_back(i);
    }
  }
  int res = (int) a.size();
  int ptr = 3;
  while ((int) a.size() < C && (int) b.size() < C) {
    if (ptr >= n) {
      break;
    }
    if (ptr + 2 >= n) {
      for (int i = ptr; i < n; i++) {
        if (use_machine({0, i}) == 0) {
          res += 1;
          a.push_back(i);
        }
      }
      ptr = n;
      break;
    }
    int x = ptr, y = ptr + 1, z = ptr + 2;
    if (a.size() > b.size()) {
      int p = use_machine({x, a[0], y, a[1], z});
      if (p == 0) {
        res += 3;
        a.push_back(x);
        a.push_back(y);
        a.push_back(z);
      } else if (p == 4) {
        b.push_back(x);
        b.push_back(y);
        b.push_back(z);
      } else if (p == 2) {
        int q = use_machine({a[0], y});
        if (q == 0) {
          a.push_back(y);
          res += 1;
          b.push_back(x);
          b.push_back(z);
        } else {
          a.push_back(x);
          a.push_back(z);
          res += 2;
          b.push_back(y);
        }
      } else if (p == 1) {
        int q = use_machine({a[0], x});
        if (q == 0) {
          a.push_back(x);
          a.push_back(y);
          res += 2;
          b.push_back(z); 
        } else {
          a.push_back(y);
          a.push_back(z);
          res += 2;
          b.push_back(x);
        }
      } else {
        int q = use_machine({a[0], x});
        if (q == 0) {
          a.push_back(x);
          res += 1;
          b.push_back(y);
          b.push_back(z);
        } else {
          a.push_back(z);
          res += 1;
          b.push_back(x);
          b.push_back(y);
        }
      }
    } else {
      int p = 4 - use_machine({x, b[0], y, b[1], z});
      if (p == 0) {
        res += 3;
        a.push_back(x);
        a.push_back(y);
        a.push_back(z);
      } else if (p == 4) {
        b.push_back(x);
        b.push_back(y);
        b.push_back(z);
      } else if (p == 2) {
        int q = 1 - use_machine({b[0], y});
        if (q == 0) {
          a.push_back(y);
          res += 1;
          b.push_back(x);
          b.push_back(z);
        } else {
          a.push_back(x);
          a.push_back(z);
          res += 2;
          b.push_back(y);
        }
      } else if (p == 1) {
        int q = 1 - use_machine({b[0], x});
        if (q == 0) {
          a.push_back(x);
          a.push_back(y);
          res += 2;
          b.push_back(z); 
        } else {
          a.push_back(y);
          a.push_back(z);
          res += 2;
          b.push_back(x);
        }
      } else {
        int q = 1 - use_machine({b[0], x});
        if (q == 0) {
          a.push_back(x);
          res += 1;
          b.push_back(y);
          b.push_back(z);
        } else {
          a.push_back(z);
          res += 1;
          b.push_back(x);
          b.push_back(y);
        }
      }
    }
    ptr += 3;
  }
  if (ptr >= n) {
    return res;
  }
  while (ptr < n) {
    if (a.size() > b.size()) {
      int c = min(n - ptr, (int) a.size());
      vector<int> qv;
      for (int i = 0; i < c; i++) {
        qv.push_back(a[i]);
        qv.push_back(ptr + i);
      }
      int d = use_machine(qv);
      if (d % 2 == 0) {
        a.push_back(qv.back());
        res += 1;
      } else {
        b.push_back(qv.back());
      }
      res += (c - 1 - (d / 2));
      ptr += c;
    } else {
      int c = min(n - ptr, (int) b.size());
      vector<int> qv;
      for (int i = 0; i < c; i++) {
        qv.push_back(b[i]);
        qv.push_back(ptr + i);
      }
      int d = use_machine(qv);
      if (d % 2 == 0) {
        b.push_back(qv.back());
      } else {
        a.push_back(qv.back());
        res += 1;
      }
      res += d / 2;
      ptr += c;
    }
  }
  return res;
}

Subtask #1
84.3284 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 5 ms 440 KB Output is correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 3 ms 452 KB Output is partially correct
12 Partially correct 4 ms 600 KB Output is partially correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 3 ms 456 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 472 KB Output is partially correct
20 Correct 3 ms 344 KB Output is correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 3 ms 344 KB Output is correct
25 Partially correct 4 ms 460 KB Output is partially correct
26 Partially correct 3 ms 456 KB Output is partially correct
27 Partially correct 3 ms 460 KB Output is partially correct
28 Partially correct 3 ms 444 KB Output is partially correct
29 Partially correct 3 ms 444 KB Output is partially correct
30 Partially correct 3 ms 460 KB Output is partially correct
31 Partially correct 3 ms 344 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 ms 600 KB Output is partially correct
35 Partially correct 3 ms 344 KB Output is partially correct
36 Partially correct 3 ms 460 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 344 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 3 ms 344 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 4 ms 456 KB Output is partially correct
44 Partially correct 3 ms 344 KB Output is partially correct
45 Partially correct 3 ms 600 KB Output is partially correct
46 Partially correct 3 ms 344 KB Output is partially correct
47 Partially correct 3 ms 600 KB Output is partially correct
48 Partially correct 3 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 3 ms 344 KB Output is partially correct
52 Partially correct 3 ms 344 KB Output is partially correct
53 Partially correct 3 ms 600 KB Output is partially correct
54 Partially correct 3 ms 452 KB Output is partially correct
55 Partially correct 4 ms 344 KB Output is partially correct
56 Partially correct 5 ms 880 KB Output is partially correct
57 Partially correct 4 ms 344 KB Output is partially correct
58 Partially correct 3 ms 344 KB Output is partially correct
59 Partially correct 3 ms 456 KB Output is partially correct
60 Partially correct 3 ms 464 KB Output is partially correct
61 Partially correct 5 ms 344 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 368 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 340 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct