HDU 3371 Connect the Cities（prim算法）

题目链接：

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

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

/*
问题
输入已经存在的图以及将要增加的边及其花费，计算并输出最小生成树还需要的最小花费

解题思路
将现在的图连起来使得它们的花费为0，再加入将要建设的边，直接跑一边prim即可，注意不能构成最小生成树
的情况说出-1，代码中的u == -1 结束很关键。 
*/ 
#include<cstdio>
#include<cstring>

const int N=550;
const int INF=99999999;
int e[N+10][N+10],a[N],dis[N],bk[N];
int prim();
int n,m,k;

int main(){
    int T,i,j,q,t1,t2,t3,t;
    scanf("%d",&T);
    while(T--){
        for(i=1;i<=N;i++){
            for(j=1;j<=N;j++){
                e[i][j] = i==j?0:INF;
            }
        }
        scanf("%d%d%d",&n,&m,&k);
        for(i=1;i<=m;i++){
            scanf("%d%d%d",&t1,&t2,&t3);
            if(e[t1][t2] > t3){
                e[t1][t2] = t3;
                e[t2][t1] = t3;
            }    
        }
        for(i=1;i<=k;i++){
            scanf("%d",&t);
            for(j=1;j<=t;j++){
                scanf("%d",&a[j]);
            }
            for(j=1;j<=t-1;j++){
                for(q=j+1;q<=t;q++){
                    e[ a[j] ][ a[q] ]=0;
                    e[ a[q] ][ a[j] ]=0;
                }
            }
        }
        
        /*for(i=1;i<=n;i++){
            for(j=1;j<=n;j++){
                printf("%9d",e[i][j]);
            }
            printf("\n");
        }*/
        int ans=prim();
        if(ans == -1)
            printf("-1\n");
        else
            printf("%d\n",ans);
    }
    return 0;
} 

int prim()
{
    int i;
    for(i=1;i<=n;i++)
        dis[i]=e[1][i];
    memset(bk,0,sizeof(bk));
    bk[1]=1;
    int c=1,sum=0,mina,u;
    
    while(c < n){
        mina=INF;
        u=-1;
        for(i=1;i<=n;i++){
            if(!bk[i] && dis[i] < mina){
                mina=dis[i];
                u=i;
            }
        }
        //printf("u==%d\n",u);
        if(u == -1)
            break;
        bk[u]=1;
        c++;
        sum += dis[u];
        for(i=1;i<=n;i++){
            if(!bk[i] && dis[i] > e[u][i])
                dis[i] = e[u][i];
        }
    }
    if(u == -1)
        return -1;
    return sum;    
}