POJ 1287 Networking【MST模板题】
来源:互联网 发布:sodu源码 编辑:程序博客网 时间:2024/04/29 18:45
Networking
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 8214
Accepted: 4528
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
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
给你n个点,m条边,输出连接所有点的最小消耗。克里斯卡尔算法秒之。
AC代码:
#include<stdio.h>#include<algorithm>#include<string.h>using namespace std;struct path{ int x,y,w;}a[10005];int f[100005];int cmp(path a,path b){ return a.w<b.w;}int find(int x){ return f[x] == x ? x : (f[x] = find(f[x]));}void merge(int a,int b){ int A,B; A=find(a); B=find(b); if(A!=B) f[B]=A;}int main(){ int n; while(~scanf("%d",&n)) { if(n==0)break; int m; for(int i=1;i<=n;i++)f[i]=i; scanf("%d",&m); for(int i=0;i<m;i++) { scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].w); } sort(a,a+m,cmp); int output=0; for(int i=0;i<m;i++) { if(find(a[i].x)!=find(a[i].y)) { merge(a[i].x,a[i].y); output+=a[i].w; } } printf("%d\n",output); }}
- POJ 1287 Networking【MST模板题】
- poj 1287 Networking 【MST】【练模板】
- POJ 1287 Networking (mst简单)
- POJ 1287 Networking (ZOJ 1372) MST
- POJ - 1287 Networking(最小生成树模板题)
- Pku oj 1287 Networking(MST)
- POJ 1861 Network (Kruskal求MST模板题)
- poj 1258 MST模板题(用PRIM+堆实现)
- Tree(MST模板题)
- poj 1287 Networking
- POJ-1287-Networking
- poj 1287 networking
- POJ 1287 Networking
- POJ:1287 Networking
- POJ 1287 Networking
- poj 1287 Networking
- POJ-1287 Networking
- poj 1287 Networking
- java中进程和线程的区别
- Linux操作系统几个常用知识点
- flask笔记:2:Hello World
- 动态规划求小于等于n的质数个数
- 连接oracle数据库
- POJ 1287 Networking【MST模板题】
- 巧用Singleton(单例)
- 中等难度
- hdu 1181
- 第5次作业
- 同一作用域下函数名(变量名)可以覆盖类、结构体名
- iOS获取屏幕尺寸的方法
- flask笔记:3:模板
- Paxos协议基本原理