zoj 1406 Jungle Roads poj 1251

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXN 30
#define MAXM 1000
using namespace std;

struct edge
{
    int u,v,w;
}edges[MAXM];
int parent[MAXN];
int N,m;
int i,j;
int sumweight;
void UFset()
{
    for(i=1;i<=N;i++)
    {
        parent[i]=-1;
    }
}
int Find(int x)
{
    int s;
    for(s=x;parent[s]>=0;s=parent[s]);
    while(s!=x)
    {
        int tmp=parent[x];
        parent[x]=s;
        x=tmp;
    }
    return s;
}
void Union (int R1,int R2)
{
    int r1=Find(R1);
    int r2=Find(R2);
    int tmp=parent[r1]+parent[r2];
    if(r1<r2)
    {
        parent[r2]=r1;
        parent[r1]=tmp;
    }
    else
    {
        parent[r1]=r2;
        parent[r2]=tmp;
    }
}
int cmp(const void *a,const void *b)
{
    edge aa=*(const edge *)a;
    edge bb=*(const edge *)b;
    if(aa.w>bb.w)
    return 1;
    else return -1;
}
void Kruskal()
{
    int num=0;
    int u,v;
    UFset();
    for(i=0; i<m; i++)
    {
        u=edges[i].u;
        v=edges[i].v;
        if(Find(u)!=Find(v))
        {
            sumweight+=edges[i].w;
            num++;
            Union(u,v);
        }
        if(num>=N-1)
        break;
    }
}
int main()
{
    while(1)
    {
        char c,cc;
        scanf("%d",&N);
        if(N==0)break;
        int mi=0;//±ßµÄÐòºÅ
        int numm;
        for(i=0; i<N-1; i++)
        {
            getchar();
            scanf("%c",&c);
            scanf("%d",&numm);
            for(j=0;j<numm;j++)
            {
                getchar();
                scanf("%c %d",&cc,&edges[mi].w);
                edges[mi].u=c-'A'+1;
                edges[mi].v=cc-'A'+1;
                //printf("%d %d\n",edges[mi].u,edges[mi].v);
                mi++;
            }
        }
        m=mi;
        qsort(edges,m,sizeof(edges[0]),cmp);
        sumweight=0;
        Kruskal();
        printf("%d\n",sumweight);
    }
    return 0;
}