POJ 1751 Highways(最小生成树prime算法)
来源:互联网 发布:cc2541中文数据手册 编辑:程序博客网 时间:2024/04/30 22:19
Highways
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluDescription
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.
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 i th 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.
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 i th 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.
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
91 50 0 3 24 55 10 45 21 25 331 39 71 2
Sample Output
1 63 74 95 78 3
题目描述,给出n个村庄的点坐标,要修建一条道路,将所有村庄连接,同时给出m条已修好的道路,问还需修那些道路是村庄连接,且花费最小,两村庄之间公路花费与其距离正相关
#include <cmath>#include <string>#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int maxn = 760;const int INF = 0x3f3f3f3f;int cost[maxn][maxn], lowc[maxn];int vis[maxn], pre[maxn];struct point{ int x, y;}p[maxn];int length (point a, point b){ return (a.x - b.x)*(a.x - b.x) + (a.y - b.y)*(a.y - b.y);}void prim (int n){ int i, j; memset (vis, 0, sizeof(vis)); vis[1] = 1; for (i=1; i<=n; i++) { pre[i] = 1; lowc[i] = cost[1][i]; } for (i=1; i<n; i++) { int p; int mini = INF; for (j=1; j<=n; j++) if (!vis[j] && mini > lowc[j]) { p = j; mini = lowc[j]; } if (cost[p][pre[p]] != 0) printf ("%d %d\n", pre[p], p); vis[p] = 1; for (j=1; j<=n; j++) { if (!vis[j] && lowc[j] > cost[p][j]) { lowc[j] = cost[p][j]; pre[j] = p; } } }}int main (){ int n; scanf ("%d", &n); for (int i=1; i<=n; i++) { scanf ("%d %d", &p[i].x, &p[i].y); for (int j=1; j<i; j++) cost[i][j] = cost[j][i] = length(p[i], p[j]);//村庄之间距离 cost[i][i] = 0; } int m; scanf ("%d", &m); while (m --) { int x, y; scanf ("%d %d", &x, &y); cost[x][y] = cost[y][x] = 0;//已修好两村庄距离为零 } prim(n); return 0;}
0 0
- POJ 1751 Highways(最小生成树prime算法)
- POJ 2485 Highways【最小生成树最大边,Prime算法】
- POJ:1751 Highways(最小生成树kruskal算法)
- Poj --1751 highways (最小生成树,kruskal算法)
- POJ 1751 - Highways(最小生成树)
- poj 1751 Highways(最小生成树)
- poj 1751 Highways(最小生成树)
- POJ - 1751 Highways(最小生成树)
- POJ-1751 Highways (最小生成树)
- 最小生成树Prim算法 Highways POJ
- poj 1751 Highways ( 最小生成树--prim算法 )
- 算法学习 POJ 1751 highways 最小生成树
- (搬运) poj 1751(Highways)+最小生成树两种算法
- POJ:2485 Highways(最小生成树kruskal算法)
- POJ 2485 Highways (最小生成树 Kruskal算法)
- POJ 1751 Highways 最小生成树
- poj-1751-Highways-(最小生成树)
- poj 1751 Highways (水最小生成树)
- C#入门4.3——赋值运算符
- 转发一篇关于正则的文章,很好,刚好用上,但是内容好多,以后随用随查吧
- 支付宝钱包Android平台基础技术的架构设计工作
- Android下数据存储
- * Random:产生随机数的类 *
- POJ 1751 Highways(最小生成树prime算法)
- Android EditText的使用及值得注意的地方
- Codeforces 166A Rank List(二分)
- C++11读书笔记—7(内存管理)
- 学密码学一定得学程序
- new Thread的弊端及Java四种线程池的使用
- 根据base64转换成图片并上传服务器
- 各种品牌/组装电脑一键u盘启动快捷键表
- 集合的理解