题意:给你N个点,然后有N-1行,每行先输入起点,然后输入和他有边(即可以直接到达)的点有k个,然后输入这k个点的和到他们的花费。问使这些这些点都连通的最小花费是多少?
思路:最小生成树。注意输入的时候要把换行和空格给处理掉,然后把边去起来求最小生成树就可以。
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 1005;
int n, m, f[MAXN];
struct Edge
{
int u, v, w;
bool operator < (const Edge& A) const
{
return w < A.w;
}
}edge[MAXN];
void init()
{
for (int i = 0; i <= n; i++) f[i] = i;
}
int Find(int x){ return f[x] == x ? x : f[x] = Find(f[x]); }
int kruskal()
{
int ans = 0, cnt = 0;
init();
sort(edge, edge + m);
for (int i = 0; i < m; i++)
{
int u = edge[i].u, v = edge[i].v, w = edge[i].w;
int root1 = Find(u), root2 = Find(v);
if (root1 != root2)
{
f[root1] = root2;
ans += w;
cnt++;
if (cnt == n - 1) break;
}
}
return ans;
}
int main()
{
while (~scanf("%d", &n) && n)
{
m = 0;
for (int i = 1; i < n; i++)
{
char u, v;
int w, k;
scanf(" %c %d", &u, &k);
while (k--)
{
scanf(" %c %d", &v, &w);
edge[m].u = u - 'A'; edge[m].v = v - 'A'; edge[m].w = w;
m++;
}
}
printf("%d\n", kruskal());
}
return 0;
}
/*
9
A 2 B 12 I 25
B 3 C 10 H 40 I 8
C 2 D 18 G 55
D 1 E 44
E 2 F 60 G 38
F 0
G 1 H 35
H 1 I 35
3
A 2 B 10 C 40
B 1 C 20
0
*/