poj1251Jungle Roads-最小生成树prim
来源:互联网 发布:java path 编辑:程序博客网 时间:2024/06/10 18:31
Jungle Roads
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16038 Accepted: 7209
Description
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A through I in the maps above. The map on the right shows the roads that could be maintained most cheaply, for 216 aacms per month. Your task is to write a program that will solve such problems.
Input
The input consists of one to 100 data sets, followed by a final line containing only 0. Each data set starts with a line containing only a number n, which is the number of villages, 1 < n < 27, and the villages are labeled with the first n letters of the alphabet, capitalized. Each data set is completed with n-1 lines that start with village labels in alphabetical order. There is no line for the last village. Each line for a village starts with the village label followed by a number, k, of roads from this village to villages with labels later in the alphabet. If k is greater than 0, the line continues with data for each of the k roads. The data for each road is the village label for the other end of the road followed by the monthly maintenance cost in aacms for the road. Maintenance costs will be positive integers less than 100. All data fields in the row are separated by single blanks. The road network will always allow travel between all the villages. The network will never have more than 75 roads. No village will have more than 15 roads going to other villages (before or after in the alphabet). In the sample input below, the first data set goes with the map above.
Output
The output is one integer per line for each data set: the minimum cost in aacms per month to maintain a road system that connect all the villages. Caution: A brute force solution that examines every possible set of roads will not finish within the one minute time limit.
Sample Input
9A 2 B 12 I 25B 3 C 10 H 40 I 8C 2 D 18 G 55D 1 E 44E 2 F 60 G 38F 0G 1 H 35H 1 I 353A 2 B 10 C 40B 1 C 200
Sample Output
21630
//还是最小生成树。就是格式变换了一下!!!
就是告诉你每个顶点之间的距离,求出最小距离的生成树
代码:
#include<cstdio>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<iostream>#include<cstring>using namespace std;#define inf 9999int vis[1001];int map[101][101];int dis[101];int n;int Prim(){memset(vis,0,sizeof(vis));int sum=0; int k;for(int i=1;i<=n;i++)dis[i]=map[1][i];vis[1]=1; for(int i=1;i<n;i++){int min=inf;for(int j=1;j<=n;j++)if(!vis[j]&&dis[j]<min){min=dis[j];k=j;}sum+=dis[k];vis[k]=1;for(int j=1;j<=n;j++){if(!vis[j]&&map[k][j]<dis[j]){dis[j]=map[k][j];}}}return sum;}void init(){for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) map[i][j]=inf; }int main(){ int num,tt; char u,v; while(cin>>n&&n){ init();for(int i=1;i<n;i++){ cin>>u>>num; while(num--){ cin>>v>>tt; map[u-'A'+1][v-'A'+1]=map[v-'A'+1][u-'A'+1]=tt; } } cout<<Prim()<<endl;} return 0; }
- poj1251Jungle Roads-最小生成树prim
- POJ1251Jungle Roads(最小生成树)
- POJ2421 Constructing Roads [最小生成树 prim]
- zoj1406----------Jungle Roads 最小生成树 prim
- hdu1102 Constructing Roads 最小生成树+prim
- poj2421Constructing Roads-最小生成树prim
- hdu1102 Constructing Roads 最小生成树Prim
- hdu1301Jungle Roads(最小生成树之prim)
- hdu1102 Constructing Roads 最小生成树Prim
- HDU1102 Constructing Roads 【最小生成树Prim】
- HDU1301 Jungle Roads 【最小生成树Prim】
- POJ1251 Jungle Roads 【最小生成树Prim】
- hdu1102(Constructing Roads)--prim最小生成树
- hdu1102 Constructing Roads--最小生成树prim
- POJ2421 Constructing Roads(最小生成树,Prim)
- Building Roads(prim 最小生成树)
- HDU1301 Jungle Roads(最小生成树prim)
- hdu 1102 Constructing Roads(Prim最小生成树)
- XML的增删改查
- 杨辉三角
- AT91SAM9G45开发板ARM9工业控制板
- 统计学习笔记(2)——感知机模型
- Unity3D研究院之2D游戏开发制作原理(二十一)
- poj1251Jungle Roads-最小生成树prim
- 栈基本操作(C++实现)
- 永续信息化
- Android--布局方式(RelativeLayout)学习
- poj 1258Agri-Net-最小生成树prim
- Android 数据导出之Excle jxl.jar
- Android实现翻页功能原理
- S3C6410的DRAM控制器
- 第十七周任务:采用引用排序