poj1251 Jungle Roads

MST的水题，只是输入极其恶心和猥琐。

#include<iostream>#include<cstdlib>using namespace std;struct Edge{int a,b,weight;};Edge r[80];int set[27];int cmp(const void *p,const void *q){return ((Edge *)p)->weight - ((Edge *)q)->weight;}int find(int x){int r,i,j;r=x;while(set[r]!=r)r=set[r];i=x;while(i!=x){j=set[i];set[i]=r;i=j;}return r;}void merge(int a,int b){if(a<b)set[b]=a;elseset[a]=b;}int kruskal(int n,int m){int weight=0,i,j,k;for(i=0;i<n;i++)set[i]=i;qsort(r,m,sizeof(r[0]),cmp);for(i=0;i<m;i++){j=find(r[i].a);k=find(r[i].b);if(j!=k){weight+=r[i].weight;merge(j,k);}}return weight;}int main(){int n,k,m,i,j,cost;char st;while(scanf("%d",&n),n){m=0;getchar();for(i=0;i<n-1;i++){getchar();getchar();scanf("%d",&k);if(k>0)getchar();for(j=0;j<k;j++){scanf("%c%d",&st,&cost);r[m].a=i;r[m].b=st-'A';r[m].weight=cost;m++;if(j<=k-2)getchar();}getchar();}printf("%d/n",kruskal(n,m));}return 0;}