HDUOJ----1301 Jungle Roads
Jungle Roads
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3968 Accepted Submission(s): 2888

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.
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
A 2 B 10 C 40
B 1 C 20
0
30
最小生成树 ,解法一 普利姆算法...
做了这么多不妨做一个总结ba 。 关于普利姆算法
普利姆一般用于连续的点...(密集型的结构图)。
通过这个p大家可能会看的比较明白....
比如 第二个样列
3
A 2 B 10 C 40
B 1 C 20 a-->(b-->c ,c) 对于这样一个图,随机从一点出发... 米前景一步变求一次最小,,,
于是 觉得用代码更有说服力。。。毕竟要说明白也很花时间,.
代码:
// test 1 prim
//< @ Gxjun coder>
#include<stdio.h>
#include<string.h>
const int inf=0x3f3f3f3f ;
int vis[],lowc[];
int prim( const int cost[][], int n)
{
int i,j,p;
memset(vis,,sizeof(vis));
vis[]=;
int minc,res=;
for(i=; i<n ;i++)
lowc[i]=cost[][i];
for(i=;i<n;i++)
{
minc=inf;
p=-;
for( j=; j<n; j++)
{
if(==vis[j] && minc>lowc[j])
{
minc = lowc[j];
p=j;
}
}
if(minc==inf) return -;
res+=minc;
vis[p]=;
for(j= ; j<n ;j++)
{
if(vis[j]== && lowc[j]>cost[p][j])
lowc[j]=cost[p][j];
} }
return res;
}
int sta[][];
int main()
{
int n,m,i,j;
char a[],b[];
int val;
while(scanf("%d",&n),n)
{
for(i= ;i<; i++)
{
for( j=; j< ;j++)
{
sta[i][j]=inf;
}
}
for(i=; i<n; i++)
{ scanf("%s %d",a,&m);
int fo=a[]-'A';
while(m--)
{
scanf("%s %d",b, &val);
int tot=b[]-'A';
sta[fo][tot]=sta[tot][fo]=val;
}
} printf("%d\n",prim(sta,n));
}
return ;
}
方法二: 克鲁斯卡尔算法(krusal)
运用并查集进行联通分量的查找,逐步口大连通分量.....
详细代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct Side
{
int vs,ve; //<vs--->表示开始的位置,ve-->代表结束的位置>
int len ; // <边的长度>
}side;
side sta[]; //最多50个节点
//<用到并查集来A>
int father[];
/*初始化*/
void mset()
{
for(int i=; i< ;i++)
father[i]=i;
}
//<查找>
int setfind(int x)
{
if(x!=father[x])
father[x]=setfind(father[x]);
return father[x];
}
// <合并>即克鲁斯卡尔算法
void krusal( int sx ,int sy)
{
int x=setfind(sx);
int y=setfind(sy);
if(x==y) return ;
if(x<y)
father[y]=x;
else
father[x]=y; }
int cmp(const void* a ,const void* b )
{
return (*(side *)a).len-(*(side*)b).len;
} int main( void )
{
int n,m,tol,val,i,ans;
char a[],b[];
while(scanf("%d",&n),n)
{
ans=tol=;
for(i=; i<n ;i++)
{
scanf("%s%d",a,&m);
while(m--)
{
scanf("%s%d",b, &val);
sta[tol].vs=a[]-;
sta[tol].ve=b[]-;
sta[tol].len=val;
tol++;
}
}
mset();
qsort(sta,tol ,sizeof(sta[]),cmp);
for(i= ; i<tol ;i++)
{
int tem1=setfind(sta[i].vs);
int tem2=setfind( sta[i].ve ) ;
if(tem1 != tem2) //如果两个两桶分量不在一起,那就链接起来
{
krusal(tem1,tem2);
ans+=sta[i].len;
}
}
printf("%d\n",ans);
}
return ;
}
HDUOJ----1301 Jungle Roads的更多相关文章
- POJ 1251 && HDU 1301 Jungle Roads (最小生成树)
Jungle Roads 题目链接: http://acm.hust.edu.cn/vjudge/contest/124434#problem/A http://acm.hust.edu.cn/vju ...
- hdu 1301 Jungle Roads 最小生成树
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1301 The Head Elder of the tropical island of Lagrish ...
- hdu 1301 Jungle Roads krusckal,最小生成树,并查集
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was s ...
- POJ 1251 & HDU 1301 Jungle Roads
题目: Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign ...
- HDOJ 1301 Jungle Roads
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1301 //HDOJ1301 #include<iostream>#include<c ...
- hdu 1301 Jungle Roads
http://acm.hdu.edu.cn/showproblem.php?pid=1301 #include <cstdio> #include <cstring> #inc ...
- Hdu 1301 Jungle Roads (最小生成树)
地址:http://acm.hdu.edu.cn/showproblem.php?pid=1301 很明显,这是一道“赤裸裸”的最小生成树的问题: 我这里采用了Kruskal算法,当然用Prim算法也 ...
- HDU 1301 Jungle Roads (最小生成树,基础题,模版解释)——同 poj 1251 Jungle Roads
双向边,基础题,最小生成树 题目 同题目 #define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include<stri ...
- POJ 1251 + HDU 1301 Jungle Roads 【最小生成树】
题解 这是一道裸的最小生成树题,拿来练手,题目就不放了 个人理解 Prim有些类似最短路和贪心,不断找距当前点最小距离的点 Kruskal类似于并查集,不断找最小的边,如果不是一棵树的节点就合并为一 ...
- 最小生成树 || HDU 1301 Jungle Roads
裸的最小生成树 输入很蓝瘦 **并查集 int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } 找到x在并查集里的根结点,如果 ...
随机推荐
- cout的输出格式初探3
#include <iostream> #include <iomanip> using namespace std; int main() { double f=2.0/3. ...
- Intel® Core™ i5-5300U Processor
3M Cache, up to 2.90 GHz Specifications Ordering and Compliance Essentials Product Collection 5t ...
- 6 cocos2dx粒子效果,类图关系,系统原生粒子和自己定义粒子效果,粒子编译器软件,爆炸粒子效果,烟花效果,火焰效果,流星效果,漩涡粒子效果,雪花效果,烟雾效果,太阳效果,下雨效果
1 粒子 演示样例 2 类图关系 3 系统原生粒子 CCParticleSystem 全部粒子系统的父类 CCParticleSystemPoint. CCParticleSystemQuad ...
- C语言:字符串读取流读取文件中的数据
#include<stdio.h> int main() { //定义文件指针 FILE *f = NULL; //打开文件 f = fopen("1.txt",&qu ...
- css美化、优化、合并工具推荐
其实很多时候,我们写完css规则之后,我们思考的无非就是3件事情: 验证 美化 压缩 当然无论是我们自己做这样的工具还是寻找一些比较好的成熟的工具,都有几个期望: 是否支持一些ie下的hack方式: ...
- JS 中数组字符串索引和数值索引研究
先来看一个问题: var array = []; array["a"] = "hello"; array["b"] = "worl ...
- scala里的模式匹配和Case Class
模式匹配的简介 scala语言里的模式匹配可以看作是java语言中switch语句的改进. 模式匹配的类型 包括:常量模式.变量模式.构造器模式.序列模式.元组模式以及变量绑定模式等. 常量模式匹配 ...
- ListView 设置列对齐方式
<ListView.Resources> <Style TargetType="ListViewItem"> <Setter Property=&qu ...
- Systemd 三部曲 之 PHP7
安装编译php7时需要的依赖包 : yum -y install libxml2 libxml2-devel openssl openssl-devel curl-devel libjpeg-deve ...
- ASP 未结束的字符串常量
之前的电脑是XP的,前段时间公司将电脑升级到了Windows7 今天在处理一个asp项目时发现打开就报错了"未结束的字符串常量" 在网络上了解到是因为编码的问题,但我的项目文件都是 ...