Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30972 Accepted Submission(s): 11710
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: 1233 1301 1875 1879 1272 Constructing Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30972 Accepted Submission(s): 11710
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: 1233 1301 1875 1879 1272
算法思路:依旧是最小生成树,用kruskal跑一遍就好,有点不同的是,存在两个村庄已经连通路,这个时候只需将其cost置为0即可
#include<stdio.h>
#include<algorithm>
using namespace std;
int Tree[101];
int findRoot(int x)
{
if(Tree[x]==-1)
{
return x;
}
else
{
return findRoot(Tree[x]);
}
}
struct Edge
{
int a,b;
int cost;
bool operator< (const Edge &A) const
{
return cost<A.cost;
}
}edge[60000];
int main()
{
int n,x,i,j,cnt,q,sum;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
{
Tree[i]=-1;
}
cnt=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&x);
edge[cnt].a=i;
edge[cnt].b=j;
edge[cnt].cost=x;
cnt++;
}
}
scanf("%d",&q);
for(i=0;i<q;i++)
{
scanf("%d%d",&edge[cnt].a,&edge[cnt].b);//两个村庄已经连通,所需建造路径长度为0
edge[cnt].cost=0;
cnt++;
}
sort(edge,edge+cnt);
for(i=1;i<=n;i++)
{
Tree[i]=-1;
}
sum=0;
for(i=0;i<cnt;i++)
{
int a=findRoot(edge[i].a);
int b=findRoot(edge[i].b);
if(a!=b)
{
Tree[a]=b;
sum+=edge[i].cost;
}
}
printf("%d\n",sum);
}
return 0;
}