HDOJ1102 最小生成树简单运用

Constructing Roads

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24271 Accepted Submission(s): 9345

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

Sample Output
179

Source
kicc

Recommend
Eddy | We have carefully selected several similar problems for you: 1301 1162 1232 1875 1879

只要初始化时候把已经修建好的路对应的权值修改为0即可。

#include <iostream>#include <cmath>#include <ctime>#include <algorithm>#include <cstring>using namespace std;const int maxn = 102;const int inf = 1<<30;int a[maxn][maxn];bool used[maxn];int i,j,k,n,q,dist,tot;int dis[maxn];int tmp;void prim(){   int s=1,p;   dis[s]=0;   used[s]=1;   for (i=1; i<=n; i++) {       for (k=1; k<=n; k++) if (!used[k]){          dis[k] = min(dis[k],a[k][s]);       }       p=0; tmp = inf;       for (k=1; k<=n; k++) if (!used[k] && tmp > dis[k]){           tmp = dis[k];           p = k;       }       if (p==0) continue;       used[p] = 1;       dist += dis[p];       s = p;   }}int main(){   std::ios::sync_with_stdio(false);   while (cin >> n){     for (i=1; i<=n; i++)       for (j=1; j<=n; j++) cin >> a[i][j];     memset(used,0,sizeof(used));     dist = 0; tot = 0;     for (i=1; i<=n; i++) dis[i] = inf;     cin >> q;     for (i=1; i<=q; i++) {       cin >> j >> k;       a[j][k] = a[k][j] = 0;    }     prim();     cout << dist << endl;   }   return 0;}