Submission #2481468

---

Source Code Expand

#include <bits/stdc++.h>
using std::cout;
using std::endl;
using std::cin;

struct UnionFind{
	std::vector<int> data;
	
	UnionFind(int n){
		data.assign(n, -1);
	}
	
	void unite(int x, int y){
		x = find(x); y = find(y);
		if(x == y) return;
		if(data[x] > data[y]) std::swap(x, y);
		data[x] += data[y];
		data[y] = x;
	}
	
	int find(int k){
		if(data[k] < 0) return k;
		return data[k] = find(data[k]);
	}
	
	bool same(int x, int y){
		return find(x) == find(y);
	}
};

int main(){
	int n, q; cin >> n >> q; UnionFind uf(n);
	for(int i = 0; i < q; i++){
		int a, b, c; cin >> a >> b >> c;
		
		if(a == 0) uf.unite(b, c);
		else cout << (uf.same(b, c) ? "Yes" : "No") << endl;
	}
	
	return 0;
}

Submission Info

Judge Result