POJ1251 Jungle Roads【最小生成树裸题——kruskal】

Jungle Roads

---

裸题不罗嗦

#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;

inline int read() {
   int s = 0, w = 1;
   char ch = getchar();
   while(ch < '0' || ch > '9'){if(ch == '-') w = -1; ch = getchar();}
   while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
   return s * w;
}

int n, cnt, fa[30];
struct edge{	int u, v, w;} e[100];
bool cmp(edge a, edge b) {	return a.w < b.w;}
int find(int x){	return fa[x] == x ? x : fa[x] = find(fa[x]);}

void kruskal() {
	int ans = 0;
	for(int i = 0; i < 30; i++) fa[i] = i;
	sort(e + 1, e + cnt, cmp);
	for(int i = 1; i < cnt; i++) {
		int a = find(e[i].u), b = find(e[i].v);
		if(a == b) continue;
		fa[a] = b;
		ans += e[i].w;
	}
	printf("%d\n", ans);
}

void run() {
	cnt = 1;
	for(int i = 1; i < n; i++) {
		char u;	int t;
		scanf(" %c%d", &u, &t);
		while(t--) {
			char v; int w;
			scanf(" %c%d", &v, &w);
			e[cnt].u = u - 'A', e[cnt].v = v - 'A', e[cnt++].w = w;
		}
	}
	kruskal();
}

int main() {
	while(~scanf("%d", &n) && n) run();
	return 0;
}