hdu 1102 Constructing Roads

原创 2015年11月18日 21:45:25
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

对于两个城镇之间修好道路的,使他们的建造费用为0,然后prim

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
#define inf 0x7f7f7f7f

int dis[200],n,m,map[200][200];bool vis[200];
void init()
{
	memset(vis,false,sizeof(vis));
	memset(map,inf,sizeof(map));
	memset(dis,inf,sizeof(dis));
}
int prim()
{
	dis[1]=0;int minn,mark,i,j,ans=0;
	for(i=1;i<=n;i++)
	{
		minn=inf;
		for(j=1;j<=n;j++)
		{
			if(minn>dis[j]&&!vis[j])
			{
				minn=dis[j];mark=j;
			}
		}
		vis[mark]=true;ans+=dis[mark];
		for(j=1;j<=n;j++)
		{
			if(map[mark][j]<dis[j]&&!vis[j])
			dis[j]=map[mark][j];
		}
	}
	return ans;
}
int main()
{
	int i,j,q;
	while(cin>>n)
	{
		init();
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				cin>>map[i][j];
			}
		}
		cin>>q;
		while(q--)
		{
			cin>>i>>j;map[i][j]=map[j][i]=0;
		}
		int d=prim();
		cout<<d<<endl;
	}
	return 0;
}

用kruskal算法时,使两点的父亲节点相同

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node
{
	int st,en,len;
}E[2000*2000];
int f[20000],n,m,map[20000][20000];
bool cmp(node &a,node &b)
{
	return a.len <b.len ;
}
int find(int x)
{
	if(f[x]==x) return f[x];
	else return f[x]=find(f[x]);
}
int kruskal()
{
	int i,ans=0;
	for(i=0;i<m;i++)
	{
		int x=find(E[i].st),y=find(E[i].en);
		if(x!=y)
		{
			ans+=E[i].len ;
			f[x]=y;
		}
	}
	return ans;
}
int main()
{
	int i,j,T,q,a,b;
	while(cin>>n)
	{
		T=0;
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=n;j++)
			{
				cin>>map[i][j];
				if(i<j)
				{
					E[T].st=i,E[T].en=j,E[T].len=map[i][j];
					T++;
				}
			}
			f[i]=i;
		}
		m=n*(n-1)/2;
		cin>>q;
		while(q--)
		{
			cin>>a>>b;
			int x=find(a),y=find(b);
			f[x]=y;//使两点的父亲节点相同
		}
		sort(E,E+T,cmp);
		int ans=kruskal();
		cout<<ans<<endl;
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 1102/POJ 2421 Constructing Roads(MST&Prim优化)

Constructing Roads http://acm.hdu.edu.cn/showproblem.php?pid=1102 http://poj.org/problem?id=2421 ...

HDU 1102 Constructing Roads 基础最小生成树★

题目大意:给你N个点(编号为0~N-1),M条路,问最小生成树是多少,如果不能生成最 小生成树,则输出impossible 分析:最基础的。。。 #include #include ...

hdu1102Constructing Roads(prim)

1.题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1102     2.题意及思路: 题意是给你n个村庄的地图,map[i][j]表示村庄i到村庄j的...

hdu 1102 Constructing Roads 最小生成树Kruskal

这原本是最小生成树prim部分的题,但感觉kruskal好用,就用kruskal 打了 这道题题意有点变扭,修路,使所有村庄连通,使修路的街道总长度最小;原本还以为使街道的总长度最小,但案例过不了才...

hdu1102 Constructing Roads (最小生成树,kruskal)

Constructing Roads Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Ot...

hdu1102 Constructing Roads(prim)

Constructing Roads Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

HDU1102 Constructing Roads 【最小生成树Prim】

Constructing Roads Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Othe...

HDU-1102-Constructing Roads

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1102 Constructing Roads Problem Description Ther...

hdu1102 Constructing Roads(最小生成树) prim

链接:http://hdu.hustoj.com/showproblem.php?pid=1102 Constructing Roads Time Limit: 2000/1000 MS ...

HDU 1102 Constructing Roads (最小生成树+Kruskal算法入门)

【题目链接】:click here~~ 【题目大意】:已知某几条道路已经修完,求全部道路要通路的最小花费 【解题思路】:基础的Kruskal算法了,按照边的权值从小到大排序一遍,符合条件加入到生成树中...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdu 1102 Constructing Roads
举报原因:
原因补充:

(最多只允许输入30个字)