POJ--1287Networking
来源:互联网 发布:sql server 2000 mac 编辑:程序博客网 时间:2024/06/01 15:11
poj1287Networking-最小生成树prim
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4880 Accepted: 2641
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<string> #include<cstring> #include<cmath> #include<cstdlib> #include<iostream>#define min(a,b) a<b?a:b#define inf 0x3f3f3f3fusing namespace std;int map[110][110];int prim(int n){int dis[110];int vis[110]={0};int ans=0;memset(dis,inf,sizeof(dis));dis[1]=0;for(int i=1;i<=n;i++){int k=-1,tp=inf;for(int j=1;j<=n;j++){if(!vis[j]&&dis[j]<tp){k=j;tp=dis[j];}}vis[k]=1;ans+=tp;for(int j=1;j<=n;j++){if(!vis[j]&&map[k][j]<dis[j]){dis[j]=map[k][j];}}}return ans;}int main(){int p,r,a,b,c,i;while(scanf("%d",&p),p){scanf("%d",&r);memset(map,inf,sizeof(map));for(i=1;i<=r;i++){scanf("%d%d%d",&a,&b,&c);map[a][b]=map[b][a]=min(map[a][b],c);}printf("%d\n",prim(p));}}
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 kruskal
- POJ 1287 Networking
- poj 1287 Networking
- POJ 1287 Networking
- POJ 1287 Networking
- Poj 1287 Networking
- POJ 1287 Networking
- Cocos_Lua如何调整模拟器大小以及分辨率
- 取石子(七)
- LA3907 Puzzle
- libmp4v2的编译及简单DEMO
- JAVA连接MYSQL,查询 ,添加,删除,语句
- POJ--1287Networking
- JS中showModalDialog 详细使用
- Mac 配置JCo连接
- MFC工程从VC6.0转换成VS2013遇到的问题以及解决方法
- web.xml 配置详解
- 字符串匹配的KMP算法
- 列表滑动删除
- Windows10 下如何git库的 ssh 公钥(适用github,公司git库管理)
- HttpHelp