hdu 1301 Jungle Roads （最小生成树）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1301

思路：

题目看起来极其吓人= =！其实就是一个裸的最小生成树，把字母对应数字就可以了。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<vector>
#include<time.h>
#include<queue>
#include<map>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<memory.h>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff                                          //INT_MAX
#define inf 0x3f3f3f3f                                          //int??????????????????
#define FOR(i,a) for((i)=0;i<(a);(i)++)                          //[i,a);
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define LL __int64
const double PI = acos(-1.0);
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> inline T Min(T a, T b) { return a < b ? a : b; }
template<class T> inline T Max(T a, T b) { return a > b ? a : b; }
using namespace std;
template<class T>
T Mint(T a, T b, T c) {
    if (a>b) {
        if (c>b)
            return b;
        return c;
    }
    if (c>a)
        return a;
    return c;
}
template<class T>
T Maxt(T a, T b, T c) {
    if (a>b) {
        if (c>a)
            return c;
        return a;
    }
    else if (c > b)
        return c;
    return b;
}

const int maxn=1005;
int T,n,m;
int a,b,c;
char ch1,ch2;
int f[maxn],r[maxn];

struct kruskal{
    int a,b;
    int v;
}q[maxn];

bool cmp(kruskal a,kruskal b){
    return a.v<b.v;
}

void Make_Set(int x){
    f[x]=x;
    r[x]=1;
}

int findfather(int x){
    return x==f[x]?x:findfather(f[x]);
}

bool Union(int a,int b){
    a=findfather(a);
    b=findfather(b);
    if(a==b)
        return false;
    else{
        if(r[a]>r[b]){
            f[b]=a;
            r[a]+=r[b];
        }
        else{
            f[a]=b;
            r[b]+=r[a];
        }
    }
    return true;
}

int main() {
#ifndef ONLINE_JUDGE
    freopen("test.in","r",stdin);
    freopen("test.out","w",stdout);
#endif
    while(~sf(n)&&n){
        for1(i,60,100){
            Make_Set(i);
        }
        getchar();
        n--;
        int num=0;
        while(n--){
            scanf("%c%d",&ch1,&a);
            getchar();
            for1(i,0,a){
                scanf("%c%d",&ch2,&b);
                getchar();
                q[num].a=ch1;
                q[num].b=ch2;
                q[num].v=b;
                num++;
            }
        }
        sort(q,q+num,cmp);
        int ans=0;
        for1(i,0,num){
            if(Union(q[i].a,q[i].b)){
                ans+=q[i].v;
            }
        }
        pf(ans);
    }
    return 0;
}