B - Networking——POJ
来源:互联网 发布:网络三层与两层的区别 编辑:程序博客网 时间:2024/05/11 14:04
B - Networking
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uDescription
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
prime基本算法
#include<stdio.h>#include<string.h>int e[100][100];int n;int inf=99999;void init();int prime();int main(){int m,i,j,v,u,w; while(scanf("%d",&n)&&n){scanf("%d",&m);init();for(i=1;i<=m;i++){scanf("%d %d %d",&v,&u,&w);if(e[v][u]>w){e[v][u]=w;e[u][v]=w;}}printf("%d\n",prime());}return 0;}int prime(){int sum=0;int book[100]={0};int dis[100]={0},i,min,minx,j;for(i=1;i<=n;i++)dis[i]=e[1][i];book[1]=1;for(j=1;j<n;j++){min=inf;for(i=1;i<=n;i++){if(min>dis[i]&&book[i]==0){min=dis[i];minx=i;}}book[minx]=1;sum+=min;for(i=1;i<=n;i++){if(book[i]==0&&dis[i]>e[minx][i])dis[i]=e[minx][i];}}return sum;}void init(){int i,j;for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(i==j) e[i][j]=0;else e[i][j]=inf;}}}
0 0
- B - Networking——POJ
- POJ :Networking
- BATMAN—Better Approach To Mobile Adhoc Networking (B.A.T.M.A.N.)
- 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
- 网络中NAT原理及应用
- 系统辨识与盲辨识
- jvm内存
- 【Android】系统音量及屏幕亮度调节
- 什么是POJO,为什么要用POJO
- B - Networking——POJ
- css中伪类:after的用法(三种方式)
- poj 1036
- Android中使用Gesture加入手势操作
- centos 7安装后无法联网 没有IP地址
- HDU 1232 畅通工程 -- 并查集
- Dijkstra
- 图像转换为二维数组存入DSP6748
- Linux系统分区介绍:swap和root