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 Constructing Roads

最小生成树 ACM HDU

HDU 1102 Constructing Roads(Prim算法)

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

HDU 1102 Constructing Roads

Problem Description There are N villages, which are numbered from 1 to N, and you should build so...

hdu1102 Constructing Roads 最小生成树Prim

本文出自:http://blog.csdn.net/svitter转载请注明出处; 原题地址:http://acm.hdu.edu.cn/showproblem.php?pid=1102 题意...

HDU1102--Constructing Roads

Problem Description There are N villages, which are numbered from 1 to N, and you should build some...

HDU 1102 Constructing Roads

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1102 Constructing Roads Time Limit: 2000/10...

HDU 1102 Constructing Roads

/* http://acm.hdu.edu.cn/showproblem.php?pid=1102 */ #include #include #define INF 100000000 int...

hdu1102Constructing Roads(Prime 算法求最小生成树)

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

HDU1102 Constructing Roads

题意大致是: 有N多村子,村庄之间的距离已经给出。求联通各个村庄的最短路径。 有一个附加条件,期中一些村庄已经有公路村庄,即已经连通。   非常简单, 只要把已经连通的村庄之间的距离设置为0,...

HDU 1102 Constructing Roads(Kruskal最小生成树求最小花费)

http://acm.hdu.edu.cn/showproblem.php?pid=1102 Constructing RoadsTime Limit: 2000/1000 MS (Java/Oth...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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