POJ 1751 Prim
来源:互联网 发布:网络歌曲改编歌词 编辑:程序博客网 时间:2024/05/17 09:09
Highways
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 8855 Accepted: 2467 Special Judge
Description
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a number of highways connecting some of the most important towns. However, there are still some towns that you can't reach via a highway. It is necessary to build more 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 and town i has a position given by the Cartesian coordinates (xi, yi). Each highway connects exaclty two towns. All highways (both the original ones and the ones that are to be built) follow straight lines, and thus their length is equal to Cartesian distance between towns. 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 cost of building new highways. However, they want to guarantee that every town is highway-reachable from every other town. Since Flatopia is so flat, the cost of a highway is always proportional to its length. Thus, the least expensive highway system will be the one that minimizes the total highways length.
Input
The input consists of two parts. The first part describes all towns in the country, and the second part describes all of the highways that have already been built.
The first line of the input file contains a single integer N (1 <= N <= 750), representing the number of towns. The next N lines each contain two integers, xi and yi separated by a space. These values give the coordinates of ith town (for i from 1 to N). Coordinates will have an absolute value no greater than 10000. Every town has a unique location.
The next line contains a single integer M (0 <= M <= 1000), representing the number of existing highways. The next M lines each contain a pair of integers separated by a space. These two integers give a pair of town numbers which are already connected by a highway. Each pair of towns is connected by at most one highway.
Output
Write to the output a single line for each new highway that should be built in order to connect all towns with minimal possible total length of new highways. Each highway should be presented by printing town numbers that this highway connects, separated by a space.
If no new highways need to be built (all towns are already connected), then the output file should be created but it should be empty.
Sample Input
9
1 5
0 0
3 2
4 5
5 1
0 4
5 2
1 2
5 3
3
1 3
9 7
1 2
Sample Output
1 6
3 7
4 9
5 7
8 3
Source
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 8855 Accepted: 2467 Special Judge
Description
The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a number of highways connecting some of the most important towns. However, there are still some towns that you can't reach via a highway. It is necessary to build more 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 and town i has a position given by the Cartesian coordinates (xi, yi). Each highway connects exaclty two towns. All highways (both the original ones and the ones that are to be built) follow straight lines, and thus their length is equal to Cartesian distance between towns. 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 cost of building new highways. However, they want to guarantee that every town is highway-reachable from every other town. Since Flatopia is so flat, the cost of a highway is always proportional to its length. Thus, the least expensive highway system will be the one that minimizes the total highways length.
Input
The input consists of two parts. The first part describes all towns in the country, and the second part describes all of the highways that have already been built.
The first line of the input file contains a single integer N (1 <= N <= 750), representing the number of towns. The next N lines each contain two integers, xi and yi separated by a space. These values give the coordinates of ith town (for i from 1 to N). Coordinates will have an absolute value no greater than 10000. Every town has a unique location.
The next line contains a single integer M (0 <= M <= 1000), representing the number of existing highways. The next M lines each contain a pair of integers separated by a space. These two integers give a pair of town numbers which are already connected by a highway. Each pair of towns is connected by at most one highway.
Output
Write to the output a single line for each new highway that should be built in order to connect all towns with minimal possible total length of new highways. Each highway should be presented by printing town numbers that this highway connects, separated by a space.
If no new highways need to be built (all towns are already connected), then the output file should be created but it should be empty.
Sample Input
9
1 5
0 0
3 2
4 5
5 1
0 4
5 2
1 2
5 3
3
1 3
9 7
1 2
Sample Output
1 6
3 7
4 9
5 7
8 3
Source
Northeastern Europe 1999
<span style="color:#6600cc;">/********************************************** author : Grant Yuan time : 2014.7.30 algorithm: Prim source : PKU 1751**********************************************/#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<vector>#include<stack>#include<queue>#include<map>#include<cmath>#define MAX 753#define INF 99999999using namespace std;struct node{int x,y;};int m,n;node b[MAX];int cost[MAX][MAX];bool used[MAX];int mincost[MAX];int pre[MAX];void prim(){ for(int i=1;i<=n;i++) { mincost[i]=INF; used[i]=false; } memset(pre,0,sizeof(pre)); mincost[1]=0; while(true){ int v=-1; for(int i=1;i<=n;i++) { if(!used[i]&&(v==-1||mincost[i]<mincost[v])) v=i; } if(v==-1) break; used[v]=true; for(int i=1;i<=n;i++) { if(cost[v][i]<mincost[i]) { mincost[i]=cost[v][i]; if(!used[i]) pre[i]=v; } }}}int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d%d",&b[i].x,&b[i].y); } int d=1; for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) { cost[i][j]=cost[j][i]=INF;cost[i][i]=INF; cost[i][j]=cost[j][i]=(b[i].x-b[j].x)* (b[i].x-b[j].x)+(b[i].y-b[j].y)* (b[i].y-b[j].y); } scanf("%d",&m);int aa,bb; for(int i=1;i<=m;i++) { scanf("%d%d",&aa,&bb); cost[aa][bb]=cost[bb][aa]=0; } prim(); for(int i=2;i<=n;i++) { if(cost[i][pre[i]]&&i!=pre[i]) printf("%d %d\n",i,pre[i]); }}</span>
0 0
- poj 1751 prim
- Poj 1751 Highways(prim)
- POJ 1751 Prim
- Highways POJ 1751 【Prim || Kruscal】
- poj 1751 Highways prim算法
- poj 1751 prim输出路径
- poj 1751 Highways (prim算法)
- 累觉不爱POJ 1751Prim
- POJ 1751 Highways(最小生成树prim)
- poj 1751 Highways 最小生成树 prim
- POJ 1751Highways(Prim存储路径模板)
- poj 1751 Highways (prim和kruskal)
- poj 1258 prim算法
- poj 1251 Prim算法
- poj 2485 Prim
- POJ 1789 Prim
- POJ 2485 Prim
- POJ 1258 Prim算法
- HDU--3605 Escape (多重匹配)
- poj 2724 Purifying Machine 二分图最大匹配
- IOS调用系统震动和系统声音
- HBase Capacity Planning
- 大数据公司实践零售O2O:打通线上线下,全触点大会员
- POJ 1751 Prim
- HDU 3657 Game | 最小割 (补)
- EXT4.1 tabpanel
- Irrlicht例程05:创造一个有声世界(下)
- Android dev tips(update at 2015-11-26)
- 广工 数据结构 7.23
- Nginx的Upstream负载均衡与反向代理的配置
- android初级阶段总结
- D3D MipMap解析