PAT甲级题解A1114 Family Property (25分)

PAT甲级题解
A1114 Family Property (25分)

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
using namespace std;
const int eps = 1e-7;//double类型比较，这题貌似不用。
const int MAXN = 10010;
int fa[MAXN], sets[MAXN] = { 0 }, area[MAXN] = { 0 };
struct node {
	int id, cnt;
	double set, area;
};
bool cmp(node a, node b) {
	return a.area != b.area ? a.area > b.area : a.id < b.id;
}
int findFather(int x) {
	while (x != fa[x])
		x = fa[x];
	return x;
}
void Union(int a, int b) {
	int faA = findFather(a);
	int faB = findFather(b);
	if (faA != faB) {
		faA < faB ? fa[faB] = faA : fa[faA] = faB;
	}
}
int main()
{
	int n;
	scanf("%d", &n);
	for (int i = 0; i < MAXN; i++)fa[i] = i;
	for (int i = 0; i < n; i++) {
		int id, fid, mid, k, m, a;
		vector<int> v;
		scanf("%d %d %d %d", &id, &fid, &mid, &k);
		v.push_back(id);
		if (fid != -1) v.push_back(fid);
		if (mid != -1) v.push_back(mid);
		for (int i = 0; i < k; i++) {
			int temp;
			scanf("%d", &temp);
			v.push_back(temp);
		}
		scanf("%d %d", &m, &a);
		sets[id] = m;
		area[id] = a;
		for (int j = 1; j < v.size(); j++) {
			Union(v[0], v[j]);
		}
	}
	map<int, int> smap, amap, fmap;
	for (int i = 0; i < MAXN; i++) {
		int f = findFather(i);
		if (sets[i] != 0 && area[i] != 0) {
			smap[f] += sets[i];
			amap[f] += area[i];
		}
		if (fa[i] != i) {//father自身没计算，最后加一
			fmap[f]++;
		}
	}
	vector<node> ans;
	double avgs, avga;
	//遍历smap或amap，不能是fmap(fmap中没有只有一个人的家庭)
	for (auto it = smap.begin(); it != smap.end(); it++) {
		int cnt = fmap[it->first] + 1;//father自身没计算，加一
		avgs = double(it->second * 1.0 / cnt);
		avga = double(amap[it->first] * 1.0 / cnt);
		ans.push_back(node{ it->first, cnt, avgs, avga});
	}
	sort(ans.begin(), ans.end(), cmp);
	printf("%d\n", ans.size());
	for (int i = 0; i < ans.size(); i++) {
		printf("%04d %d %.3f %.3f\n", ans[i].id, ans[i].cnt, ans[i].set, ans[i].area);
	}
	return 0;
}