oj.uz

Submission #876376

# Submission time Handle Problem Language Result Execution time Memory
876376 2023-11-21T16:02:59 Z Kanon Counting Mushrooms (IOI20_mushrooms) C++14
95.7627 / 100
 5 ms 1056 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"

using namespace std;

const int magic = 100;
const int bound = 226;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// generate random number between l, r : uniform_int_distribution<long long>(l, r)(rng)
// random shuffle : shuffle(.begin(), .end(), rng)

int count_mushrooms(int n) {

  if (n <= bound + 1) {
    int ret = 1;
    for (int i = 1; i < n; i++) {
      ret += use_machine({0, i}) ^ 1;
    }
    return ret;
  }

  vector<int> a(n, -1);
  a[0] = 0;

  vector<int> zeros = {0};
  vector<int> ones;
  int cnt = 1;

  while (max(zeros.size(), ones.size()) < magic) {

    vector<int> ids = zeros.size() >= ones.size() ? zeros : ones;
    int memo = cnt;
    int L = cnt, R = cnt + min(ids.size(), magic - ids.size()) - 1;
    cnt = R + 1;

    int bit = ids == ones;

    vector<int> cur;
    for (int i = L; i <= R; i++) cur.push_back(i);
    shuffle(cur.begin(), cur.end(), rng);

    vector<int> que;
    for (int i = 0; i < (int) cur.size(); i++) {
      que.push_back(ids[i]);
      que.push_back(cur[i]);
    }

    int sum = use_machine(que);

    a[cur.back()] = bit ^ (sum & 1);
    sum -= a[cur.back()] ^ bit;
    sum >>= 1;
    cur.pop_back();
    sum = bit == 1 ? cur.size() - sum : sum;

    function<void(vector<int>, int)> solve = [&](vector<int> cur, int sum) {
      assert(sum >= 0 && sum <= (int) cur.size());
      if (sum == 0) {
        for (int i : cur) a[i] = 0;
        return;
      }
      if (sum == (int) cur.size()) {
        for (int i : cur) a[i] = 1;
        return;
      }

      assert(cur.size() >= 2);
      vector<int> Lq, Rq;
      int mid = cur.size() / 2;
      for (int i = 0; i < (int) cur.size(); i++) {
        if (i < mid) Lq.push_back(cur[i]);
        else Rq.push_back(cur[i]);
      }

      vector<int> p;
      for (int i = 0; i < (int) Lq.size(); i++) {
        p.push_back(ids[i]);
        p.push_back(Lq[i]);
      }
      p.push_back(ids[Lq.size()]);
      p.push_back(cnt++);

      int Lsum = use_machine(p);
      a[cnt - 1] = bit ^ (Lsum & 1);
      Lsum -= a[cnt - 1] ^ bit;
      Lsum >>= 1;
      Lsum = bit == 1 ? Lq.size() - Lsum : Lsum;

      solve(Lq, Lsum);
      solve(Rq, sum - Lsum);

    };

    solve(cur, sum);

    for (int i = memo; i < cnt; i++) {
      if (a[i] == 0) zeros.push_back(i);
      else ones.push_back(i);
    }
  }

  int ret = 0;
  ret += zeros.size();

  while (cnt < n) {

    int len = min(n - cnt, (int) max(zeros.size(), ones.size()));
    vector<int> ids = zeros.size() >= ones.size() ? zeros : ones;

    vector<int> que;
    for (int i = 0; i < len; i++) {
      que.push_back(ids[i]);
      que.push_back(cnt++);
    }

    int st = use_machine(que);

    if (ids == ones) {

      a[cnt - 1] = 1 ^ (st & 1);
      ret += a[cnt - 1] == 0;
      st -= a[cnt - 1] == 0;

      if (a[cnt - 1] == 0) zeros.push_back(cnt - 1);
      else ones.push_back(cnt - 1);

      assert(st % 2 == 0);
      ret += st >> 1;

    } else {

      a[cnt - 1] = 0 ^ (st & 1);
      ret += a[cnt - 1] == 0;
      st -= a[cnt - 1] == 1;

      if (a[cnt - 1] == 0) zeros.push_back(cnt - 1);
      else ones.push_back(cnt - 1);

      assert(st % 2 == 0);
      ret += (len - 1) - (st >> 1);

    }
  }
  return ret;

}

Subtask #1
95.7627 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 432 KB Output is correct
3 Correct 1 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 460 KB Output is correct
7 Correct 3 ms 808 KB Output is correct
8 Correct 3 ms 712 KB Output is correct
9 Correct 3 ms 556 KB Output is correct
10 Correct 4 ms 556 KB Output is correct
11 Correct 4 ms 548 KB Output is correct
12 Correct 4 ms 548 KB Output is correct
13 Correct 3 ms 544 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Partially correct 4 ms 544 KB Output is partially correct
16 Correct 4 ms 552 KB Output is correct
17 Correct 2 ms 496 KB Output is correct
18 Correct 3 ms 544 KB Output is correct
19 Partially correct 4 ms 796 KB Output is partially correct
20 Correct 4 ms 544 KB Output is correct
21 Correct 4 ms 552 KB Output is correct
22 Partially correct 4 ms 548 KB Output is partially correct
23 Correct 4 ms 804 KB Output is correct
24 Correct 2 ms 500 KB Output is correct
25 Partially correct 4 ms 544 KB Output is partially correct
26 Partially correct 4 ms 548 KB Output is partially correct
27 Partially correct 4 ms 632 KB Output is partially correct
28 Partially correct 4 ms 548 KB Output is partially correct
29 Partially correct 4 ms 556 KB Output is partially correct
30 Partially correct 4 ms 552 KB Output is partially correct
31 Partially correct 4 ms 800 KB Output is partially correct
32 Partially correct 4 ms 792 KB Output is partially correct
33 Partially correct 4 ms 552 KB Output is partially correct
34 Correct 4 ms 548 KB Output is correct
35 Partially correct 4 ms 804 KB Output is partially correct
36 Partially correct 5 ms 548 KB Output is partially correct
37 Partially correct 4 ms 800 KB Output is partially correct
38 Partially correct 4 ms 548 KB Output is partially correct
39 Partially correct 4 ms 804 KB Output is partially correct
40 Partially correct 5 ms 548 KB Output is partially correct
41 Correct 4 ms 552 KB Output is correct
42 Partially correct 4 ms 796 KB Output is partially correct
43 Partially correct 4 ms 556 KB Output is partially correct
44 Partially correct 4 ms 548 KB Output is partially correct
45 Partially correct 4 ms 556 KB Output is partially correct
46 Partially correct 4 ms 556 KB Output is partially correct
47 Partially correct 4 ms 548 KB Output is partially correct
48 Partially correct 4 ms 552 KB Output is partially correct
49 Correct 4 ms 544 KB Output is correct
50 Partially correct 4 ms 804 KB Output is partially correct
51 Partially correct 4 ms 548 KB Output is partially correct
52 Correct 4 ms 544 KB Output is correct
53 Partially correct 4 ms 544 KB Output is partially correct
54 Partially correct 4 ms 1056 KB Output is partially correct
55 Partially correct 4 ms 552 KB Output is partially correct
56 Partially correct 4 ms 548 KB Output is partially correct
57 Partially correct 4 ms 552 KB Output is partially correct
58 Partially correct 4 ms 804 KB Output is partially correct
59 Partially correct 4 ms 552 KB Output is partially correct
60 Partially correct 4 ms 604 KB Output is partially correct
61 Partially correct 4 ms 548 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 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 340 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 1 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 436 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 596 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 0 ms 600 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 356 KB Output is correct
86 Correct 1 ms 352 KB Output is correct
87 Correct 0 ms 440 KB Output is correct
88 Correct 0 ms 352 KB Output is correct
89 Correct 0 ms 352 KB Output is correct
90 Correct 0 ms 352 KB Output is correct
91 Correct 0 ms 356 KB Output is correct