oj.uz

Submission #876840

# Submission time Handle Problem Language Result Execution time Memory
876840 2023-11-22T12:24:10 Z Kanon Counting Mushrooms (IOI20_mushrooms) C++14
94.1667 / 100
 6 ms 1044 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
 
using namespace std;
 
int magic = 50;
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> order(2 * magic);
  iota(order.begin(), order.end(), 1);
 
  int cnt = 2 * magic + 1;
  vector<int> zeros, ones;
  zeros.push_back(0);
 
  while (zeros.size() < 3 && ones.size() < 3) {
 
    int st = use_machine({0, cnt++});
    a[cnt - 1] = a[0] ^ (st & 1);
 
    if (a[cnt - 1] == 0) zeros.push_back(cnt - 1);
    else ones.push_back(cnt - 1);
 
  }
 
  int p1, p2, p3, bit;
  if (zeros.size() >= 3) {
    p1 = zeros[0], p2 = zeros[1], p3 = zeros[2], bit = 0;
  } else {
    p1 = ones[0], p2 = ones[1], p3 = ones[2], bit = 1;
  }
  zeros.clear();
  ones.clear();
 
  auto calc = [&](vector<int> d) {
 
    vector<int> que = {p1, d[0], p2};
    if (d.size() > 1) {
      que.push_back(d[1]);
      que.push_back(p3);
    }
    que.push_back(cnt++);
 
    int st = use_machine(que);
 
    a[cnt - 1] = bit ^ (st & 1);
 
    st -= st & 1;
    st >>= 1;
    if (bit == 1) st = d.size() - st;
    return st;
 
  };
 
  function<void(vector<int>)> solve = [&](vector<int> pos) {
    
    if (pos.empty()) return;
    if (pos.size() == 1) {
      int p = pos[0];
      a[p] = calc({p});
      return;
    }
 
    shuffle(pos.begin(), pos.end(), rng);
    vector<int> L, R;
    for (int i = 0; i + 1 < (int) pos.size(); i += 2) {
 
      int sum = calc({pos[i], pos[i + 1]});
 
      if (sum == 1) {
        L.push_back(pos[i]);
        R.push_back(pos[i + 1]);
      } else {
        a[pos[i]] = a[pos[i + 1]] = sum >> 1;
      }
 
    }
 
    if (pos.size() & 1) {
 
      int p = pos.back();
      a[p] = calc({p});
 
    }
 
    solve(L);
    for (int i = 0; i < (int) L.size(); i++) {
 
      int l = L[i], r = R[i];
      assert(a[l] != -1);
 
      a[r] = a[l] ^ 1;
 
    }
 
  };
  solve(order);
 
  int ret = 0;
  for (int i = 0; i < n; i++) {
    ret += a[i] == 0;
    if (a[i] == 0) zeros.push_back(i);
    if (a[i] == 1) ones.push_back(i);
  }
 
  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
94.1667 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 708 KB Output is correct
7 Correct 4 ms 544 KB Output is correct
8 Correct 4 ms 540 KB Output is correct
9 Correct 4 ms 540 KB Output is correct
10 Correct 5 ms 1044 KB Output is correct
11 Correct 5 ms 552 KB Output is correct
12 Correct 4 ms 540 KB Output is correct
13 Correct 4 ms 772 KB Output is correct
14 Correct 3 ms 508 KB Output is correct
15 Correct 5 ms 556 KB Output is correct
16 Correct 4 ms 556 KB Output is correct
17 Correct 2 ms 496 KB Output is correct
18 Correct 4 ms 676 KB Output is correct
19 Correct 4 ms 548 KB Output is correct
20 Correct 4 ms 540 KB Output is correct
21 Correct 5 ms 544 KB Output is correct
22 Correct 5 ms 548 KB Output is correct
23 Correct 5 ms 620 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 6 ms 548 KB Output is correct
26 Correct 4 ms 540 KB Output is correct
27 Correct 4 ms 552 KB Output is correct
28 Correct 4 ms 544 KB Output is correct
29 Correct 4 ms 552 KB Output is correct
30 Correct 4 ms 548 KB Output is correct
31 Partially correct 4 ms 548 KB Output is partially correct
32 Correct 4 ms 552 KB Output is correct
33 Partially correct 5 ms 544 KB Output is partially correct
34 Partially correct 5 ms 548 KB Output is partially correct
35 Partially correct 5 ms 548 KB Output is partially correct
36 Partially correct 4 ms 552 KB Output is partially correct
37 Partially correct 4 ms 544 KB Output is partially correct
38 Partially correct 5 ms 552 KB Output is partially correct
39 Partially correct 5 ms 548 KB Output is partially correct
40 Partially correct 5 ms 800 KB Output is partially correct
41 Partially correct 4 ms 600 KB Output is partially correct
42 Partially correct 4 ms 556 KB Output is partially correct
43 Partially correct 4 ms 556 KB Output is partially correct
44 Partially correct 4 ms 552 KB Output is partially correct
45 Partially correct 5 ms 544 KB Output is partially correct
46 Partially correct 5 ms 804 KB Output is partially correct
47 Partially correct 5 ms 548 KB Output is partially correct
48 Partially correct 5 ms 548 KB Output is partially correct
49 Partially correct 4 ms 548 KB Output is partially correct
50 Partially correct 4 ms 800 KB Output is partially correct
51 Partially correct 4 ms 540 KB Output is partially correct
52 Partially correct 4 ms 552 KB Output is partially correct
53 Partially correct 4 ms 600 KB Output is partially correct
54 Partially correct 5 ms 548 KB Output is partially correct
55 Partially correct 4 ms 548 KB Output is partially correct
56 Partially correct 4 ms 548 KB Output is partially correct
57 Partially correct 5 ms 548 KB Output is partially correct
58 Partially correct 4 ms 548 KB Output is partially correct
59 Partially correct 5 ms 804 KB Output is partially correct
60 Partially correct 4 ms 544 KB Output is partially correct
61 Partially correct 5 ms 552 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 1 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 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 0 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 348 KB Output is correct
79 Correct 0 ms 356 KB Output is correct
80 Correct 0 ms 352 KB Output is correct
81 Correct 0 ms 356 KB Output is correct
82 Correct 0 ms 356 KB Output is correct
83 Correct 0 ms 356 KB Output is correct
84 Correct 0 ms 356 KB Output is correct
85 Correct 1 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 1 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct