题目
题目链接:https://www.luogu.com.cn/problem/P5520
代码
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int fa[10010];
int find(int x){
if(fa[x]!=x){
return fa[x]=find(fa[x]);
}
else return x;
}
void uni(int a,int b){
fa[find(a)]=find(b);
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
fa[i]=i;
}
for(int i=1;i<=m;i++){
int z,x,y;
cin>>z>>x>>y;
if(z==1){
uni(x,y);
}
else{
if(find(x)==find(y)){
cout<<"Y"<<endl;
}
else cout<<"N"<<endl;
}
}
return 0;
}