codevs 1365 浴火银河星际跳跃

 1 #include<iostream>
 2 #include<cstdio>
 3 using namespace std;
 4 int father[100001];
 5 int find (int x)
 6 {
 7     if(father[x]!=x)
 8     father[x]=find(father[x]);
 9     return father[x];
10 }
11 void unionn(int x,int y)
12 {
13     father[find(x)]=find(y);
14 }
15 int main()
16 {
17     int n,m,x,a,b;
18     scanf("%d%d%d",&n,&m,&x);
19     for(int i=1;i<=n;i++)father[i]=i;
20     for(int i=1;i<=m;i++)
21     {
22         scanf("%d%d",&a,&b);
23         if(find(a)!=find(b))
24         unionn(a,b);
25     }
26     for(int i=1;i<=x;i++)
27     {
28         scanf("%d%d",&a,&b);
29         if(find(a)==find(b))
30         printf("Yes\n");
31         else printf("No\n");
32     }
33     return 0;
34 }