POJ 1287 Networking
来源:互联网 发布:游戏租号 软件 编辑:程序博客网 时间:2024/06/06 10:59
Networking
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<cstdio>#include<cstring>#include<algorithm>using namespace std; const int maxn=10010; int n,m;struct node{ int a,b; int price; }a[maxn]; int vis[maxn]; int find(int a) { if(vis[a]==a) return a; else return vis[a]=find(vis[a]); } void join(int a,int b) { int x,y; x=find(a); y=find(b); if(x!=y) vis[x]=y; } bool cmp(node a,node b) { return a.price <b.price ; } int main() { while(scanf("%d",&n)!=EOF&&n) { memset(a,0,sizeof(a)); scanf("%d",&m); for(int i=0;i<=n;i++) vis[i]=i; int a1,b1,c1; for(int i=0;i<m;i++) { scanf("%d%d%d",&a1 ,&b1 ,&c1 ); if(a1==a[i].a &&b1==a[i].b ) { if(c1>a[i].price ) { continue; } else { a[i].price =c1; } } else { a[i].a =a1; a[i].b =b1; a[i].price =c1; } } int dis=0; sort(a,a+m,cmp); for(int i=0;i<n*(n-1)/2;i++) { if(find(a[i].a )!=find(a[i].b )) { dis+=a[i].price; join(a[i].a,a[i].b ); } } printf("%d\n",dis); } return 0; }
- 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
- POJ 1287 Networking
- poj 1287 Networking
- poj 1287 networking kruskal
- POJ 1287 Networking
- poj 1287 Networking
- POJ 1287 Networking
- POJ 1287 Networking
- Poj 1287 Networking
- POJ 1287 Networking
- nginx安装&tomcat集群
- 【hdu 1863】畅通工程(最小生成树&克鲁斯卡尔算法模板)
- libx264进行视频编码的流程
- spark RDD 五大特性
- 572. Subtree of Another Tree
- POJ 1287 Networking
- 【剑指offer】面试题57(1):和为S的数字
- 三大需求助ROS成为百度自动驾驶车载计算框架
- 机器学习笔记(3)——贝叶斯分类
- HDU 6069 素数筛+分解质因子
- 【JavaScript】js可以直接使用的鼠标经过切换图片
- 阿里云+wordpress搭建个人博客
- Numpy、Pandas和Matplotlib包基础知识
- CUDA 8.0 + Ubuntu 16.04 @ 双显卡笔记本(核显+独显)安装教程