合并集合,查询两个人是否在同一个集合中
#include <bits/stdc++.h>
using namespace std;
int fa[5005];
int find(int x) { //寻找父亲节点的id号
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
int main() {
int n, m, p;
cin >> n >> m >> p;
for (int i = 1; i <= n; i ++) { //初始化人数
fa[i] = i;
}
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
fa[find(x)] = find(y); //合并集合
}
for (int i = 0; i < p; i ++) {
int x, y;
cin >> x >> y;
if(find(x) == find(y)) { //判断两个人是否在一个集合中
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
return 0;
}