POJ2485 Highways (最小生成树)

B - Highways

Crawling in process...
Crawling failed
Time Limit:1000MS    
Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit
Status Practice POJ 2485

Appoint description:
System Crawler (2016-05-12)

Description

The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They‘re planning to build some highways
so that it will be possible to drive between any pair of towns without leaving the highway system.

Flatopian towns are numbered from 1 to N. Each highway connects exactly two towns. All highways follow straight lines. All highways can be used in both directions. Highways can freely cross each other, but a driver can only switch between highways at a town
that is located at the end of both highways.

The Flatopian government wants to minimize the length of the longest highway to be built. However, they want to guarantee that every town is highway-reachable from every other town.

Input

The first line of input is an integer T, which tells how many test cases followed.

The first line of each case is an integer N (3 <= N <= 500), 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, 65536]) between
village i and village j. There is an empty line after each test case.

Output

For each test case, you should output a line contains an integer, which is the length of the longest road to be built such that all the villages are connected, and this value is minimum.

Sample Input

1

3
0 990 692
990 0 179
692 179 0

Sample Output

692

Hint

Huge input,scanf is recommended.

kruskal算法

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
struct node
{
	int x,y;
	int cost;
}c[250000];
bool vis[505][505];
int fa[505];
bool cmp(node a,node b)
{
	return a.cost<b.cost;
}
void init(int n)
{
	for(int i=0;i<=n;i++)
	fa[i]=i;
}
int find(int x)
{
	if(fa[x]!=x) fa[x]=find(fa[x]);
	return fa[x];
}
int main()
{
	int ncase;
	scanf("%d",&ncase);
	while(ncase--)
	{
		int n;
		memset(vis,false,sizeof(vis));
		memset(&c,0,sizeof(&c));
		scanf("%d",&n);
		init(n);
		int t=0;
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<n;j++)
			{
				int x;
				scanf("%d",&x);
				if(i!=j&&!vis[i][j])
				{
					vis[i][j]=vis[j][i]=true;
					c[t].x=i;c[t].y=j;c[t].cost=x;
					t++;
				}
			}
		}
		sort(c,c+t,cmp);
		int edge=0;
		int result=0;
		for(int i=0;i<t;i++)
		{
			int xx=find(c[i].x);
			int yy=find(c[i].y);
			if(xx!=yy)
			{
				fa[xx]=yy;
				result=max(result,c[i].cost);
				edge++;
				if(edge==n-1)
				break;
			}
		}
		printf("%d\n",result);
	}
	return 0;
}
时间: 2024-10-11 00:45:14

POJ2485 Highways (最小生成树)的相关文章

POJ-2485 Highways(最小生成树)

Highways Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 28390   Accepted: 12936 Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Fl

POJ 2485 Highways 最小生成树 (Kruskal)

Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning to build some highways so that i

POJ 2485 Highways(最小生成树+ 输出该最小生成树里的最长的边权)

Highways Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 23426   Accepted: 10829 Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Fl

POJ2485 Highways【Prim】

Highways Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 23247 Accepted: 10720 Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatop

POJ2485 Highways

Time Limit: 1000MS   Memory Limit: 65536KB   64bit IO Format: %lld & %llu Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government i

HDOJ 1751 Highways(最小生成树prim)

Highways Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 11071   Accepted: 3145   Special Judge Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian

Gym - 100203H Highways 最小生成树

题意:平面上n个点修路,已经修好了m条,再修若干条使得点之间连通,求最小代价的方案. 思路:基本上是裸的最小生成树了,我这里存边直接存在multyset了,取的时候也比较方便,我本来就是这么考虑的,队友打了一发朴素的排序的超时了. 1 #include <iostream> 2 #include <cstdio> 3 #include <fstream> 4 #include <algorithm> 5 #include <cmath> 6 #i

Codeforces Gym 100203H Highways 最小生成树

原题链接:http://codeforces.com/gym/100203/attachments/download/1702/statements.pdf 题解 给你平面上若干点,生成一颗完全图,让你生成一颗最小生成树.模板题.图中已经有了的边要将权值置0.代码是队友写的. 代码 #include <iostream> #include <cstring> #include <cstdlib> #include <cstdio> #include <

POJ2485:Highways(模板题)

http://poj.org/problem?id=2485 Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian government is aware of this problem. They're planning t