oj.uz

Submission #664614

# Submission time Handle Problem Language Result Execution time Memory
664614 2022-11-27T07:57:15 Z evenvalue Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 9 ms 448 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

using int64 = long long;
using ld = long double;

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
constexpr int kConst = 151;

int count_mushrooms(int n) {
  if (n == 2) {
    return 1 + (1 - use_machine({0, 1}));
  }

  auto next_two = [&](const vector<int> &s, const int x, const int y) {
    assert(s.size() >= 2);
    return use_machine({x, s[0], y, s[1]});
  };

  bool same;

  auto get_next = [&](const vector<int> &s, const int l) -> pair<int, int> {
    vector<int> query;
    for (int i = l, j = 0; i < n and j < s.size(); i++, j++) {
      query.push_back(i);
      query.push_back(s[j]);
    }
    const int x = use_machine(query);
    same = (x % 2 == 0);
    int ans = (not same) + (x / 2);
    return make_pair(ans, query.size() / 2);
  };

  vector<int> zero = {0}, ones;
  for (int x : {1, 2}) {
    if (use_machine({0, x}) == 0) {
      zero.push_back(x);
    } else {
      ones.push_back(x);
    }
  }

  for (int i = 3; i < min(n, kConst); i += 2) {
    if (i == n - 1) {
      if (use_machine({0, i}) == 0) {
        zero.push_back(i);
      } else {
        ones.push_back(i);
      }
      break;
    }
    if (zero.size() > ones.size()) {
      const int x = next_two(zero, i, i + 1);
      ((x & 1) == 0 ? zero : ones).push_back(i);
      ((x & 2) == 0 ? zero : ones).push_back(i + 1);
    } else {
      const int x = next_two(ones, i, i + 1);
      ((x & 1) == 0 ? ones : zero).push_back(i);
      ((x & 2) == 0 ? ones : zero).push_back(i + 1);
    }
  }

  int ans = zero.size();
  for (int i = kConst; i < n;) {
    if (zero.size() > ones.size()) {
      const auto &[inc, used] = get_next(zero, i);
      (same ? zero : ones).push_back(i);
      ans += used - inc;
      i += used;
    } else {
      const auto &[inc, used] = get_next(ones, i);
      (same ? ones : zero).push_back(i);
      ans += inc;
      i += used;
    }
  }

  return ans;
}

Compilation message

mushrooms.cpp: In lambda function:
mushrooms.cpp:32:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for (int i = l, j = 0; i < n and j < s.size(); i++, j++) {
      |                                      ~~^~~~~~~~~~

Subtask #1
92.623 / 100.0

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