并查集模板题 HDU1213 How Many Tables

---

并查集模板题

---

#include<bits/stdc++.h>
using namespace std;

const int maxn=10000;
int f[maxn],len[maxn];

void ini(int n)
{
    for(int i=1;i<=n;++i)
        f[i]=i,len[i]=1;
}

int Find(int x)
{
    if(f[x]==x)
        return x;
    return f[x]=Find(f[x]);
}

bool same(int x,int y)
{
    return Find(x)==Find(y);
}

void Union(int x,int y)
{
    x=Find(x);
    y=Find(y);
    if(x==y)
        return;
    if(len[x]<len[y])
        f[x]=y;
    else
        f[y]=x;
    if(len[x]==len[y])
        ++len[x];
}

int main()
{
    int t;
    cin>>t;
    int m,n;
    while(t--)
    {
        cin>>n>>m;
        memset(len,0,sizeof(len));
        ini(n);
        int ans=n;
        for(int i=0;i<m;++i)
        {
            int a,b;
            cin>>a>>b;
            if(!same(a,b))
                Union(a,b),--ans;
        }
        cout<<ans<<endl;
    }
    system("pause");
    return 0;
}