제출 #1058420

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058420		aykhn	Rarest Insects (IOI22_insects)	C++17	100 / 100	35 ms	932 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int min_cardinality(int N) 
{
  srand(time(0));
  vector<int> ord(N, 0);
  iota(ord.begin(), ord.end(), 0);
  random_shuffle(ord.begin(), ord.end());
  int uni = 0;
  vector<int> v;
  for (int &i : ord)
  {
    move_inside(i);
    if (press_button() > 1) move_outside(i);
    else uni++, v.push_back(i);
  }
  vector<int> in(N, 0);
  vector<int> alive(N, 1);
  int cur = v.size();
  for (int &i : v) alive[i] = 0;
  v.clear();
  int l = 1, r = N / uni;
  while (l < r)
  {
    int mid = (l + r + 1) >> 1;
    for (int &i : ord)
    {
      if (mid * uni == cur) break;
      if (!alive[i]) continue;
      move_inside(i);
      v.push_back(i);
      cur++;
      in[i] = 1;
      if (press_button() > mid) 
      {
        cur--;
        in[i] = 0;
        move_outside(i);
        v.pop_back();
      }
    }
    if (cur != mid * uni)
    {
      for (int i = 0; i < N; i++)
      {
        if (!in[i]) alive[i] = 0;
      }
      for (int &i : v) 
      {
        cur--;
        move_outside(i), in[i] = 0;
      }
      v.clear();
      r = mid - 1;
    }
    else
    {
      for (int &i : v)
      {
        alive[i] = 0;
        in[i] = 0;
      }
      v.clear();
      l = mid;
    }
  }
  return l;
}

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