POJ 1251 && HDU 1301 Jungle Roads (最小生成树)
2016-07-29 17:48
351 查看
Jungle Roads
题目链接:
http://acm.hust.edu.cn/vjudge/contest/124434#problem/Ahttp://acm.hust.edu.cn/vjudge/contest/124434#problem/L
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 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
Sample Output
21630
题意:
给出每个字母与哪些字母相连及花费,求一个最小花费的边集使得所有字母联通.题解:
裸的最小生成树,读入数据的时候稍微小心一些.代码:
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> #include <queue> #include <map> #include <set> #include <vector> #define LL long long #define eps 1e-8 #define maxn 1100 #define mod 100000007 #define inf 0x3f3f3f3f #define IN freopen("in.txt","r",stdin); using namespace std; struct node{ int left,right,cost; }road[maxn]; int cmp(node x,node y) {return x.cost<y.cost;} int p[maxn],m,n; int find(int x) {return p[x]=(p[x]==x? x:find(p[x]));} int kruskal() { int ans=0; for(int i=1;i<=n;i++) p[i]=i; sort(road+1,road+m+1,cmp); for(int i=1;i<=m;i++) { int x=find(road[i].left); int y=find(road[i].right); if(x!=y) { ans+=road[i].cost; //printf("%d\n", road[i].cost); p[x]=y; } } return ans; } int main(int argc, char const *argv[]) { //IN; while(scanf("%d", &n) != EOF && n) { m = 0; memset(road,0,sizeof(road)); for(int i=1; i<n; i++) { getchar(); char left;// = getchar(); cin >> left; int num; scanf("%d", &num); while(num--) { getchar(); int x; char c; cin >> c >> x; m++; road[m].left = left - 'A' + 1; road[m].right = c - 'A' + 1; road[m].cost = x; } } int ans=kruskal(); printf("%d\n", ans); } return 0; }
相关文章推荐
- Android WindowManager窗口类型
- Android学习之手电筒程序(兼容6.0系统)
- NO ACTION RESTRICT
- 免费电子面单接口-Java接入
- ubuntu下安装配置部署zabbix3.0――基于docker
- Python 实战之列表(list)实战详解
- dynatrace purepath数据转换到数据库
- L1-030. 一帮一
- 字符串匹配的KMP算法
- SQL Server中的事物
- linux 下安装php Apache mysql
- 精析AngularJS(一)
- UVa 11624 Fire! ( BFS )
- 2016/07/29
- java图像处理--形态学填充处理imfill
- Base64 Encode 1x1px透明GIF图片
- ContentProvider 和ContentResolver内容提供者和内容解析者
- mysql list 遍历
- 如何下载旧版本的Java
- mysql缓存