九度OJ 1154 Jungle Roads
2014-02-19 15:44
218 查看
题目描述: 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 maintainedroads, 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 labeledA 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 thealphabet, 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 thisvillage 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 aacmsfor 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 villagewill 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 minutetime limit.样例输入:
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样例输出:
21630
#include <iostream>#include <algorithm>#include <stdio.h>using namespace std;int tree[30];struct Edge{int a, b;int cost;}edge[80];int top = 0;bool cmp(Edge a, Edge b){return a.cost < b.cost;}int findRoot(int x){while(tree[x] != -1)x = tree[x];return x;}int main(){int n;//freopen("1154in.txt","r",stdin);while(cin>>n && n){int i; top = 0; // 注意此处对全局变量的 初始化for(i = 0; i < 30; i++)tree[i] = -1;for(i = 0; i < n-1; i++){char a;int k;cin>>a>>k;while(k--){char c;int tmp;cin>>c>>tmp;edge[top].a = i;edge[top].b = c - 'A';edge[top].cost = tmp;top++;}}sort(edge,edge+top,cmp);//for(i = 0; i < top; i++)// printf("%d %d %d\n",edge[i].a,edge[i].b,edge[i].cost);int ans = 0;for(i = 0; i < top; i++){int root1 = findRoot(edge[i].a);int root2 = findRoot(edge[i].b);if(root1 != root2){tree[root1] = root2;ans += edge[i].cost;}}cout<<ans<<endl;}return 0;}
相关文章推荐
- 九度OJ 题目1154:Jungle Roads
- 九度OJ-1154:Jungle Roads
- 九度oj 1154
- 九度教程(73)题目1154:Jungle Roads,最小生成树
- 九度 题目1154:Jungle Roads
- 九度 oj 题目1154:Jungle Roads
- <C/C++基础>九度OJ题目1359--1414解题练习(七)
- 九度OJ学习笔记 题目1126
- 【九度OJ】:1515
- 10进制 VS 2进制 (九度oj)
- 九度OJ 1433 FatMouse(贪心)
- 九度OJ题目1036:Old Bill
- 九度OJ 1003 A+B
- 九度OJ题目1193:矩阵转置解题报告
- 九度OJ 1089 数字反转
- 九度OJ题目1107:搬水果
- 九度OJ题目1153:括号匹配问题
- 九度OJ 题目1015:还是A+B
- 【九度OJ】题目1202:排序
- 九度OJ 1456 胜利大逃亡(模拟+BFS)