【POJ】1287 - Networking(最小生成树(克鲁斯塔尔),水)
来源:互联网 发布:淘宝如何用图片搜同款 编辑:程序博客网 时间:2024/04/29 08:48
Networking
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7698 Accepted: 4216
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.
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.
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 02 31 2 372 1 171 2 683 71 2 192 3 113 1 71 3 52 3 893 1 911 2 325 71 2 52 3 72 4 84 5 113 5 101 5 64 2 120
Sample Output
0171626
Source
Southeastern Europe 2002
用克鲁斯塔尔算,不难的最小生成树的题。
代码如下:
#include <stdio.h>#include <algorithm>using namespace std;struct node{int st,end,cost;}a[2500];//记录每一条路 int pp[55];bool cmp(node a,node b)//按花销从小到大排序 {return a.cost<b.cost;}int find(int x){int r=x;while (r!=pp[r])r=pp[r];int j=x;int t;while (pp[j]!=r){t=pp[j];pp[j]=r;j=t;}return r;}int join(int x,int y){int fx,fy;fx=find(x);fy=find(y);if (fx!=fy){pp[fx]=fy;return 1;//不一棵树返回1 }return 0;}int main(){int p,r;//点,路线数int ans;int num;//完成连接的数量,等于p-1时终止 while (~scanf ("%d",&p) && p){scanf ("%d",&r);//首先初始化for (int i=1;i<=p;i++){pp[i]=i;}ans=0;num=0;//输入for (int i=0;i<r;i++){scanf ("%d %d %d",&a[i].st,&a[i].end,&a[i].cost);}if (p==1){printf ("0\n");continue;}sort (a,a+r,cmp);//花费从小到大排序for (int i=0;i<r;i++){if (join(a[i].st,a[i].end)){ans+=a[i].cost;num++;}if (num==p-1)break;}printf ("%d\n",ans);}return 0;}
0 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||zoj 1372 Networking 最小生成树 kruskal 克鲁斯卡尔算法
- POJ-1287-Networking(克鲁斯卡尔)
- POJ 1287 Networking(kruscal 最小生成树)
- poj 1287 Networking(prim or kruscal最小生成树)
- POJ - 1287 Networking (最小生成树Kruskal)
- POJ 1287:Networking(最小生成树Kruskal)
- POJ 1287 Networking (最小生成树入门)
- POJ - 1287 Networking(最小生成树模板题)
- POJ 1287 Networking(最小生成树kruskal)
- 安卓动画开始,暂停和停止
- 显示cell的分割线的个数
- android 侧滑学习2
- C#源代码—姓名 请输入老师的编号、姓名、职称和部门
- 在linux下编译安装python3.5.1问题解决
- 【POJ】1287 - Networking(最小生成树(克鲁斯塔尔),水)
- 禁止访问apache下项目目录
- [HDU 2563]统计问题[递推]
- 如何在Xcode7.2中添加空模板
- Eclipse与Android Studio快捷键对比
- CentOS 6.5 64位下安装httpsqs
- 关于求解一个链表中第k大元素的想法
- Linux相关问题
- 使用CocoaPods被卡住:Updating local specs repositories