PAT A1114

难度不大，就是过于繁琐

#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn = 10000;
int n, father[maxn];
struct node{
	double mest, area;
}Node[maxn];
struct family{
	int id, m;
	double avgs, avg;
};
vector<family> v;
bool isRoot[maxn] = {false};
bool cmp(family a, family b) {
	if(a.avg != b.avg) return a.avg > b.avg;
	return a.id < b.id;
}
set<int> s, root;
int findFather(int x) {
	int a = x;
	while(x != father[x]) x = father[x];
	while(a != father[a]) {
		int z = a;
		a = father[a];
		father[z] = x;
	}
	return x;
}
void Union(int a, int b) {
	int faA = findFather(a);
	int faB = findFather(b);
	if(faA != faB) {
		father[faA] = faB;
	}
}
int	setCnt() {
	int ans = 0;
	for(auto it : s)
		isRoot[findFather(it)] = true;
	for(auto it : s)
		if(isRoot[it]) {
			ans += isRoot[it];
			root.insert(it);
		}
	return ans;
}

int main() {
	cin >> n;
	for(int i = 0; i < maxn; i++) father[i] = i;
	for(int i = 0; i < n; i++) {
		int id, father, mother, k, child, estate, area;
		cin >> id >> father >> mother >> k;
		s.insert(id);
		if(father != -1) {
			Union(id, father);
			s.insert(father);
		}
		if(mother != -1) {
			Union(id, mother);
			s.insert(mother);
		}
		for(int j = 0; j < k; j++) {
			cin >> child;
			s.insert(child);
			Union(id, child);
		}
		cin >> estate >> area;
		Node[id].mest = estate;
		Node[id].area = area;
	}
	cout << setCnt() << endl;
	for(auto it : root) {
		int ans = 1, minId = it;
		double avg1 = 0, avg2 = 0;
		if(Node[it].mest) avg1 += Node[it].mest;
		if(Node[it].area) avg2 += Node[it].area;
		for(auto it2 : s) {
			if(it2 != it && findFather(it2) == it) {
				if(Node[it2].mest) avg1 += Node[it2].mest;
				if(Node[it2].area) avg2 += Node[it2].area;
				ans++;
				if(it2 < minId) minId = it2;
			}
		}
		avg1 = avg1 / ans;
		avg2 = avg2 / ans;
		v.push_back({minId, ans, avg1, avg2});
	}
	sort(v.begin(), v.end(), cmp);
	for(auto it : v)
		printf("%04d %d %.3f %.3f\n", it.id, it.m, it.avgs, it.avg);
	return 0;
}