并查集 顾名思义:合并 查询 集合
用于处理一些不相交集合的合并及查询问题
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,fa[10010];
int find(int x)
{
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void merge(int x,int y)
{
x = find(x);
y = find(y);
if(x == y) return ;
fa[x] = y;
}
bool same(int x,int y)
{
if(find(x) == find(y)) return true;
else return false;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i = 1;i <= n;i ++)
fa[i] = i;
for(int i = 1;i <= m;i ++)
{
int x,y,z;
scanf("%d%d%d",&z,&x,&y);
if(z == 1) merge(x,y);
else if(z == 2)
{
if(same(x,y)) puts("Y");
else puts("N");
}
}
return 0;
}