Constructing Roads --hdoj

                             Constructing Roads

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 32   Accepted Submission(s) : 17

Problem Description

There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, if and only if there is a road between A and B, or there exists a village C such that there is a road between A and C, and C and B are connected.

We know that there are already some roads between some villages and your job is the build some roads such that all the villages are connect and the length of all the roads built is minimum.

 

Input

The first line is an integer N (3 <= N <= 100), which is the number of villages. Then come N lines, the i-th of which contains N integers, and the j-th of these N integers is the distance (the distance should be an integer within [1, 1000]) between village i and village j. Then there is an integer Q (0 <= Q <= N * (N + 1) / 2). Then come Q lines, each line contains two integers a and b (1 <= a < b <= N), which means the road between village a and village b has been built.

 

Output

You should output a line contains an integer, which is the length of all the roads to be built such that all the villages are connected, and this value is minimum.

 

Sample Input

3
0 990 692
990 0 179
692 179 0
1
1 2

 

题解：第一个数字表示接下来有几行，每行有多少个数字，第一行：第一个地点与各个地点间的距离（包括自身），以此类推，N行结束之后，又有一个数字，表示接下来有M行，1 2表示1 2之间已经有路，所以不需要再建，最后求最短长度。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 101;
int map[N][N];
int mark[N];
int n,q,i,j;
int Prim()
{
    int sum = 0;
    int t = n;
    int min,k;
    memset(mark,0,sizeof(mark));
    while(--t)
    {
        min = 10000;
        for (i = 2; i <= n; i++)
        {
            if(mark[i]!=1 && map[1][i] < min)
            {
                min = map[1][i];
                k = i;
            }
        }
        mark[k] = 1;
        sum += min;
        for (j = 2; j <= n; j++)
        {
            if(mark[j]!=1 && map[k][j] < map[1][j])
            {
                map[1][j] = map[k][j];
            }
        }
    }
    return sum;
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        for (i = 1; i <= n; i++)
        {
            for (j = 1; j <= n; j++)
            {
                scanf("%d",&map[i][j]);
            }
        }
        scanf("%d",&q);
        while(q--)
        {
            scanf("%d%d",&i,&j);
            map[i][j] = 0;
            map[j][i] = 0;
        }
        printf("%d
",Prim());
    }
    return 0;
}