POJ 1251 Jungle Roads (kruskal)
来源:互联网 发布:网络主播妆容视频教程 编辑:程序博客网 时间:2024/06/06 15:44
Jungle Roads
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28106 Accepted: 13266
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
最小生成树模板题
kruskal
#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <string>#include <iostream>#include <algorithm>#include <list>#include <set>#include <stack>#include <queue>#include <map>#include <bitset>#include <vector>#include <functional>using namespace std;#define ll long long #define mem(a, b) memset(a, b, sizeof(a))#define debug() puts("FFFFFFFF!!!!");const int maxn = 100;const int inf = 0x3f3f3f3f;int n;int cnt;int par[maxn];struct edge { int u; int v; int cost;}t[maxn];bool cmp(edge a, edge b) { return a.cost < b.cost;}int find(int x) { if (x == par[x]) return x; return par[x] = find(par[x]);}int kruskal() { sort(t, t + cnt, cmp); int ans = 0; for (int i = 0; i <= n; i ++) { par[i] = i; } for (int i = 0; i < cnt; i ++) { edge e = t[i]; if (find(e.u) != find(e.v)) { int x = find(e.u); int y = find(e.v); par[x] = y; ans += e.cost; } } return ans;}int main(){ int m, w; string s1, s2; while (cin >> n && n) { cnt = 0; for (int i = 1; i < n; i ++) { cin >> s1 >> m; for (int j = 0; j < m; j ++) { cin >> s2 >> w; int v = s2[0] - 'A' + 1; t[cnt].u = i; t[cnt].v = v; t[cnt].cost = w; cnt ++; } } int ans = kruskal(); cout << ans << endl; }}
最小生成树入门:http://www.cnblogs.com/biyeymyhjob/archive/2012/07/30/2615542.html
阅读全文
0 0
- [POJ 1251]Jungle Roads Kruskal
- POJ 1251 Jungle Roads (kruskal)
- poj 1251 Jungle Roads【prim & kruskal】
- POJ 1251Jungle Roads(Kruskal)
- POJ 1251 Jungle Roads(Kruskal)
- POJ 1251-Jungle Roads 最小生成树Kruskal
- POJ-1251-Jungle Roads-最小生成树-Kruskal算法
- POJ 1251 Jungle Roads (Prim算法)&& (Kruskal算法)
- hdu 1301 Jungle Roads &&poj 1251 (prim 或者kruskal)
- POJ 1251 Jungle Roads(Prim or kruskal)
- poj 1251 Jungle Roads 解题报告(kruskal+prim)
- 用Kruskal算法解POJ 1251 Jungle Roads代码
- POJ 1251 Jungle Roads(最小生成树kruskal)
- poj 1251 Jungle Roads (最小生成树--kruskal)
- POj 1251 Jungle Roads (Kruskal算法 + Prim算法)
- POJ 1251 Jungle Roads
- poj 1251 Jungle Roads
- poj 1251 Jungle Roads
- shader总结五
- Spark开发-Yarn cluster模式
- 软考——存储器芯片
- 《Comparable接口与Comparator接口的区别》
- 图的基本概念;图的存储表示:邻接矩阵、邻接表
- POJ 1251 Jungle Roads (kruskal)
- SSM:spring+springmvc+mybatis框架中的XML配置文件功能详细解释
- hdu 5971Wrestling Match
- Leetcode 题解系列(八)
- mysql主主同步两个数据库同时写入,实现原理:自动增长主键不重复
- Java String 类
- ElasticSearch5.x踩坑记录(一):windows系统下的ElasticSearch5.6.3及head插件安装
- activemq linux安装与配置
- 探索View的事件分发机制