[HDU1301]-Jungle Roads(最小生成树)
来源:互联网 发布:模块化编程的好处 编辑:程序博客网 时间:2024/06/06 04:49
Jungle Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6677 Accepted Submission(s): 4852
Problem 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.
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.
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
解题思路:典型的无向图求最短路径,最小生成树,有两种方法,一种是Prim(),一种是kruskal()我这里用的kruskal(),我比较喜欢用这个算法。
#include <cstdlib>#include <cstdio>#include <cstring>#include <string>#include <iostream>#include <cmath>#include <algorithm>using namespace std;const int maxn = 100000;int Rank[maxn];int cnte,cntp;int father[maxn];struct node{int st,ed,val;}edge[maxn];bool cmp(node a,node b){return a.val < b.val;}void make_set(){for(int i = 0;i < cntp;++ i){father[i]=i;Rank[i]=1;}return;}int findRoot(int x){if(x!=father[x])father[x]=findRoot(father[x]);return father[x];}void Union(int x,int y){x = findRoot(x);y = findRoot(y);if(x == y)return;if(Rank[x] < Rank[y])father[x]=y;else{if(Rank[x] == Rank[y])Rank[x]++;father[y]=x;}return;}int kruskal(){int sum=0;make_set();sort(edge,edge+cnte,cmp);for(int i = 0;i < cnte;++ i){if(findRoot(edge[i].st)!=findRoot(edge[i].ed)){Union(edge[i].st,edge[i].ed);sum += edge[i].val;}}return sum;}int main(){int t,n,m;char c;int st,ed,val;// freopen("data1301.in","r",stdin);while(cin>>t&&t){cnte=0;cntp=t;t--;while(t --){getchar();scanf("%c",&c);st = c-'A';scanf("%d",&m);for(int i = 0;i < m;++ i){getchar();scanf("%c %d",&c,&val);ed = c - 'A';edge[cnte].st = st;edge[cnte].ed = ed;edge[cnte++].val = val;}}int res = kruskal();printf("%d\n", res);}return 0;}
0 0
- HDU1301 Jungle Roads 【最小生成树Prim】
- hdu1301 Jungle Roads 【最小生成树】
- hdu1301 Jungle Roads (最小生成树)
- [HDU1301]-Jungle Roads(最小生成树)
- HDU1301 Jungle Roads(最小生成树prim)
- hdu1301 Jungle Roads(Prime算法求最小生成树)
- HDU1301 POJ1251 Jungle Roads【Prim】【最小生成树】
- hdu1301——Jungle Roads——最小生成树
- hdu1301 Jungle Roads(两种基本最小生成树)
- hdu1301&poj1251 Jungle Roads(最小生成树之prim果题)
- Jungle Roads(最小生成树)
- Jungle Roads 最小生成树
- Jungle Roads hdu1301
- hdu1301 Jungle Roads
- HDU1301-Jungle Roads
- Jungle Roads hdu1301 Prim
- hdu1301 Jungle Roads
- HDU1301--Jungle Roads
- FILE
- RxBus使用示例
- Mongodb 查询文档
- HDU 5438(并查集 + dfs)
- ios开发——宏定义实现NSLog不打印设置
- [HDU1301]-Jungle Roads(最小生成树)
- IOS APP因为广告方面被拒解决方案
- Android中ListView与适配器ArrayAdapter,SimpleAdapter,定义BaseAdapter适配器,ListView添加headerView,ListView滚动到最后一项
- 导出页面div中的图
- 美团外卖手机网页版数据加密解析
- js中typeof与instanceof用法
- Android Fragment 真正的完全解析(下)
- 四大组件Activity的工作过程
- RecycleView添加分割线。