Submission #420855

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
struct uf{
	vector<int> parent;
	vector<int> rank;
	int n;
	void init(int N){n=N;parent.reserve(n);rank.reserve(n);REP(i,n){parent[i]=i;rank[i]=0;}}
	int  root(int x){return (parent[x]==x)? x: parent[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])parent[x]=y;
		else{
			parent[y]=x;
			if(rank[x]==rank[y])rank[x]++;
		}
	}
};
int main(){
	int n,m;cin>>n>>m;
	uf Union;
	Union.init(n);
	REP(i,m){
		int f,x,y;cin>>f>>x>>y;
		if(f==0){Union.unite(x,y);}
		else{
			if(Union.same(x,y))cout<<"Yes"<<endl;
			else cout<<"No"<<endl;
		}
		
	}

	return 0;
}

Submission Info

Judge Result