Submission #628443

#	Time	Username	Problem	Language	Result	Execution time	Memory
628443		c28dnv9q3	Rarest Insects (IOI22_insects)	C++17	0 / 100	392 ms	256 KiB

insects

#include "insects.h"
#include <vector>
#include <numeric>
#include <map>
using namespace std;

vector<int> p;
vector<int> sz;

int ufind(int i) {
  if (p[i] == i) return i;
  return p[i] = ufind(p[i]);
}
int usz(int i) {
  return sz[ufind(i)];
}
void umerge(int a, int b) {
  if (ufind(a) == ufind(b))
    return;
  p[a] = b;
  sz[b] += sz[a];
}

int min_cardinality(int N) {
  p.resize(N);
  sz.resize(N);
  iota(p.begin(), p.end(), 0);
  fill(sz.begin(), sz.end(), 1);
  int minsz = N;

  for (int i = 0; i < N-1; i++) {
    if (usz(i) >= minsz)
      continue;
    move_inside(i);
    for (int j = 0; j < N; j++) {
      if (usz(i) >= minsz || usz(j) >= minsz)
        continue;
      if (ufind(i) == ufind(j))
        continue;
      move_inside(j);
      if (press_button() == 2)
        umerge(j, i);
      move_outside(j);
    }
    move_outside(i);
    minsz = min(minsz, usz(i));
  }
  minsz = min(minsz, usz(N-1));
  return minsz;
}

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