Submission #1078966

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1078966	2024-08-28 08:44:23	Gromp15	Rarest Insects (IOI22_insects)	C++17	70.61 / 100	105 ms	1188 KiB

insects

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#include "insects.h"
using namespace std;
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
int min_cardinality(int N) {
  vector<int> idx(N);
  iota(all(idx), 0);
  shuffle(all(idx), mt19937(1498371));
  vector<int> groups{idx[0]};
  move_inside(idx[0]);
  for (int i = 1; i < N; i++) {
    move_inside(idx[i]);
    if (press_button() > 1) move_outside(idx[i]);
    else groups.push_back(idx[i]);
  }
  for (int x : groups) move_outside(x);
  int ans = 1e9;
  auto solve = [&](auto&& s, vector<int> v, vector<int> pot) -> void {
    if (sz(v) == 1) {
      ckmin(ans, sz(pot)); return;
    }
    if (sz(v) * sz(v) < sz(pot) * 2) {
      vector<int> hf(v.begin(), v.begin() + sz(v) / 2), other(v.begin() + sz(v) / 2, v.end());
      for (int x : hf) move_inside(x);
      vector<int> A, B;
      for (int x : pot) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 45.61 / 75