Poj 1287 Networking【最小生成树】
2015-08-13 20:21
411 查看
Networking
Description
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are
given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the
area.
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.
Input
The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points.
The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only
one number P=0 denotes the end of the input. The data sets are separated with an empty line.
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j
i.
Output
For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.
Sample Input
Sample Output
求把所有的点连起来(直接或间接),需要建的最短的路,简单的最小生成树问题,克鲁斯卡尔算法,水过.......
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 7323 | Accepted: 3979 |
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are
given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the
area.
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.
Input
The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points.
The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only
one number P=0 denotes the end of the input. The data sets are separated with an empty line.
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j
i.
Output
For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.
Sample Input
1 0 2 3 1 2 37 2 1 17 1 2 68 3 7 1 2 19 2 3 11 3 1 7 1 3 5 2 3 89 3 1 91 1 2 32 5 7 1 2 5 2 3 7 2 4 8 4 5 11 3 5 10 1 5 6 4 2 12 0
Sample Output
0 17 16 26
求把所有的点连起来(直接或间接),需要建的最短的路,简单的最小生成树问题,克鲁斯卡尔算法,水过.......
#include<stdio.h> #include<algorithm> using namespace std; int per[105],n; struct lu { int a,b,len; }x[2505]; void init() { for(int i=1;i<=n;++i) { per[i]=i; } } int find(int x) { int r=x; while(r!=per[r]) { r=per[r]; } int i=x,j; while(i!=r) { j=per[i];per[i]=r;i=j; } return r; } int join(int x,int y) { int fx=find(x),fy=find(y); if(fx!=fy) { per[fx]=fy; return 1; } return 0; } int cmp(lu a,lu b) { return a.len<b.len; } int main() { int m,i,j; while(scanf("%d",&n),n) { scanf("%d",&m); init(); for(i=0;i<m;++i) { scanf("%d%d%d",&x[i].a,&x[i].b,&x[i].len); } sort(x,x+m,cmp); int cnt=0,sum=0; for(i=0;cnt<n-1;++i) { if(join(x[i].a,x[i].b)) { sum+=x[i].len; ++cnt; } } printf("%d\n",sum); } return 0; }
相关文章推荐
- docker强制批量删除none的image镜像
- C语言实现冒泡排序
- UVA 208 - Firetruck
- hdu 5389 Zero Escape(dp)
- HDOJ 4552 怪盗基德的挑战书(KMP+DP,不懂)
- SPI MOSI和MISO 相位不同
- (一二二)核心动画进阶
- hdu 5099 Comparison of Android versions
- Poj 3083 Children of the Candy Corn (DFS+BFS)
- 初始Annotation注解
- HDU 4720 Naive and Silly Muggles
- (一二二)核心动画进阶
- linux系统下载:Ubuntu 14.10 ISO 正式版镜像文件
- 类型别名、auto类型说明符和decltype类型说明符初探
- mysql创建用户授权
- Nginx基本数据结构之ngx_str_t
- 使用iptables管理docker容器做端口映射网络
- 子网划分的作用
- php5.5以上的版本 开启curl
- 线程 ,生产者. 消费者 互斥锁,条件变量