HDU 5923 Prediction 并查集 合并

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5923

代码

#include <bits/stdc++.h>
#define sf scanf
#define pf printf
using namespace std;
const int maxn = 500 + 5,maxm = 10000 + 50;
int Fa[maxm][maxn],n,m;
int Find(int S,int x){
    return Fa[S][x] == -1 ? x : Fa[S][x] = Find(S,Fa[S][x]);
}
vector<int> Adj[maxm];
int Edge_u[maxm],Edge_v[maxm];
void DFS(int u,int fa){
    for(int i = 1;i <= n;++i) Fa[u][i] = Fa[fa][i];
    int fu = Find(u,Edge_u[u]),fv = Find(u,Edge_v[u]);
    if(fu != fv) Fa[u][min(fu,fv)] = max(fu,fv);
    int len = Adj[u].size();
    for(int i = 0;i < len;++i){
        int v = Adj[u][i];
        if(v != fa) DFS(v,u);
    }
}

int main(){
    int T,ca = 0;sf("%d",&T);
    while( T-- ){
        sf("%d %d",&n,&m);
        for(int i = 0;i <= m;++i) Adj[i].clear();
        for(int i = 2;i <= m;++i){
            int p;sf("%d",&p);Adj[p].push_back(i);
        }
        for(int i = 1;i <= m;++i) sf("%d %d",&Edge_u[i],&Edge_v[i]);
        for(int i = 1;i <= n;++i) Fa[0][i] = -1;
        DFS(1,0);
        pf("Case #%d:\n",++ca);
        int q;sf("%d",&q);
        while( q-- ){
            int k;sf("%d",&k);
            for(int i = 1;i <= n;++i) Fa[0][i] = -1;
            int ans = 0;
            for(int i = 0;i < k;++i){
                int x;sf("%d",&x);
                for(int j = 1;j <= n;++j){
                    int fa1 = Find(x,j);
                    if(fa1 != j){
                        int fa2 = Find(0,j),fa3 = Find(0,fa1);
                        if(fa2 != fa3) Fa[0][min(fa2,fa3)] = max(fa2,fa3);
                    }
                }
            }
            for(int j = 1;j <= n;++j){
                if(Fa[0][j] == -1) ans++;
            }
            pf("%d\n",ans);
        }
    }

}