Submission #1495708

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int tree[100010];
int root(int x){
	return tree[x] == x ? x : tree[x] = root(tree[x]);
}
int unite(int a , int b){
	tree[root(a)] = root(b);
}

int main(){
	int n , q;
	cin >> n >> q;
	for(int i = 0; i < n; i++) tree[i] = i;
	int a , b , c;
	for(int i = 0; i < q; i++){
		cin >> a >> b >> c;
		b--; c--;
		if(a)
			cout << (root(b) == root(c) ? "YES" : "NO") << endl;
		else
			unite(b , c); 
	}
	return 0;
}

Submission Info

Judge Result