oj.uz

Submission #627627

# Submission time Handle Problem Language Result Execution time Memory
627627 2022-08-12T17:45:33 Z I_love_Hoang_Yen Rarest Insects (IOI22_insects) C++17
99.89 / 100
 57 ms 428 KB 
// solution-hocky-blacklist-binser.cpp
#include "insects.h"

#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) {

  vector<int> device;
  vector<int> checking_set;

  for (int i = 0; i < N; i++) {
    move_inside(i);
    int max_occurrence = press_button();
    if (max_occurrence == 2) {
      move_outside(i);
      checking_set.push_back(i);
    } else {
      device.push_back(i);
    }
  }

  int distinct = device.size();
  auto get_bounds = [&](int device_size, int checking_size) -> pair<int, int> {
    return {device_size / distinct, (device_size + checking_size) / distinct};
  };

  vector <int> blacklist(N);
  pair<int, int> bounds = get_bounds(device.size(), checking_set.size());

  vector<pair<int, int>> just_moved;
  do {
    if (bounds.first == bounds.second) {
      return bounds.first;
    }
    assert(bounds.first < bounds.second);
    int middle = (bounds.first + bounds.second + 1) / 2;
    vector<int> next_checking_set;
    for (const auto &insect : checking_set) {
      if(blacklist[insect]) {
        next_checking_set.push_back(insect);
        continue;
      }
      move_inside(insect);
      int max_occurrence = press_button();
      if (max_occurrence > middle) {
        move_outside(insect);
        next_checking_set.push_back(insect);
      } else {
        just_moved.push_back({insect, max_occurrence});
      }
    }
    if ((int) just_moved.size() + (int) device.size() == distinct * middle) {
      // Increase the lower bound
      for (const auto &insect : just_moved) {
        device.push_back(insect.first);
      }
      swap(checking_set, next_checking_set);
      bounds = get_bounds(device.size(), checking_set.size());
      just_moved.clear();
      blacklist.assign(N, 0);
    } else {

      // Decrease the upper bound
      bounds = get_bounds(device.size(), just_moved.size());
      if (bounds.first < bounds.second) {
        checking_set.clear();
        int next_middle = (bounds.first + bounds.second + 1) / 2;
        int pushed = 0;
        for (int i = 0; i < (int) just_moved.size(); i++) {
          const auto &insect = just_moved[i];
          if (insect.second <= next_middle) {
            pushed++;
          } else {
            if(i > 0 && just_moved[i - 1].second < just_moved[i].second) blacklist[insect.first] = 1;
            move_outside(insect.first);
            checking_set.push_back(insect.first);
          }
        }
        just_moved.resize(pushed);
      } else {
        return bounds.first;
      }
    }
  } while (true);

  return 0;
}

Subtask #1
10.0 / 10.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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 4 ms 300 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 296 KB Output is correct
22 Correct 2 ms 336 KB Output is correct

Subtask #2
15.0 / 15.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 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 7 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 5 ms 304 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 4 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 4 ms 300 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 296 KB Output is correct
22 Correct 2 ms 336 KB Output is correct
23 Correct 24 ms 308 KB Output is correct
24 Correct 8 ms 308 KB Output is correct
25 Correct 25 ms 284 KB Output is correct
26 Correct 22 ms 312 KB Output is correct
27 Correct 18 ms 208 KB Output is correct
28 Correct 7 ms 308 KB Output is correct
29 Correct 24 ms 208 KB Output is correct
30 Correct 26 ms 304 KB Output is correct
31 Correct 27 ms 308 KB Output is correct
32 Correct 29 ms 304 KB Output is correct
33 Correct 31 ms 428 KB Output is correct
34 Correct 25 ms 296 KB Output is correct
35 Correct 29 ms 296 KB Output is correct
36 Correct 23 ms 208 KB Output is correct
37 Correct 27 ms 304 KB Output is correct
38 Correct 23 ms 304 KB Output is correct
39 Correct 21 ms 304 KB Output is correct
40 Correct 12 ms 208 KB Output is correct
41 Correct 9 ms 304 KB Output is correct

Subtask #3
74.89 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 56 ms 208 KB Output is correct
8 Correct 15 ms 308 KB Output is correct
9 Correct 28 ms 372 KB Output is correct
10 Correct 56 ms 208 KB Output is correct
11 Correct 37 ms 296 KB Output is correct
12 Correct 24 ms 304 KB Output is correct
13 Correct 39 ms 324 KB Output is correct
14 Correct 34 ms 352 KB Output is correct
15 Correct 45 ms 320 KB Output is correct
16 Correct 41 ms 336 KB Output is correct
17 Correct 32 ms 312 KB Output is correct
18 Correct 39 ms 308 KB Output is correct
19 Correct 36 ms 312 KB Output is correct
20 Correct 45 ms 304 KB Output is correct
21 Correct 57 ms 304 KB Output is correct
22 Correct 56 ms 208 KB Output is correct
23 Correct 40 ms 408 KB Output is correct
24 Correct 42 ms 300 KB Output is correct
25 Correct 25 ms 304 KB Output is correct
26 Correct 15 ms 304 KB Output is correct
27 Correct 54 ms 208 KB Output is correct
28 Correct 48 ms 336 KB Output is correct
29 Partially correct 37 ms 312 KB Output is partially correct
30 Partially correct 53 ms 300 KB Output is partially correct
31 Correct 29 ms 420 KB Output is correct
32 Correct 41 ms 308 KB Output is correct
33 Correct 24 ms 300 KB Output is correct
34 Correct 37 ms 208 KB Output is correct
35 Partially correct 42 ms 336 KB Output is partially correct
36 Partially correct 40 ms 424 KB Output is partially correct
37 Correct 48 ms 308 KB Output is correct
38 Correct 45 ms 308 KB Output is correct
39 Correct 52 ms 308 KB Output is correct
40 Correct 44 ms 208 KB Output is correct
41 Partially correct 38 ms 300 KB Output is partially correct
42 Partially correct 32 ms 304 KB Output is partially correct
43 Correct 11 ms 208 KB Output is correct
44 Correct 47 ms 312 KB Output is correct
45 Correct 44 ms 416 KB Output is correct
46 Correct 32 ms 296 KB Output is correct
47 Correct 16 ms 300 KB Output is correct
48 Correct 33 ms 328 KB Output is correct