zoj_1406 Jungle Roads

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=406

 

//C++代码
#include<iostream>
#include<queue>
using namespace std;

struct Edge{
	int u,v,w;
	bool operator <(const Edge a) const{
		return w>a.w;
	}
}edge;

int n,s[30];
priority_queue<Edge> pq;

void Union(int x,int y){
	s[y]=x;
}

int Find(int x){
	if(s[x]<0) return x;
	return s[x]=Find(s[x]);
}

void Kruskal(){
	int sum=0,num=0,i;
	for(i=1;i<=n;i++) s[i]=-1;
	while(num<n-1 && !pq.empty()){
		edge=pq.top();
		pq.pop();
		if(Find(edge.u)!=Find(edge.v)){
			Union(Find(edge.u),Find(edge.v));
			sum+=edge.w;
			num++;
		}
	}
	cout<<sum<<endl;
}

int main(){
	while(cin>>n,n){
		int m,u,v,w,i,j;
		char a,b;
		for(i=1;i<n;i++){
			cin>>a>>m;
			u=a-'A'+1;
			for(j=1;j<=m;j++){
				cin>>b>>w;
				v=b-'A'+1;
				edge.u=u;
				edge.v=v;
				edge.w=w;
				pq.push(edge);
			}
		}
		Kruskal();
		while(!pq.empty()) pq.pop();
	}
	return 0;
}