HDU3371 最小生成树

Connect the Cities

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 18067    Accepted Submission(s): 4460

Problem Description

In 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government wants to build some roads to connect all of these cities again, but they don’t want to take too much money.  

 

Input

The first line contains the number of test cases.
Each test case starts with three integers: n, m and k. n (3 <= n <=500) stands for the number of survived cities, m (0 <= m <= 25000) stands for the number of roads you can choose to connect the cities and k (0 <= k <= 100) stands for the number of still connected cities.
To make it easy, the cities are signed from 1 to n.
Then follow m lines, each contains three integers p, q and c (0 <= c <= 1000), means it takes c to connect p and q.
Then follow k lines, each line starts with an integer t (2 <= t <= n) stands for the number of this connected cities. Then t integers follow stands for the id of these cities.

 

Output

For each case, output the least money you need to take, if it’s impossible, just output -1.

 

Sample Input

1

6 4 3

1 4 2

2 6 1

2 3 5

3 4 33

2 1 2

2 1 3

3 4 5 6

 

Sample Output

1

 

Author

dandelion

 

Source

HDOJ Monthly Contest – 2010.04.04

 

题意：

n个点，m条已知长度的边，k组已经连接的边，问最小要建多少条边；

代码：

//prim 模板。这题数据太大用cruscal会超时。
#include<iostream>
#include<cstdio>
#include<cstring>
int dis[502],map[502][502],mark[502],ha[502];
const int MAX=10000007;
int prim(int n)
{
    for(int i=1;i<=n;i++)  //初始化每个点到生成树中点的距离
    {
        dis[i]=map[1][i];
        mark[i]=0;
    }
    mark[1]=1; //1这个点加入生成树中。
    int sum=0;
    for(int i=1;i<n;i++) //枚举n-1条边
    {
        int sta=-1,Min=MAX;
        for(int j=1;j<=n;j++)  //找不在生成树中的点中距离生成树中的点长度最小的
        {
            if(!mark[j]&&dis[j]<Min)
            {
                Min=dis[j];
                sta=j;
            }
        }
        if(sta==-1) return -1; //没找到可以可以联通的路
        mark[sta]=1;   //新找到的点加入生成树
        sum+=Min;       
        for(int j=1;j<=n;j++)  //更新树外的点到树中的点的距离
        {
            if(!mark[j]&&dis[j]>map[sta][j])
            dis[j]=map[sta][j];
        }
    }
    return sum;
}
int main()
{
    int n,m,k,p,q,c,h,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<=n;i++)
        for(int j=0;j<=n;j++)
        map[i][j]=MAX;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&p,&q,&c);
            if(map[p][q]>c)        //可能有重边
            map[p][q]=map[q][p]=c;
        }
        while(k--)
        {
            scanf("%d",&h);
            for(int i=1;i<=h;i++)
            {
                scanf("%d",&ha[i]);
                for(int j=1;j<i;j++)
                map[ha[i]][ha[j]]=map[ha[j]][ha[i]]=0;
            }
        }
        int ans=prim(n);
        printf("%d
",ans);
    }
    return 0;
}