Submission #423499

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#define REP(i,n) for(int i=0; i<n; i++)
#define MAX_N 100000
using namespace std;

int par[MAX_N], rank[MAX_N];

void init(int n){
	for(int i = 0; i< n; i++){
		par[i] = i;
		rank[i] = 0;
	}
}

int root(int x){
	return par[x] == x ? x : par[x] = root(par[x]);
}
bool same(int x, int y){
	return root(x) == root(y);
}
void unite(int x, int y){
	x = root(x);
	y = root(y);
	if(x == y) return;
	if(rank[x] < rank[y]){
		par[x] = y;
	} else{
		par[y] = x;
		if(rank[x] == rank[y]) rank[x]++;
	}
}

int main(){
	int n,q;
	cin>>n>>q;
	init(n);
	REP(i,q){
		int p,a,b;
		cin>>p>>a>>b;
		if(p == 0) unite(a,b);
		else if(p==1){
			if(same(a,b)) cout<<"Yes"<<endl;
			else cout<<"No"<<endl;
		}
	}
	return 0;
}

Submission Info

Judge Result