제출 #630445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
630445		CyanForces	드문 곤충 (IOI22_insects)	C++17	50.01 / 100	139 ms	1304 KiB

insects

#include "insects.h"

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define debug(...) //ignore
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long double ld;

int min_cardinality(int N) {
  int n = N;
  set<int> active;
  set<int> dead;
  using H = unsigned long long;
  vector<H> rnd(n);
  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  rep(i,0,n) rnd[i] = rng();
  H hsh = 13;
  map<H,int> queried;
  queried[hsh] = 0;

  auto add = [&](int x) {
    assert(!active.count(x));
    active.emplace(x);
    hsh ^= rnd[x];
    move_inside(x);
  };

  auto rem = [&](int x) {
    assert(active.count(x));
    active.erase(x);
    hsh ^= rnd[x];
    move_outside(x);
  };

  auto query = [&]() {
    if(!queried.count(hsh)) queried[hsh] = press_button();
    return queried[hsh];
  };

  auto empty_all = [&]() {
    while(sz(active)) rem(*rbegin(active));
  };

  auto go = [&](int b) {
    rep(i,0,n) if(!active.count(i) && !dead.count(i)) {
      add(i);
      if(query() > b) rem(i);
    }
  };

  go(1);
  int distinct = sz(active);

  int l = 1, r = n+1;
  while(l+1 != r) {
    int m = (l+r)/2;
    go(m);
    if(sz(active) == m * distinct) l = m;
    else {
      r = m;
      rep(i,0,n) if(!active.count(i)) dead.emplace(i);
      empty_all();
    }
  }

  return l;
}


// void move_inside(int i);
// void move_outside(int i);
// int press_button();

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