HD1301 Jungle Roads 【Kruska】
2015-08-12 18:46
495 查看
Jungle Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5522 Accepted Submission(s): 3986
[align=left]Problem Description[/align]
![](http://acm.hdu.edu.cn/data/images/1301-1.gif)
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.
[align=left]Sample Input[/align]
9 A 2 B 12 I 25 B 3 C 10 H 40 I 8 C 2 D 18 G 55 D 1 E 44 E 2 F 60 G 38 F 0 G 1 H 35 H 1 I 35 3 A 2 B 10 C 40 B 1 C 20 0
[align=left]Sample Output[/align]
216 30
AC代码
#include<stdio.h> #include<algorithm> #include<iostream> #include<string.h> using namespace std; int pre[110],n; struct st { char str1,str2; int dis; }a[110]; void init() { for(int i=1;i<=n;i++) pre[i]=i; } bool cmp(st a,st b) { return a.dis<b.dis; } int find(int x) { while(pre[x]!=x) x=pre[x]; return x; } bool join(int x,int y) { int fx=find(x); int fy=find(y); if(fx!=fy) { pre[fx]=fy; return true; } return false; } int main() { int k,m,g,s,p; char str,ch; while(scanf("%d",&n),n) { init(); getchar(); n=n-1; p=0,s=0; while(n--) { scanf("%c%d",&str,&k); getchar(); for(int i=0;i<k;i++) { scanf("%c%d",&ch,&m); getchar(); a[p].str1=str-'A'+1; a[p].str2=ch-'A'+1; a[p].dis=m; p++; } } sort(a,a+p,cmp); //init(); for(int i=0;i<p;i++) { if(join(a[i].str1,a[i].str2)) s+=a[i].dis; } printf("%d\n",s); } }
相关文章推荐
- eclipse,idea 安装第三方jar到本地仓库
- hdoj 3639 Hawk-and-Chicken 【有向图SCC】【缩点后反向建图 求最大传递值】
- TCP/IP、Http、Socket的区别
- 36.Block页面间传值
- spring中context:property-placeholder/元素
- Ice_cream’s world III
- 知乎-Android自动化测试工具总结
- uva 120 Stacks of Flapjacks
- 【三分】Expanding Rods
- 【移动安全】Android App Smail代码动态跟踪调试方法
- Http 异步批量下载图片之优化
- java doc排除不需要的public method
- HD 1875 畅通工程再续 【Kruskal】
- Error generating final archive: Debug Certificate expired on 10/09/18 16:30[/code]
- UITabBar,快捷菜单,block实现传值
- 搜索练习题【题解】
- 用Properties加载“ .properties "文件产生的java.lang.NullPointerException的解决之道
- html5 video标签不能播放mp4的问题
- AndroidStudio project添加.so文件方法
- iOS编程——通过UUID和KeyChain来代替Mac地址实现iOS设备的唯一标示(Swift 优化版)