Submission #1214989

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214989		dosts	Rarest Insects (IOI22_insects)	C++20	0 / 100	13 ms	4344 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;

vi inside(LIM,0);
void add(int p) {
  if (inside[p]) return;
  inside[p] = 1;
  move_inside(p);
}
void remove(int p) {
  if (!inside[p]) return;
  inside[p] = 0;
  move_outside(p);
}

int min_cardinality(int N) {
  vi machine;
  vi cand;
  for (int i = 0;i<N;i++) cand.push_back(i);
  while (1) {
    for (auto it : cand) add(it);
    int x = press_button();
    for (auto it : cand) remove(it);
    vi duro;
    for (auto it : cand) {
      add(it);
      int y = press_button();
      if (x == y) {
        remove(it);
        duro.push_back(it);
        continue;
      }
    }
    for (auto it : cand) remove(it);
    for (auto it : duro) add(it);
    vi rem = duro;
    for (auto it : cand) {
      if (!inside[it]) {
        add(it);
        int y = press_button();
        if (y != 1) rem.push_back(it);
        remove(it);
      }
    }
    vi cand2;
    for (auto it : cand) {
      if (count(all(rem),it)) continue;
      cand2.push_back(it);
    } 
    assert(2*big(cand2) <= big(cand));
    cand = cand2;
    if (cand.empty()) return x;
  }
}

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