大师 • 2个月前
using namespace std;
int fa[100005] = {0};
inline void Build(int n) {
for (int i = 1; i <= n; i++) {
fa[i] = i;
}
}
inline int Find(int x) {
if (fa[x] == x) {
return x;
} else {
return Find(fa[x]);
}
}
inline void Merge(int x, int y) {
if (Find(x) != Find(y)) {
fa[Find(x)] = Find(y);
}
}
inline bool Check(int x, int y) {
if (Find(x) != Find(y)) {
return false;
} else {
return true;
}
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
Build(n);
while (m--) {
int a, b;
scanf("%d %d", &a, &b);
Merge(a, b);
}
int q;
scanf("%d", &q);
while (q--) {
int c, d;
scanf("%d %d", &c, &d);
if (Check(c, d)) {
printf("Yes\n");
} else {
printf("No\n");
}
}
return 0;
}
评论:
请先登录,才能进行评论