POJ 2485 Highways (最小生成树)
2015-02-26 11:09
369 查看
[align=center]Highways[/align]
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.
Source
POJ Contest,Author:Mathematica@ZSU
直接就是Dijkstra算法改成Prim算法。
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 22130 | Accepted: 10204 |
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.
Source
POJ Contest,Author:Mathematica@ZSU
直接就是Dijkstra算法改成Prim算法。
代码: #include <iostream> #include <algorithm> #include <stdio.h> #include <string.h> using namespace std; #define M 1001 #define INF 999999 #define min(a,b) (a<b?a:b) int map[M][M],dis[M],fa[M]; int P[110]; int n,m,maxn; void Prim() { bool cov[M]; memset(cov,0,sizeof(cov)); for(int i=1;i<=n;i++) dis[i]=(i==1?0:INF); for(int i=1;i<=n;i++) { int Min=INF,s; for(int y=1;y<=n;y++) if(!cov[y] && dis[y]<Min) { Min=dis[y]; s=y; } cov[s]=1; for(int y=1;y<=n;y++) if(dis[y]>map[s][y] && !cov[y] && s!=y) //这个地方改了。没有dis[s]了。 dis[y]=map[s][y]; } } void output() { maxn=-INF; for(int i=2;i<=n;i++) maxn=max(maxn,dis[i]); printf("%d\n",maxn); } void Init() { int i,j,a,b,z; for(i=0;i<M;i++) for(j=0;j<M;j++) map[i][j]=(i==j?0:INF); scanf("%d",&a); while(a--) { scanf("%d",&n); for(i=1;i<=n;i++) for(j=1;j<=n;j++) scanf("%d",&map[i][j]); Prim(); output(); } } int main() { Init(); return 0; }
相关文章推荐
- POJ 2485 Highways【最小生成树】
- poj 2485 Highways 最小生成树
- poj-2485-Highways-最小生成树的最大权边
- hdoj_1102Constructing Roads(最小生成树)&& poj_2485Highways
- poj 2485 Highways prim最小生成树
- poj 2485 Highways (最小生成树)
- poj 2485 Highways(最小生成树,基础,最大边权)
- POJ 2485 Highways(最小生成树 Prim)
- POJ2485,Highways,最小生成树继续Prim
- poj 2485 Highways(kruscal or prim最小生成树)
- POJ 2485 Highways(prim 最小生成树)
- POJ 2485 Highways(最小生成树)
- poj 2485 Highways -----最小生成树。prim
- POJ 2485 Highways【最小生成树最大权——简单模板】
- POJ 2485 Highways(最小生成树Prim算法)
- poj 2485 Highways 最小生成树
- poj 2485 Highways 最小生成树
- POJ 2485-Highways 最小生成树Prim算法
- poj 2485 Highways (最小生成树)
- POJ 2485 Highways 图论 prim算法 最小生成树