D - Constructing Roads
Time Limit:1000MS Memory Limit:32768KB
64bit IO Format:%I64d & %I64u
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
题目大意:给出每两个村庄的距离,然后给出已经修好的道路,求要使每个村庄都连通的最小花费。
分析:和求最小生成树差不多,只是多了一个条件,有些路是已经修好了,只需要将这些路的距离变为0,再求最小生成树即可。
代码:
#include<iostream>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<cstdio>
#define inf 0x3f3f3f3f
#define maxn 105
using namespace std;
int maze[105][105];
int dis[105];
bool vis[105];
int n;
void prim()
{
int i,j,ans=0;
dis[1]=0;
for(i=1;i<=n;i++)
{
int mark;
int minn=inf;
for(j=1;j<=n;j++)
{
if(!vis[j]&&dis[j]<minn)
{
minn=dis[j];
mark=j;
}
}
vis[mark]=true;
ans+=dis[mark];
for(j=1;j<=n;j++)
{
if(!vis[j]&&dis[j]>maze[mark][j])
dis[j]=maze[mark][j];
}
}
printf("%d\n",ans);
}
int main()
{
int i,j,st,en,k;
while(scanf("%d",&n)!=EOF)
{
memset(vis,false,sizeof(vis));
memset(dis,inf,sizeof(dis));
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
scanf("%d",&maze[i][j]);
if(maze[i][j]==0)
maze[i][j]=inf;
}
scanf("%d",&k);
for(i=1;i<=k;i++)
{
scanf("%d%d",&st,&en);
maze[st][en]=0;
maze[en][st]=0;//将已经修好的路径距离设为0
}
prim();
}
getchar();
getchar();
return 0;
}