oj.uz

Submission #629748

# Submission time Handle Problem Language Result Execution time Memory
629748 2022-08-15T04:30:22 Z cjoa Rarest Insects (IOI22_insects) C++17
10 / 100
 350 ms 316 KB 
#include "insects.h"

#include <vector>
#include <random>
#include <algorithm>
#include <numeric>

#include <cassert>

using namespace std;

#define SZ(x) int((x).size())

mt19937 gen(123);

class DisjointSet {
   int N;
   int ncomp;
   vector<int> par;
   vector<int> sz;

public:
   DisjointSet(size_t _N) : N(_N), ncomp(_N), par(_N, -1), sz(_N, 1) {}
   int num_comp() const {
      return ncomp;
   }
   int size(int u) {
      return sz[ find_rep(u) ];
   }
   int find_rep(int u) {
      return par[u] < 0 ? u : par[u] = find_rep(par[u]);
   }
   bool union_rep(int u, int v) {
      int u_root = find_rep(u);
      int v_root = find_rep(v);
      if (u_root == v_root)
         return false;
      if (sz[u_root] < sz[v_root])
         swap(u_root, v_root);
      par[v_root] = u_root;
      sz[u_root] += sz[v_root];
      --ncomp;
      return true;
   }
};


int min_cardinality(int N) {
   vector<int> order(N);
   iota(order.begin(), order.end(), 0);
   std::shuffle(order.begin(), order.end(), gen);

   vector<int> distinct;
   DisjointSet dset(N);
   for (int i : order) {
      move_inside(i);
      if (!distinct.empty() and press_button() == 2) {
         std::shuffle(distinct.begin(), distinct.end(), gen);
         for (int k = SZ(distinct)-1; k >= 0; --k) {
            int& j = distinct[k];
            move_outside(j);
            if (press_button() == 1) {
               dset.union_rep(i, j);
               j = i;
               break;
            }
            move_inside(j);
         }
      }
      else {
         distinct.push_back(i);
      }
   }

   int ret = N;
   for (int i = 0; i < N; ++i)
      ret = min(ret, dset.size(i));

   return ret;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 17 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 13 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Correct 15 ms 208 KB Output is correct
19 Correct 18 ms 208 KB Output is correct
20 Correct 34 ms 208 KB Output is correct
21 Correct 38 ms 208 KB Output is correct
22 Correct 38 ms 208 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 5 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Correct 15 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 17 ms 208 KB Output is correct
14 Correct 5 ms 208 KB Output is correct
15 Correct 11 ms 208 KB Output is correct
16 Correct 13 ms 208 KB Output is correct
17 Correct 16 ms 208 KB Output is correct
18 Correct 15 ms 208 KB Output is correct
19 Correct 18 ms 208 KB Output is correct
20 Correct 34 ms 208 KB Output is correct
21 Correct 38 ms 208 KB Output is correct
22 Correct 38 ms 208 KB Output is correct
23 Correct 20 ms 208 KB Output is correct
24 Correct 8 ms 316 KB Output is correct
25 Correct 185 ms 208 KB Output is correct
26 Correct 138 ms 208 KB Output is correct
27 Correct 25 ms 208 KB Output is correct
28 Incorrect 235 ms 288 KB Too many queries.
29 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 32 ms 208 KB Output is correct
8 Correct 19 ms 208 KB Output is correct
9 Incorrect 350 ms 208 KB Too many queries.
10 Halted 0 ms 0 KB -