POJ 1287 Networking (mst简单)
来源:互联网 发布:会员制软件 编辑:程序博客网 时间:2024/05/16 07:53
点击打开链接
Networking
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5544 Accepted: 2989
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<string.h>#define M 107#define inf 0x3f3f3fusing namespace std;int g[M][M],dis[M],vis[M];int n,m,length;void mst(){ int pos,min,length=0,cnt=0; for(int i=1;i<=n;i++) dis[i]=g[1][i]; memset(vis,0,sizeof(vis)); vis[1]=1; for(int i=1;i<n;i++) { min=inf; pos=0; for(int j=1;j<=n;j++) if(!vis[j]&&min>dis[j]) { min=dis[j]; pos=j; } if(pos) { cnt++; vis[pos]=1; length+=min; for(int j=1;j<=n;j++) if(!vis[j]&&dis[j]>g[pos][j]) dis[j]=g[pos][j]; } } if(cnt!=n-1)printf("0\n"); else printf("%d\n",length);}int main(){ //freopen("in.txt","r",stdin); while(scanf("%d",&n),n) { for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) if(i==j)g[i][j]=0; else g[i][j]=inf; scanf("%d",&m); int a,b,c; while(m--) { scanf("%d%d%d",&a,&b,&c); if(g[a][b]>c) g[a][b]=g[b][a]=c; } mst(); } return 0;}
- POJ 1287 Networking (mst简单)
- POJ 1287 Networking (ZOJ 1372) MST
- poj 1287 Networking 【MST】【练模板】
- POJ 1287 Networking【MST模板题】
- Pku oj 1287 Networking(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
- POJ 1287 Networking
- poj 1287 Networking
- poj 1287 networking kruskal
- POJ 1287 Networking
- contos oracle ORA-12162 TNS net service name is incorrectly specified
- 2013武科大蓝桥杯校内选拔赛 H题 火柴棒
- C++重载操作符笔记
- 滨州学院CSDN高校俱乐部第四期公开课——未来IT技术发展趋势及职业规划
- java对象序列化
- POJ 1287 Networking (mst简单)
- LeetCode题解: Longest Consecutive Sequence
- 配置vps主机安全
- 解决oracle11g ORA-00119 ORA-00132方法
- 重新安装mysql遇到问题小结
- View.VISIBLE、INVISIBLE、GONE的区别
- 本周UVaOJ训练
- IntentFilter
- Kotlin