HDU1301 Jungle Roads(Kruskal)

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

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

题意：输入n,代表景点数，接下来n-1行,每一行第一的字母代表景点，后面的数字代表与它相连的景点数，后面有n对字母与数字，代表与该景点相连的景点及距离。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 #define N 100

 int ptr[N];//父亲数组
 int num,n;
 struct vallage
 {
     int start,to,weight;
 };
 struct vallage v[N];

 void init()
 {
     int i;
     for (i=;i<N;i++)
     {
         ptr[i]=i;
     }
 }

 bool cmp(vallage a,vallage b)
 {
     if (a.weight<b.weight)
     {
         return true;
     }
     return false;
 }

 int find(int x)
 {
     return ptr[x]==x?x:ptr[x]=find(ptr[x]);
 }

 void solve()
 {
     int x,y,i,intree=,ans=;

     sort(v,v+num,cmp);
 //    for (i=0;i<num;i++)
 //    {
 //        printf("%d  %d  %d\n",v[i].start,v[i].to,v[i].weight);
 //    }

     for (i=;i<num;i++)
     {
         x=find(v[i].start);//找父亲
         y=find(v[i].to);

         if (x!=y)
         {
             ans=ans+v[i].weight;
             ptr[x]=y;
             intree++;

             if (intree==n-)//以加入最小数边数
             {
                 break;
             }
         }
     }

     printf("%d\n",ans);
 }

 int main()
 {
     int i,net,j,weight;//net为邻接边数，weight为权
     char start,to;//start为出点，to出点

     while (scanf("%d",&n)&&n)
     {
         if (n==)
         {
             return ;
         }

         num=;
         init();
         for (i=;i<n-;i++)
         {
             cin>>start>>net;

             for (j=;j<net;j++)
             {
                 cin>>to>>weight;
                 v[num].start=start-'A';
                 v[num].to=to-'A';
                 v[num++].weight=weight;
             }
         }

         solve();
     }

     return ;
 }