Jungle Roads

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

Problem 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.

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.

 
Sample Input
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
 
Sample Output
216
30
 
Source

最小生成树   ,解法一 普利姆算法...

做了这么多不妨做一个总结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的更多相关文章

  1. POJ 1251 && HDU 1301 Jungle Roads (最小生成树)

    Jungle Roads 题目链接: http://acm.hust.edu.cn/vjudge/contest/124434#problem/A http://acm.hust.edu.cn/vju ...

  2. hdu 1301 Jungle Roads 最小生成树

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1301 The Head Elder of the tropical island of Lagrish ...

  3. 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 ...

  4. POJ 1251 & HDU 1301 Jungle Roads

    题目: Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign ...

  5. HDOJ 1301 Jungle Roads

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1301 //HDOJ1301 #include<iostream>#include<c ...

  6. hdu 1301 Jungle Roads

    http://acm.hdu.edu.cn/showproblem.php?pid=1301 #include <cstdio> #include <cstring> #inc ...

  7. Hdu 1301 Jungle Roads (最小生成树)

    地址:http://acm.hdu.edu.cn/showproblem.php?pid=1301 很明显,这是一道“赤裸裸”的最小生成树的问题: 我这里采用了Kruskal算法,当然用Prim算法也 ...

  8. HDU 1301 Jungle Roads (最小生成树,基础题,模版解释)——同 poj 1251 Jungle Roads

    双向边,基础题,最小生成树   题目 同题目     #define _CRT_SECURE_NO_WARNINGS #include <stdio.h> #include<stri ...

  9. POJ 1251 + HDU 1301 Jungle Roads 【最小生成树】

    题解 这是一道裸的最小生成树题,拿来练手,题目就不放了 个人理解  Prim有些类似最短路和贪心,不断找距当前点最小距离的点 Kruskal类似于并查集,不断找最小的边,如果不是一棵树的节点就合并为一 ...

  10. 最小生成树 || HDU 1301 Jungle Roads

    裸的最小生成树 输入很蓝瘦 **并查集 int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); } 找到x在并查集里的根结点,如果 ...

随机推荐

  1. 《Windows核心编程》第七章——进程优先级实验

    其实就是做个实验,看看SetPriorityClass是否真的会生效. 设计思路:主线程一直在进行某种操作(这里是写文件操作),以保证有一定的CPU占用率:生成的子线程来接收你的命令,决定将进程改变为 ...

  2. [Android] repo 下载Android源码(国内镜像)

    reference : http://blog.csdn.net/shenlan18446744/article/details/51490560 repo 下载Android源码(国内镜像) 下载r ...

  3. RTC设备驱动

    问题:pcf8563 RTC设备驱动不能被正常的加载!问题分析过程. 问题在下午得到解决,虽然解决的办法比较笨,采用的是不断的使用printk来跟踪rtc-8563驱动的加载的过程,以及iic模块的工 ...

  4. 混沌数学之Rössler(若斯叻)吸引子

    若斯叻吸引子(Rössler attractor)是一组三元非线性微分方程: frac{dx(t)}{dt} = -y(t)-z(t) frac{dy(t)}{dt} = x(t)+a*y(t) fr ...

  5. Reverse Nodes in k-Group leetcode java

    题目: Given a linked list, reverse the nodes of a linked list k at a time and return its modified list ...

  6. 实现iframe窗口高度自适应的又一个巧妙思路

    domainA 中有一个页面index.html,通过iframe嵌套了domainB中的一个页面other.html由于other.html页面在iframe中显示,而且其页面内容会动态的增加或减少 ...

  7. IOS之导航控制器传值

    UITableView有两种风格:UITableViewStylePlain和UITableViewStyleGrouped.这两者操作起来其实并没有本质区别,只是后者按分组样式显示前者按照普通样式显 ...

  8. 【SpringCloud】Netflix源码解析之Ribbon:负载均衡策略的定义和实现

    Ribbon负载均衡策略定义 IRule其实就只做了一件事情Server choose(Object key),可以看到这个功能是在LB中定义(要求)的,LB把这个功能委托给IRule来实现.不同的I ...

  9. WPF 处理路由事件

    (1)img.MouseUp+= img_MouseUp;(2)调用 UIElement.AddHandler()直接连接事件:img.AddHandler(Image.MouseUpEvent, n ...

  10. socket bind 随机端口

    https://www.cprogramming.com/code_blocks/ 这个地址可以下载c, c++的编译器,在windows下可以用的 IDE. bind到端口0上,系统就会自动分配,但 ...