HDU 3371 Connect the Cities(最小生成树)

HDU 3371 Connect the Cities(最小生成树)

http://acm.hdu.edu.cn/showproblem.php?pid=3371

题意:

       有N个点的无向图,现在想要让这个图连通.给你M条边的信息,你连接这M条边的代价都给出了.并且给你K个连通分量,表示这K个连通分量中代表的点已经互相连通了.问你让图连通的最小代价是多少?

分析:

       直接kruskal模板即可,对于已经连通的分量,让他们两两之间连一条权值为0的边即可.(其实只要然他们连通且边权值为0即可,不一定非要两两都有边)

AC代码:

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=500+10;
const int maxm=500*500+10;

struct Edge
{
    int u,v,dist;
    Edge(){}
    Edge(int u,int v,int dist):u(u),v(v),dist(dist){}
    bool operator<(const Edge &rhs)const
    {
        return dist< rhs.dist;
    }
};

struct Kruskal
{
    int n,m;
    Edge edges[maxm];
    int fa[maxn];
    int findset(int x){ return fa[x]==-1? x: fa[x]=findset(fa[x]); }

    void init(int n)
    {
        this->n=n;
        m=0;
        memset(fa,-1,sizeof(fa));
    }

    void AddEdge(int u,int v,int dist)
    {
        edges[m++]=Edge(u,v,dist);
    }

    int kruskal()
    {
        int sum=0,cnt=0;
        sort(edges,edges+m);

        for(int i=0;i<m;i++)
        {
            int u=edges[i].u, v=edges[i].v;
            if(findset(u) != findset(v))
            {
                fa[findset(u)] = findset(v);
                sum += edges[i].dist;
                if(++cnt>=n-1) return sum;
            }
        }
        return -1;
    }
}KK;

int main()
{
    int T; scanf("%d",&T);
    while(T--)
    {
        int n,m,k;
        scanf("%d%d%d",&n,&m,&k);
        KK.init(n);

        while(m--)
        {
            int u,v,d;
            scanf("%d%d%d",&u,&v,&d);
            KK.AddEdge(u,v,d);
        }

        while(k--)
        {
            int t,u,v,pre; scanf("%d",&t);
            scanf("%d%d",&u,&v);
            KK.AddEdge(u,v,0);
            pre=v;
            for(int i=1;i<=t-2;i++)
            {
                scanf("%d",&v);
                KK.AddEdge(pre,v,0);
                pre=v;
            }
        }
        printf("%d\n",KK.kruskal());
    }
    return 0;
}