verify/yosupo/unionfind.test.cpp

View this file on GitHub
Last update: 2025-11-01 06:58:30+09:00
Problem: https://judge.yosupo.jp/problem/unionfind

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"

#include "../../library/template/template.hpp"
#include "../../library/structure/UnionFind.hpp"

void solve() {
    ll n, q; cin >> n >> q;
	UnionFind uf(n);
	while (q--) {
		ll t; cin >> t;
		if (t == 0) {
			ll u, v; cin >> u >> v;
			uf.unite(u, v);
		}
		else {
			ll u, v; cin >> u >> v;
			cout << uf.same(u, v) << endl;
		}
	}
}
int main() {
    ll T = 1;
    // cin >> T;
    while (T--) solve();
}

#line 1 "verify/yosupo/unionfind.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/unionfind"

#line 2 "library/template/template.hpp"

#include <bits/stdc++.h>
using namespace std;
#define MM << ' ' <<
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vl = vector<ll>;
template <class T> using vec = vector<T>;
template <class T> using vv = vec<vec<T>>;
template <class T> using vvv = vv<vec<T>>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, r) for(ll i = 0; i < (r); i++)
#define reps(i, l, r) for(ll i = (l); i < (r); i++)
#define rrep(i, l, r) for(ll i = (r) - 1; i >= l; i--)
template <class T> void uniq(T &a) { sort(all(a)); erase(unique(all(a)), a.end()); }
#define all(a) (a).begin(), (a).end()
#define sz(a) (ll)(a).size()
const ll INF = numeric_limits<ll>::max() / 4;
const ld inf = numeric_limits<ld>::max() / 2;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
const ld pi = 3.141592653589793238;
template <class T> void rev(T &a) { reverse(all(a)); }
ll popcnt(ll a) { return __builtin_popcountll(a); }
template<typename T>
bool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }
template<typename T>
bool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
	os << p.first << " " << p.second;
	return os;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
	is >> p.first >> p.second;
	return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vec<T>& v) {
	rep(i, sz(v)) {
		os << v[i] << " \n"[i + 1 == sz(v)];
	}
	return os;
}
template <typename T>
istream& operator>>(istream& is, vec<T>& v) {
	for (T& in : v) is >> in;
	return is;
}
void yesno(bool t) {
	cout << (t ? "Yes" : "No") << endl;
}
#line 2 "library/structure/UnionFind.hpp"

#line 4 "library/structure/UnionFind.hpp"
struct UnionFind {
	vl data;

	UnionFind(ll n) : data(n, -1) {}

	ll find(ll k) {
		return data[k] < 0 ? k : data[k] = find(data[k]);
	}

	ll unite(ll x, ll y) {
		x = find(x), y = find(y);
		if (x == y) return false;
		if (data[x] > data[y]) swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return true;
	}

	ll size(ll k) {
		return -data[find(k)];
	}

	bool same(ll x, ll y) {
		return find(x) == find(y);
	}
};
#line 5 "verify/yosupo/unionfind.test.cpp"

void solve() {
    ll n, q; cin >> n >> q;
	UnionFind uf(n);
	while (q--) {
		ll t; cin >> t;
		if (t == 0) {
			ll u, v; cin >> u >> v;
			uf.unite(u, v);
		}
		else {
			ll u, v; cin >> u >> v;
			cout << uf.same(u, v) << endl;
		}
	}
}
int main() {
    ll T = 1;
    // cin >> T;
    while (T--) solve();
}