competitive-programming-library

This documentation is automatically generated by online-judge-tools/verification-helper

View the Project on GitHub kmyk/competitive-programming-library

data_structure/union_find_tree.yosupo.test.cpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"
#include "data_structure/union_find_tree.hpp"
#include <cstdio>

int main() {
int n, q; scanf("%d%d", &n, &q);
union_find_tree uft(n);
while (q --) {
int t, u, v; scanf("%d%d%d", &t, &u, &v);
if (t == 0) {
uft.unite_trees(u, v);
} else if (t == 1) {
}
}
return 0;
}



#line 1 "data_structure/union_find_tree.yosupo.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"
#line 2 "data_structure/union_find_tree.hpp"
#include <vector>

/**
* @brief Union-Find Tree
* @docs data_structure/union_find_tree.md
* @note union-by-size + path-compression
*/
struct union_find_tree {
std::vector<int> data;
union_find_tree() = default;
explicit union_find_tree(std::size_t n) : data(n, -1) {}
bool is_root(int i) { return data[i] < 0; }
int find_root(int i) { return is_root(i) ? i : (data[i] = find_root(data[i])); }
int tree_size(int i) { return - data[find_root(i)]; }
int unite_trees(int i, int j) {
i = find_root(i); j = find_root(j);
if (i != j) {
if (tree_size(i) < tree_size(j)) std::swap(i, j);
data[i] += data[j];
data[j] = i;
}
return i;
}
bool is_same(int i, int j) { return find_root(i) == find_root(j); }
};
#line 3 "data_structure/union_find_tree.yosupo.test.cpp"
#include <cstdio>

int main() {
int n, q; scanf("%d%d", &n, &q);
union_find_tree uft(n);
while (q --) {
int t, u, v; scanf("%d%d%d", &t, &u, &v);
if (t == 0) {
uft.unite_trees(u, v);
} else if (t == 1) {