Constructing Roads
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
可以说是一道模板题
直接看代码
注意多组输入输出
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e4 + 10;
int rt[maxn];
int mp[maxn][maxn];
int n, m;
int tot;
struct node{
int s;
int e;
int v;
node() {}
node(int a, int b, int c) : s(a), e(b), v(c) {}
} edge[maxn];
void edgeadd(int a, int b, int v){
edge[tot] = node(a, b, v);
tot++;
}
bool cmp(node a, node b){
return a.v < b.v;
}
int fr(int x){
if(rt[x] == x)
return x;
return rt[x] = fr(rt[x]);
}
void init(){
for(int i = 1; i <= n; i++)
rt[i] = i;
tot = 0;
}
int kruskal(int n){
sort(edge, edge + tot, cmp);
int sum = 0;
for(int i = 0; i < n; i++){
int dx = fr(edge[i].s);
int dy = fr(edge[i].e);
if(dx != dy){
rt[dy] = dx;
sum += edge[i].v;
}
}
return sum;
}
int main(){
std::ios::sync_with_stdio(false);
while(cin >> n){
init();
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
cin >> mp[i][j];
}
}
cin >> m;
for(int i = 1; i <= m; i++){
int a, b;
cin >> a >> b;
mp[a][b] = 0;
mp[b][a] = 0;
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
edgeadd(i, j, mp[i][j]);
}
}
printf("%d\n",kruskal(tot));
}
}