并查集复习
#include <bits/stdc++.h>
using namespace std;
int n, m, q,a,b,p[20010];
int find(int a) {
if (a != p[a])p[a] = find(p[a]);
else return p[a];
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
p[i] = i;
}
for (int i = 0; i < m; i++)
{
cin >> a >> b;
p[find(a)] = find(b);
}
cin >> q;
for (int i = 0; i < q; i++)
{
cin >> a>>b;
if (find(a) == find(b))
{
cout << "Yes" << "\n";
}
else cout << "No" << "\n";
}
}