Submission #811046

#	Time	Username	Problem	Language	Result	Execution time	Memory
811046		d4xn	Rarest Insects (IOI22_insects)	C++17	52.99 / 100	152 ms	528 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin(), x.end()
 
const int N = 2e3+3, inf = INT_MAX;
 
mt19937 rng((time(nullptr)) + (chrono::steady_clock::now().time_since_epoch().count()) + ((uint64_t) new char));
 
int n, m, ans;
vector<int> v;
bitset<N> vis;
 
int min_cardinality(int N) {
  // move_inside(i);
  // move_outside(i);
  // press_button(i);
 
  n = N;
  v.resize(n);
  for (int i = 0; i < n; i++) v[i] = i;

  // Busco los primeros
  m = 0;
  for (int i = 0; i < n; i++) {
    move_inside(i);
    vis[i] = 1;
    m++;

    if (press_button() > 1) {
      move_outside(i);
      vis[i] = 0;
      m--;
    }
  }

  if (m == 1) return n;
cerr << m << endl;
  int l = 1;
  int r = n/m;
  while (l < r) {
    shuffle(all(v), rng);
    int mid = (l+r+1)>>1;

    int taken = m;
    vector<int> to_remove;
    for (int i = 0; i < n && taken + (n-i) >= m*mid && taken < m*mid; i++) {
      int x = v[i];
      if (vis[x]) continue;

      move_inside(x);
      taken++;

      if (press_button() > mid) {
        move_outside(x);
        taken--;
      }
      else {
        to_remove.push_back(x);
      }
    }

    for (int& x : to_remove) {
      move_outside(x);
    }

    if (taken == m*mid) l = mid;
    else r = mid-1;
  }
  return l;
}

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