E - Jungle Roads

不念不忘少年蓝@ 2022-03-19 11:14 138阅读 0赞

### 题目描述： ###

![在这里插入图片描述][1301-1.gif]  
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.  
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  
Output  
216  
30

##### 题意： #####

又是一堆废话，这个题本质上还是求最小生成树。只不过，这个题的输入并不是直接的邻接矩阵了。  
这个题的输入：第一行输入n。接下来n-1行是每个顶点的基本情况。  
输入格式是：顶点 顶点边数 每一个边的基本情况。  
这个题的话同样需要注意的地方还是如何将输入的数据转化为邻接矩阵。在求最小生成树就可以了。这个题尤其需要注意一下getchar的使用。多个地方需要用到getchar。

#include"stdio.h"
    #include"string.h"
    #include"algorithm"
         using namespace std;
    #define INF 100000
    void MinSpanTree(int Graph[][27],int n)
    {
        int i,j,k;
        int sum=0;
        int vexs[27],weight[27];
        for(int i=0;i<n;i++)
        {
            vexs[i]=0;
            weight[i]=Graph[0][i];
        }
        for(i=0;i<n-1;i++)
        {
            int Min=INF;
            j=0;k=0;
            while(j<n)
            {
                if(weight[j]&&weight[j]<Min)
                {
                    k=j;
                    Min=weight[j];
                }
                j++;
            }
            weight[k]=0;
            sum+=Min;
            for(j=0;j<n;j++)
            {
                if(weight[j]&&weight[j]>Graph[k][j])
                {
                    weight[j]=Graph[k][j];
                    vexs[j]=k;
                }
            }
        }
     printf("%d\n",sum);
    }
    int main()
    {
        int n;
        int Graph[27][27];
        while(~scanf("%d",&n))
        {
            getchar();
            if(n==0)
                break;
            for(int i=0;i<n;i++)//对Graph初始化。
                for(int j=0;j<n;j++)
                   {
                       Graph[i][j]=INF;
                       if(i==j)
                          Graph[i][j]=0;
                   }
                   //边输入边转化。
            for(int i=0;i<n-1;i++)
            {
                int k;
                char c;
                scanf("%c%d",&c,&k);
                int x=c-'A',y;
                for(int j=0;j<k;j++)
                {
                    getchar();
                    scanf("%c%d",&c,&y);
                    int x1=c-'A';
                    Graph[x][x1]=y;
                    Graph[x1][x]=y;
                }
                getchar();//接受每一行最后一次输入的换行。 
            }
          MinSpanTree(Graph,n);
        }
    }

[1301-1.gif]: http://acm.hdu.edu.cn/data/images/1301-1.gif