poj-1287-Networking【最小生成树】
来源:互联网 发布:淘宝店铺出售可靠吗 编辑:程序博客网 时间:2024/06/07 02:17
题目链接:点击打开链接
Networking
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8672 Accepted: 4796
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
#include<cstdio>#include<algorithm>#include<cstring>using namespace std;const int Q=1000;int n,m;struct node{int from,to,val;}area[2*Q];bool cmp(node x,node y){return x.val<y.val;}int fa[Q];void init(){for(int i=1;i<=n;i++){fa[i]=i;}}int find(int x){if(x==fa[x])return x;return fa[x]=find(fa[x]);}bool judge(int x,int y){int nx=find(x);int ny=find(y);if(nx!=ny){fa[ny]=nx;return 1;}return 0;}int main(){while(scanf("%d %d",&n,&m)&&n){init();for(int i=0;i<m;i++){scanf("%d %d %d",&area[i].from,&area[i].to,&area[i].val);}sort(area,area+m,cmp);int cnt=0,ans=0;for(int i=0;cnt<n-1;i++){if(judge(area[i].from,area[i].to)){ans+=area[i].val;cnt++;}}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 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 (最小生成树)
- HDU1240 Asteroids!(BFS)
- 分治法讲解及实例
- 关于通知Notification的基础知识
- Asp.Net 应用程序在IIS发布后无法连接oracle数据库问题的解决方法
- HDU 5612 Baby Ming and Matrix games(dfs)
- poj-1287-Networking【最小生成树】
- 微服务实战:从架构到部署
- MSYS是什么,他与CYGWIN有什么区别?
- apiDoc
- NYOJ289苹果
- nginx启动、重启、关闭
- 仿京东首页摇红包
- caffe框架下添加自己的MFC程序(下)
- jMeter