codevs 1073 家族 并查集

题目链接:

http://www.codevs.cn/problem/1073/

题意:

题解:

代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MS(a) memset(a,0,sizeof(a))
#define MP make_pair
#define PB push_back
const int INF = 0x3f3f3f3f;
const ll INFLL = 0x3f3f3f3f3f3f3f3fLL;
inline ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
//////////////////////////////////////////////////////////////////////////
const int maxn = 5e3+10;

int fa[maxn];

int find(int x){
    return fa[x]==x ? x : fa[x]=find(fa[x]);
}

void Union(int u,int v){
    int t1 = find(u), t2 = find(v);
    if(t1 == t2)
        return ;
    else
        fa[t1] = t2;
}

int main(){
    int n,m,q;
    scanf("%d%d%d",&n,&m,&q);
    for(int i=0; i<maxn; i++)
        fa[i] = i;
    while(m--){
        int u,v; scanf("%d%d",&u,&v);
        Union(u,v);
    }
    while(q--){
        int u,v;
        scanf("%d%d",&u,&v);
        if(find(u) == find(v))
            puts("Yes");
        else
            puts("No");
    }

    return 0;
}