poj-1287-Networking-最小生成树
来源:互联网 发布:淘宝卖家售假 编辑:程序博客网 时间:2024/06/05 20:33
问题:
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.
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.
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.
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
0171626
AC代码:
#include<cstdio>#include<algorithm>#include<iostream>using namespace std;int m,n,i,j,k;int fa[100050];struct node{int x1,x2,w;}p[100010];bool cmp(node x,node y){return x.w<y.w;}int find(int x){int r=x;while(fa[r]!=r)r=fa[r];return r;}int Kruskal(){int ans=0;for(i=1;i<=m;i++)fa[i]=i;sort(p+1,p+n+1,cmp);for(i=1;i<=n;i++){int fx=find(p[i].x1);int fy=find(p[i].x2);if(fx!=fy){fa[fx]=fy;ans=ans+p[i].w;}}return ans;}int main(){while(cin>>m>>n,m){for(i=1;i<=n;i++)scanf("%d%d%d",&p[i].x1,&p[i].x2,&p[i].w);int ans=Kruskal();int cut=0;for(i=1;i<=m;i++){if(fa[i]==i)cut++;} cout<<ans<<endl; }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 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 (最小生成树)
- C语言中volatile关键字的作用
- 关注民生民情——华北水利水电大学“情艺”国情社情调查
- Android Studio用小米手机调试安装不上应用error while installing apks
- POJ1789-Truck History
- Linux下U盘无法挂载以及文件夹出错
- poj-1287-Networking-最小生成树
- Java学习之旅--线程的创建方法
- java窗体Swing效果体验(并没有什么卵用)
- sync同步指令
- HDU 1305 Immediate Decodability (字典树)
- Android Studio 与git 添加忽略文件
- 认识BeanPostProcessor接口
- POJ3528 (三维凸包模板)
- marquee存在两个的时候如何消除自带边距