답안 #627622

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
627622 2022-08-12T17:44:27 Z I_love_Hoang_Yen 드문 곤충 (IOI22_insects) C++17
96.51 / 100
92 ms 336 KB
#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;
}
# 결과 실행 시간 메모리 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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 4 ms 224 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 4 ms 224 KB Output is correct
9 Correct 3 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 5 ms 208 KB Output is correct
13 Correct 5 ms 208 KB Output is correct
14 Correct 6 ms 208 KB Output is correct
15 Correct 6 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 6 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 5 ms 208 KB Output is correct
20 Correct 4 ms 208 KB Output is correct
21 Correct 2 ms 208 KB Output is correct
22 Correct 3 ms 208 KB Output is correct
23 Correct 30 ms 304 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 29 ms 304 KB Output is correct
26 Correct 28 ms 296 KB Output is correct
27 Correct 17 ms 304 KB Output is correct
28 Correct 5 ms 308 KB Output is correct
29 Correct 26 ms 288 KB Output is correct
30 Correct 17 ms 308 KB Output is correct
31 Correct 23 ms 208 KB Output is correct
32 Correct 25 ms 296 KB Output is correct
33 Correct 20 ms 208 KB Output is correct
34 Correct 30 ms 300 KB Output is correct
35 Correct 22 ms 308 KB Output is correct
36 Correct 30 ms 208 KB Output is correct
37 Correct 21 ms 208 KB Output is correct
38 Correct 13 ms 304 KB Output is correct
39 Correct 22 ms 284 KB Output is correct
40 Correct 15 ms 328 KB Output is correct
41 Correct 7 ms 300 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 208 KB Output is correct
7 Correct 50 ms 296 KB Output is correct
8 Correct 16 ms 308 KB Output is correct
9 Correct 62 ms 300 KB Output is correct
10 Correct 84 ms 300 KB Output is correct
11 Partially correct 38 ms 308 KB Output is partially correct
12 Correct 23 ms 300 KB Output is correct
13 Partially correct 92 ms 304 KB Output is partially correct
14 Partially correct 46 ms 296 KB Output is partially correct
15 Correct 45 ms 304 KB Output is correct
16 Correct 49 ms 312 KB Output is correct
17 Correct 47 ms 300 KB Output is correct
18 Correct 56 ms 308 KB Output is correct
19 Partially correct 65 ms 208 KB Output is partially correct
20 Correct 58 ms 300 KB Output is correct
21 Correct 61 ms 304 KB Output is correct
22 Correct 43 ms 308 KB Output is correct
23 Partially correct 37 ms 296 KB Output is partially correct
24 Correct 47 ms 296 KB Output is correct
25 Correct 25 ms 308 KB Output is correct
26 Correct 21 ms 208 KB Output is correct
27 Correct 47 ms 308 KB Output is correct
28 Correct 50 ms 308 KB Output is correct
29 Partially correct 55 ms 288 KB Output is partially correct
30 Partially correct 61 ms 308 KB Output is partially correct
31 Correct 54 ms 336 KB Output is correct
32 Correct 28 ms 296 KB Output is correct
33 Partially correct 58 ms 300 KB Output is partially correct
34 Partially correct 27 ms 296 KB Output is partially correct
35 Partially correct 50 ms 304 KB Output is partially correct
36 Partially correct 29 ms 308 KB Output is partially correct
37 Correct 58 ms 292 KB Output is correct
38 Correct 41 ms 308 KB Output is correct
39 Correct 48 ms 304 KB Output is correct
40 Correct 58 ms 300 KB Output is correct
41 Partially correct 49 ms 208 KB Output is partially correct
42 Partially correct 54 ms 300 KB Output is partially correct
43 Partially correct 6 ms 208 KB Output is partially correct
44 Partially correct 39 ms 300 KB Output is partially correct
45 Correct 58 ms 296 KB Output is correct
46 Correct 20 ms 208 KB Output is correct
47 Correct 23 ms 308 KB Output is correct
48 Correct 28 ms 304 KB Output is correct