#include <bits/stdc++.h>
#define maxn 20005
typedef long long ll;
using namespace std;
ll a[maxn],n,m;
ll find(ll k)
{
return a[k] == k ? k : a[k] = find(a[k]);
}
ll merge(ll x,ll y)
{
ll fx = find(x),fy = find(y);
if(fx == fy)return 0;
else return a[fy] = fx;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
a[i] = i;
}
while(m--)
{
ll zi,xi,yi;
cin >> zi >> xi >> yi;
if(zi == 1)
{
merge(xi,yi);
}
else if(zi == 2)
{
if(find(xi) == find(yi))
{
cout << 'Y' << endl;
}
else
{
cout << 'N' << endl;
}
}
}
return 0;
}
模板并查集
猜你喜欢
转载自blog.csdn.net/zzzanj/article/details/81223663
今日推荐
周排行