Submission #627229

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
627229	2022-08-12T11:36:54 Z	model_code	Rarest Insects (IOI22_insects)	C++17	99.89 / 100	100 ms	416 KB

insects

// correct/solution-hocky-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};
  };

  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
      for(const auto &insect : just_moved){
        move_outside(insect);
      }
      swap(checking_set, just_moved);
    }
  } while (true);

  return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	8 ms	208 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	8 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	6 ms	208 KB	Output is correct
11	Correct	4 ms	304 KB	Output is correct
12	Correct	7 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	5 ms	208 KB	Output is correct
15	Correct	6 ms	256 KB	Output is correct
16	Correct	8 ms	300 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	9 ms	296 KB	Output is correct
19	Correct	8 ms	300 KB	Output is correct
20	Correct	6 ms	324 KB	Output is correct
21	Correct	3 ms	208 KB	Output is correct
22	Correct	2 ms	300 KB	Output is correct

Subtask #2
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	8 ms	208 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	8 ms	208 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	6 ms	208 KB	Output is correct
11	Correct	4 ms	304 KB	Output is correct
12	Correct	7 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	5 ms	208 KB	Output is correct
15	Correct	6 ms	256 KB	Output is correct
16	Correct	8 ms	300 KB	Output is correct
17	Correct	6 ms	208 KB	Output is correct
18	Correct	9 ms	296 KB	Output is correct
19	Correct	8 ms	300 KB	Output is correct
20	Correct	6 ms	324 KB	Output is correct
21	Correct	3 ms	208 KB	Output is correct
22	Correct	2 ms	300 KB	Output is correct
23	Correct	20 ms	336 KB	Output is correct
24	Correct	6 ms	304 KB	Output is correct
25	Correct	23 ms	300 KB	Output is correct
26	Correct	35 ms	296 KB	Output is correct
27	Correct	27 ms	304 KB	Output is correct
28	Correct	6 ms	348 KB	Output is correct
29	Correct	19 ms	300 KB	Output is correct
30	Correct	25 ms	288 KB	Output is correct
31	Correct	20 ms	292 KB	Output is correct
32	Correct	26 ms	300 KB	Output is correct
33	Correct	39 ms	304 KB	Output is correct
34	Correct	37 ms	296 KB	Output is correct
35	Correct	20 ms	208 KB	Output is correct
36	Correct	28 ms	296 KB	Output is correct
37	Correct	27 ms	300 KB	Output is correct
38	Correct	24 ms	292 KB	Output is correct
39	Correct	11 ms	304 KB	Output is correct
40	Correct	20 ms	308 KB	Output is correct
41	Correct	11 ms	288 KB	Output is correct

Subtask #3
74.89 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	224 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	288 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	31 ms	300 KB	Output is correct
8	Correct	13 ms	284 KB	Output is correct
9	Correct	45 ms	296 KB	Output is correct
10	Correct	59 ms	336 KB	Output is correct
11	Correct	51 ms	300 KB	Output is correct
12	Correct	43 ms	308 KB	Output is correct
13	Correct	89 ms	308 KB	Output is correct
14	Correct	90 ms	296 KB	Output is correct
15	Correct	44 ms	352 KB	Output is correct
16	Correct	71 ms	292 KB	Output is correct
17	Correct	57 ms	308 KB	Output is correct
18	Correct	62 ms	304 KB	Output is correct
19	Partially correct	27 ms	304 KB	Output is partially correct
20	Correct	41 ms	300 KB	Output is correct
21	Correct	34 ms	300 KB	Output is correct
22	Correct	60 ms	308 KB	Output is correct
23	Correct	22 ms	308 KB	Output is correct
24	Correct	49 ms	416 KB	Output is correct
25	Correct	28 ms	304 KB	Output is correct
26	Correct	18 ms	304 KB	Output is correct
27	Correct	61 ms	304 KB	Output is correct
28	Correct	62 ms	348 KB	Output is correct
29	Partially correct	51 ms	296 KB	Output is partially correct
30	Partially correct	78 ms	296 KB	Output is partially correct
31	Correct	34 ms	292 KB	Output is correct
32	Correct	59 ms	304 KB	Output is correct
33	Correct	49 ms	300 KB	Output is correct
34	Correct	40 ms	300 KB	Output is correct
35	Partially correct	69 ms	300 KB	Output is partially correct
36	Partially correct	72 ms	304 KB	Output is partially correct
37	Correct	65 ms	304 KB	Output is correct
38	Correct	100 ms	304 KB	Output is correct
39	Correct	64 ms	308 KB	Output is correct
40	Correct	49 ms	300 KB	Output is correct
41	Partially correct	65 ms	300 KB	Output is partially correct
42	Partially correct	56 ms	304 KB	Output is partially correct
43	Correct	15 ms	304 KB	Output is correct
44	Correct	56 ms	300 KB	Output is correct
45	Correct	70 ms	336 KB	Output is correct
46	Correct	36 ms	296 KB	Output is correct
47	Correct	41 ms	288 KB	Output is correct
48	Correct	33 ms	380 KB	Output is correct

Submission #627229

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 74.89 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
74.89 / 75.0