oj.uz

Submission #837953

# Submission time Handle Problem Language Result Execution time Memory
837953 2023-08-25T21:22:58 Z taher Rarest Insects (IOI22_insects) C++17
0 / 100
 1 ms 208 KB 
#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

class dsu {
  public:
  int n;
  vector<int> par;
  vector<int> size;
  
  dsu(int _n) : n(_n) {
    par.resize(n);
    iota(par.begin(), par.end(), 0);
    size.resize(n);
    for (int i = 0; i < n; i++) {
      size[i] = 1; 
    }
  }
  
  int get(int x) {
    if (par[x] == x) {
      return par[x];
    }
    return par[x] = get(par[x]); 
  }
  
  bool unite(int x, int y) {
    x = get(x);
    y = get(y);
    
    if (x == y) {
      return false; 
    }
    par[x] = y;
    size[y] += size[x];
    return true; 
  }
};

int min_cardinality(int N) {

  int n = N;
  
  dsu ds(n);

  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      move_inside(i);
      move_inside(j);
      
      if (press_button() == 1) {
        ds.unite(i, j); 
      }
      move_outside(i);
      move_outside(j);
    }
  }
  
  int res = 123456;
  
  for (int i = 0; i < n; i++) {
    if (ds.get(i) == i) {
      res = min(res, ds.size[i]); 
    }
  }
  return res;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer.
2 Halted 0 ms 0 KB -