@[undefind](/user/922307) 你多半想复杂了,这题就一个并查集的事
by rickyxrc @ 2023-06-03 15:16:28
```cpp
#include<bits/stdc++.h>
using namespace std;
int i,j,k,n,m,p,s,ans,f[10010],p1,p2;
int find(int k)
{
if(f[k]==k)return k;
return f[k]=find(f[k]);
}
int main()
{
cin>>n>>m>>p;
for(i=1;i<=n;i++)
f[i]=i;
for(i=1;i<=m;i++){
cin>>p1>>p2;
f[find(p1)]=find(p2);
}
for(int i=1;i<=p;i++)
{
cin>>p1>>p2;
if(find(p1)==find(p2)) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
```
by dpfs @ 2023-06-03 15:36:04
@[dpfs](/user/655119) 谢AC代码,本人蒟蒻(bushi)
by undefind @ 2023-06-17 09:01:21