Pagini recente » Cod sursa (job #1912396) | Cod sursa (job #2489340) | Cod sursa (job #1211481) | Cod sursa (job #2179580) | Cod sursa (job #3244038)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int card[100002],rad[100002];
void uunion(int x,int y){
if(card[x]<card[y])
swap(x,y);
rad[y]=x;
card[x] +=card[y];
}
int ffind(int x){
if (rad[x]==x)
return x;
rad[x]=ffind(rad[x]);
return rad[x];
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
rad[i]=i;
for(int i=1;i<=m;i++){
int c,x,y;
cin>>c>>x>>y;
if(c==1)
uunion(x,y);
else{
int nr1=ffind(x),nr2=ffind(y);
if(nr1==nr2)
cout<<"YES\n";
else
cout<<"NO\n";
}
}
}