POJ 2485 Highways
2015-08-17 15:51
351 查看
A - Highways
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
SubmitStatus
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
Sample Output
Hint
Huge input,scanf is recommended.
最小生成树第一发。克鲁斯卡尔水过。手敲了一遍。
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
SubmitStatus
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.
最小生成树第一发。克鲁斯卡尔水过。手敲了一遍。
#include <stdio.h> #include <algorithm> #define N 505 using namespace std; typedef struct { int x,y,d; }Node; int fa ; Node graph[N*N]; int input ; bool cmp(Node a,Node b) { return a.d<b.d; } void InitSet(int n) { for(int i=1; i<=n; i++) fa[i] = i ; } int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]) ; } bool Merge(int u ,int v) { int fu = Find(u) , fv = Find(v) ; if(fu != fv) fa[fv] = fu ; return fu != fv ; } int main() { int t; scanf("%d",&t); while(t--) { int n,ans=0; scanf("%d",&n); InitSet(n); int k=1; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) scanf("%d",&input[i][j]); for(int j=1;j<i;j++) graph[k].x=i,graph[k].y=j,graph[k++].d=input[i][j]; } sort(graph,graph+k,cmp); for(int i=1;i<k;i++) if(Merge(graph[i].x,graph[i].y)) ans=graph[i].d; printf("%d\n",ans); } return 0; }
相关文章推荐
- 关于ARC下修饰代理用assign还是weak
- JavaSE 最容易出错的几个简单的问题
- 截取字符串
- (转)坐标系统与投影变换及在ARCGIS中的应用
- UITextView高度随文字自动增加
- grid layout
- iOS基础-UIKit框架-多控制器管理-实例:私人通讯录
- 剑指offer——面试题25:二叉树中和为某一值的路径(递归,深度优先搜索)
- Yeoman自动构建 Angularjs 项目
- oracle中的相关子查询(correlated subqueries)
- Leetcode#58||Length of Last Word
- 以每行一个单词的形式打印其输入
- php变量声明时的单引号与双引号区别
- spring管理事务异常时事务未回滚问题笔记
- 关于字符串读入的总结
- Win10正式版更新失败成惯例:部分用户KB3081438安装失败
- web设计小白 代码过于冗长问题解决
- HDU 5088 Revenge of Nim II (高斯消元??)
- IE下载docx(xlsx,pptx)文件时,会自动将扩展名变为zip
- codeforces 509C C. Sums of Digits(数位dp+贪心+枚举)