1251 Jungle Roads

原创 2007年10月15日 08:27:00
Jungle Roads
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 1365   Accepted: 707

Description

 

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

 

Sample Output

 

Source
Mid-Central USA 2002

 **********************************************************************************************

*************************************************************************************************

Source Code
#include <stdio.h>
#include <iostream.h>

#define MaxWeight 9999

void Prim(int r[][28],int n)
{
int *lowCost =new int [n+1];
int i,j,k;

int minCost;
for(i=2;i<=n;i++)
   lowCost[i]=r[1][i];
int cost=0;

lowCost[1]=-1;

for(i=2;i<=n;i++)
{
   minCost=MaxWeight;
   for(j=2;j<=n;j++)
   {
    if(lowCost[j]<minCost && lowCost[j] >0)
    {
     minCost=lowCost[j];
     k=j;
    }
   }

   cost += minCost;
   lowCost[k]=-1;

   for(j=2;j<=n;j++)
   {
    if(r[k][j]<lowCost[j])
     lowCost[j]=r[k][j];
   }
}
printf("%d/n",cost);

}
int   main()
{
int villagesnum;
int Tree[28][28];
int i,j,m,n;

char ch[28][1];
int cost=0;
while(cin>>villagesnum)
{
    i=1;
   if(villagesnum==0)
    break;
       for(m=1;m<=villagesnum;m++)
         for(n=1;n<=villagesnum;n++)
       if(m==n)
        Tree[m][n]=0;
       else
       Tree[m][n]=MaxWeight;

   int N;
   while( i<=villagesnum-1 )
   {
    cin>>ch[i][1];
    cin>>N;
    if(N==0)
    {
     i++;
     continue;
    }

    int k;
       j=1;
    while(j<=N)
    {
     char c;
     int weight;
        cin>>c;
     cin>>weight;
                 k= c-'A'+1;
     Tree[k][i] = Tree[i][k]=weight;
     j++;
    }
       i++;
   }

     Prim(Tree,villagesnum);

}
return 0;
}
216
30
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

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.

ZOJ 1406 POJ 1251 Jungle Roads 丛林中的道路,最小生成树,Kruskal算法

纯求最小生成树,注意输入的处理。
  • u011439796
  • u011439796
  • 2014年09月19日 01:00
  • 1009

Jungle Roads(最小生成树)

题目 The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid mon...
  • zinss26914
  • zinss26914
  • 2013年04月13日 19:03
  • 1524

构筑极致用户体验-ROADs

通信世界网消息(CWW) 信息时代发展到今天,物理世界和数字世界正在加速融合,人类社会正发生着剧烈的改变,人类的情感、财富、知识、历史……正在加速从线下转移到线上,以“0101”的形式被发送、传送、接...
  • holandstone
  • holandstone
  • 2015年10月29日 12:40
  • 2456

POJ - 1251 Jungle Roads(最小生成树简单题)

Jungle Roads Time Limit: 1000MS   Memory Limit: 10000KB   64bit IO Format: %I64d & %I64u Sub...
  • qq_18738333
  • qq_18738333
  • 2015年09月10日 16:50
  • 389

poj 1251 Jungle Roads(最小生成树kruscal+!学长秘授究极无敌新版结构体排序)

类似求城市之间的边权和最小的题目。 最小生成树模板题,。
  • u013508213
  • u013508213
  • 2014年04月28日 12:37
  • 394

POJ 1251 Jungle Roads(Kruskal)

题目链接: [[kuangbin带你飞]专题六 最小生成树 A - Jungle Roads(http://acm.hust.edu.cn/vjudge/contest/view.action?ci...
  • Dextrad_ihacker
  • Dextrad_ihacker
  • 2016年01月22日 14:58
  • 243

用Kruskal算法解POJ 1251 Jungle Roads代码

#include #include using namespace std; struct road{ int x,y,price; //price表示连接 x,y村庄的公路维修费用...
  • zhm2016_hhh
  • zhm2016_hhh
  • 2016年01月23日 13:24
  • 73

POJ - 1251----Jungle Roads(prim)

The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was s...
  • m765885195t
  • m765885195t
  • 2017年02月15日 22:08
  • 134

POJ--1251 Jungle Roads

Jungle Roads Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 22617   ...
  • Rollchuchy
  • Rollchuchy
  • 2016年02月23日 23:52
  • 179

Jungle Roads 【poj-1251】 【最小生成树】

Jungle Roads Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 27354   ...
  • DNMTOOBA
  • DNMTOOBA
  • 2017年08月03日 17:14
  • 94
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1251 Jungle Roads
举报原因:
原因补充:

(最多只允许输入30个字)