oj.uz

Submission #627228

# Submission time Handle Problem Language Result Execution time Memory
627228 2022-08-12T11:36:50 Z model_code Rarest Insects (IOI22_insects) C++17
96.51 / 100
 71 ms 420 KB 
// correct/solution-hocky-binser-bug.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};
  };

  do {
    pair<int, int> bounds = get_bounds(device.size(), checking_set.size());
    if (bounds.first == bounds.second) {
      return bounds.first;
    }
    int middle = (bounds.first + bounds.second + 1) / 2;

    vector<int> just_moved;
    vector<int> next_checking_set;
    for (const auto &insect : checking_set) {
      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);
      }
    }
    if ((int) just_moved.size() + (int) device.size() == distinct * middle) {
      // Increase the lower bound
      device.insert(device.end(), just_moved.begin(), just_moved.end());
      swap(checking_set, next_checking_set);
    } else {
      // Decrease the upper bound
      swap(checking_set, just_moved);
      for(const auto &insect : just_moved){
        move_outside(insect);
      }
    }
  } 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 1 ms 256 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 296 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 9 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 8 ms 304 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 7 ms 296 KB Output is correct
19 Correct 7 ms 300 KB Output is correct
20 Correct 6 ms 308 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 296 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 1 ms 256 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 6 ms 296 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 8 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 3 ms 208 KB Output is correct
13 Correct 4 ms 256 KB Output is correct
14 Correct 9 ms 208 KB Output is correct
15 Correct 3 ms 208 KB Output is correct
16 Correct 8 ms 304 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 7 ms 296 KB Output is correct
19 Correct 7 ms 300 KB Output is correct
20 Correct 6 ms 308 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 3 ms 296 KB Output is correct
23 Correct 26 ms 336 KB Output is correct
24 Correct 14 ms 208 KB Output is correct
25 Correct 16 ms 308 KB Output is correct
26 Correct 16 ms 308 KB Output is correct
27 Correct 26 ms 288 KB Output is correct
28 Correct 14 ms 300 KB Output is correct
29 Correct 33 ms 288 KB Output is correct
30 Correct 30 ms 308 KB Output is correct
31 Correct 40 ms 304 KB Output is correct
32 Correct 39 ms 300 KB Output is correct
33 Correct 22 ms 304 KB Output is correct
34 Correct 33 ms 308 KB Output is correct
35 Correct 34 ms 284 KB Output is correct
36 Correct 14 ms 312 KB Output is correct
37 Correct 14 ms 304 KB Output is correct
38 Correct 30 ms 356 KB Output is correct
39 Correct 11 ms 208 KB Output is correct
40 Correct 11 ms 288 KB Output is correct
41 Correct 11 ms 300 KB Output is correct

Subtask #3
71.51 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 220 KB Output is correct
7 Correct 51 ms 292 KB Output is correct
8 Correct 15 ms 308 KB Output is correct
9 Correct 53 ms 304 KB Output is correct
10 Correct 46 ms 300 KB Output is correct
11 Partially correct 61 ms 304 KB Output is partially correct
12 Correct 30 ms 304 KB Output is correct
13 Partially correct 60 ms 300 KB Output is partially correct
14 Partially correct 46 ms 340 KB Output is partially correct
15 Correct 51 ms 416 KB Output is correct
16 Correct 71 ms 356 KB Output is correct
17 Correct 47 ms 304 KB Output is correct
18 Correct 46 ms 300 KB Output is correct
19 Partially correct 66 ms 308 KB Output is partially correct
20 Correct 55 ms 304 KB Output is correct
21 Correct 61 ms 304 KB Output is correct
22 Correct 55 ms 300 KB Output is correct
23 Partially correct 42 ms 420 KB Output is partially correct
24 Correct 25 ms 304 KB Output is correct
25 Correct 35 ms 300 KB Output is correct
26 Correct 23 ms 356 KB Output is correct
27 Correct 56 ms 312 KB Output is correct
28 Correct 53 ms 292 KB Output is correct
29 Partially correct 65 ms 304 KB Output is partially correct
30 Partially correct 31 ms 300 KB Output is partially correct
31 Correct 28 ms 304 KB Output is correct
32 Correct 64 ms 308 KB Output is correct
33 Partially correct 34 ms 300 KB Output is partially correct
34 Partially correct 60 ms 300 KB Output is partially correct
35 Partially correct 56 ms 324 KB Output is partially correct
36 Partially correct 53 ms 304 KB Output is partially correct
37 Correct 55 ms 308 KB Output is correct
38 Correct 29 ms 296 KB Output is correct
39 Correct 26 ms 308 KB Output is correct
40 Correct 44 ms 296 KB Output is correct
41 Partially correct 40 ms 312 KB Output is partially correct
42 Partially correct 39 ms 304 KB Output is partially correct
43 Partially correct 13 ms 340 KB Output is partially correct
44 Partially correct 20 ms 304 KB Output is partially correct
45 Correct 58 ms 304 KB Output is correct
46 Correct 23 ms 312 KB Output is correct
47 Correct 31 ms 300 KB Output is correct
48 Correct 21 ms 304 KB Output is correct