#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"
#include <iostream>
#include "examples/cpp/union_find.hpp"
#include "examples/cpp/macros.hpp"
using namespace std;
int main() {
int n, q; cin >> n >> q;
union_find uf(n);
REP (i, q) {
int t, u, v; cin >> t >> u >> v;
if (t == 0) {
uf.unite_trees(u, v);
} else if (t == 1) {
cout << uf.is_same(u, v) << endl;
}
}
return 0;
}
#line 1 "examples/cpp/union_find.yosupo.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"
#include <iostream>
#line 1 "examples/cpp/union_find.hpp"
#include <algorithm>
#include <vector>
/**
* @brief a Union-Find
* @note most operations in $O(\alpha(n))$ where $\alpha(n)$ is the inverse of Ackermann function
* @note implemented with union-by-size + path-compression
*/
struct union_find {
std::vector<int> data;
union_find() = default;
explicit union_find(int 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 1 "examples/cpp/macros.hpp"
// for 文用マクロ
#line 4 "examples/cpp/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) begin(x), end(x)
#line 5 "examples/cpp/union_find.yosupo.test.cpp"
using namespace std;
int main() {
int n, q; cin >> n >> q;
union_find uf(n);
REP (i, q) {
int t, u, v; cin >> t >> u >> v;
if (t == 0) {
uf.unite_trees(u, v);
} else if (t == 1) {
cout << uf.is_same(u, v) << endl;
}
}
return 0;
}
examples/cpp/union_find.yosupo.test.cpp