训练4 习题6
来源:互联网 发布:linux如何测试丢包率 编辑:程序博客网 时间:2024/06/05 16:02
题目:
Problem Description
<center><img src=/data/images/1301-1.gif></center><br>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. <br><br>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. <br><br>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. <br>
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
思路:最小生成树问题,我用的是Kruscal算法。(prim算法,还不太会用)
代码:
#include<iostream>
#include<cstring>#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int father[9];
struct city
{
int u;
int v;
int w;
}map[80];
bool cmp(city c1,city c2)
{
return c1.w < c2.w;
}
int find(int x)//寻找父亲节点
{
if(x != father[x])
{
father[x] = find(father[x]);
}
return father[x];
}
int main()
{
int n;
while(cin>>n)
{
if(n==0)
break;
for(int i=0;i<27;i++)//初始化每个集合
{
father[i] = i;
}
int k = 0;
for(int i = 0;i<n-1;++i)
{
char str[3];
int m;
cin>>str>>m;
for(int j=0;j<m;++j,++k)
{
char str2[3];
int t;
cin>>str2>>t;
map[k].u = (str[0] - 'A');
map[k].v = (str2[0] - 'A');
map[k].w = t;
}
}
sort(map,map+k,cmp);
int ans = 0;
for(int i =0;i<k;++i)
{
int x = find(map[i].u);
int y = find(map[i].v);
if(x!=y)
{
ans = ans + map[i].w;
father[x] = y;
}
}
cout<<ans<<endl;
}
return 0;
}
0 0
- 训练4 习题6
- 训练4 习题4
- 训练3 习题6
- 训练4 习题8
- 训练4 习题18
- 训练4 习题9
- 训练4 习题23
- 训练4 习题2
- 训练4 习题1
- 逻辑思维训练习题
- mysql复习 习题训练
- 训练2 习题2
- 训练3 习题10
- 训练3 习题13
- 训练3 习题15
- 训练3 习题1
- 训练3 习题14
- 训练3 习题5
- Qt学习笔记2
- 跟我学Android之六 布局
- javascript基本知識-w3Schools-2
- Linux字符设备驱动中container_of宏的作用
- Spring Security(15)——权限鉴定结构
- 训练4 习题6
- Spring Security(16)——基于表达式的权限控制
- CNN笔记:通俗理解卷积神经网络
- 自动登录的一种简单实现
- 相关SpringSecurity对于部分菜单隐藏的相关代码
- 毕业两年了
- CAMediaTiming 控制动画时间
- Matlab资料收纳
- 数字游戏