#include <iostream>
using namespace std;
const int N = 1e5 + 5;
int p[N];
int find(int x)
{
if (p[x] != x)
{
p[x] = find(p[x]);
}
return p[x];
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i ++)
{
p[i] = i;
}
while (m -- )
{
char op;
cin >> op;
int a, b;
cin >> a >> b;
if (op == 'M')
{
p[find(a)] = find(b);
}
else if (op == 'Q')
{
if (find(a) == find(b))
{
puts("Yes");
}
else
{
puts("No");
}
}
}
return 0;
}
C++并查集
最新推荐文章于 2024-04-27 23:03:05 发布