Jungle Roads（九度 OJ1154 )

Jungle Roads（九度 OJ1154 )

时间限制：1 秒 内存限制：32 兆 特殊判题：否

1.题目描述：

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.
示例1
输入
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
输出
216
30

2.基本思路

该题属于最小生成树问题，采用Kruskal算法结合并查集的思想进行求解。其中需要注意字符的输入，采用scanf("%c",&c);会把回车当做一个输入字符，因为回车符也会放在缓冲区中，而其直接向缓冲区中取下一个字符，所以这里推荐采用cin作为输入的方式，避免由于细节问题导致问题结果出错。

3.代码实现

#include <iostream>
#include <algorithm>
#include <map>
#define N 27
using namespace std;

map<char,int>alp2dig;
int Tree[N];

int findRoot(int x){
    if(Tree[x]==-1)return x;
    else{
        int tmp = findRoot(Tree[x]);
        Tree[x]=tmp;
        return tmp;
    }
}

struct Edge{
    int node1;
    int node2;
    int cost;
}buf[N*(N-1)/2];

bool cmp(Edge e1,Edge e2){
    return e1.cost<e2.cost;

}

int main()
{
    alp2dig['A']=1,alp2dig['B']=2,alp2dig['C']=3,alp2dig['D']=4,alp2dig['E']=5,alp2dig['F']=6;
    alp2dig['G']=7,alp2dig['H']=8,alp2dig['I']=9,alp2dig['J']=10,alp2dig['K']=11,alp2dig['L']=12;
    alp2dig['M']=13,alp2dig['N']=14,alp2dig['O']=15,alp2dig['P']=16,alp2dig['Q']=17,alp2dig['R']=18;
    alp2dig['S']=19,alp2dig['T']=20,alp2dig['U']=21,alp2dig['V']=22,alp2dig['W']=23,alp2dig['X']=24;
    alp2dig['Y']=25,alp2dig['Z']=26;
    int n;
    char startCity,endCity;
    int numConnect,length;
    while(~scanf("%d",&n)){
        if(n==0)
            break;

        for(int i=1;i<=n;i++)
            Tree[i]=-1;

        int cnt=0;

        for(int i=1;i<n;i++){
            cin>>startCity>>numConnect;//以后涉及到字符的输入还是采用cin把，scanf总有一堆蜜汁BUG
            for(int i=1;i<=numConnect;i++){
                cin>>endCity>>length;
                buf[cnt].node1=alp2dig[startCity];
                buf[cnt].node2=alp2dig[endCity];
                buf[cnt].cost=length;
                cnt++;
            }
        }
        sort(buf,buf+cnt,cmp);
        int ans=0;
        for(int i=0;i<cnt;i++){
            int a = findRoot(buf[i].node1);
            int b = findRoot(buf[i].node2);
            if(a!=b){
                Tree[a]=b;
                ans+=buf[i].cost;
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}
/*
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
*/