1114 Family Property (25分)

This time, you are supposed to help us collect the data for family-owned property. Given each person's family members, and the estate（房产）info under his/her own name, we need to know the size of each family, and the average area and number of sets of their real estate.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤1000). Then N lines follow, each gives the infomation of a person who owns estate in the format:

ID Father Mother k Child​1​​⋯Child​k​​ M​estate​​ Area

where ID is a unique 4-digit identification number for each person; Father and Mother are the ID's of this person's parents (if a parent has passed away, -1 will be given instead); k (0≤k≤5) is the number of children of this person; Child​i​​'s are the ID's of his/her children; M​estate​​ is the total number of sets of the real estate under his/her name; and Area is the total area of his/her estate.

Output Specification:

For each case, first print in a line the number of families (all the people that are related directly or indirectly are considered in the same family). Then output the family info in the format:

ID M AVG​sets​​ AVG​area​​

where ID is the smallest ID in the family; M is the total number of family members; AVG​sets​​ is the average number of sets of their real estate; and AVG​area​​ is the average area. The average numbers must be accurate up to 3 decimal places. The families must be given in descending order of their average areas, and in ascending order of the ID's if there is a tie.

Sample Input:

10
6666 5551 5552 1 7777 1 100
1234 5678 9012 1 0002 2 300
8888 -1 -1 0 1 1000
2468 0001 0004 1 2222 1 500
7777 6666 -1 0 2 300
3721 -1 -1 1 2333 2 150
9012 -1 -1 3 1236 1235 1234 1 100
1235 5678 9012 0 1 50
2222 1236 2468 2 6661 6662 1 300
2333 -1 3721 3 6661 6662 6663 1 100

Sample Output:

3
8888 1 1.000 1000.000
0001 15 0.600 100.000
5551 4 0.750 100.000

 

题解：

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

const int N = 10010;

int n;
int f[N], c[N], hc[N], ha[N];
bool st[N];
struct Edge
{
	int a, b;
}e[N];

struct Family
{
	int id, c, hc, ha;
};

int find(int x) {
	if (x != f[x])
		f[x] = find(f[x]);
	return f[x];
}

bool cmp(Family a, Family b) {
	if (a.ha*b.c != b.ha*a.c) return a.ha*b.c > b.ha*a.c;
	return a.id < b.id;
}

int main() {

	cin >> n;

	int idx = 0;
	for (int i = 0; i < n; i++)
	{
		int id, fid, mid, k;
		cin >> id >> fid >> mid >> k;
		st[id] = true;
		if (fid != -1) e[idx++] = { id, fid };
		if (mid != -1) e[idx++] = { id, mid };

		for (int j = 0; j < k; j++)
		{
			int sid;
			cin >> sid;
			e[idx++] = { id,sid };
		}
		cin >> hc[id] >> ha[id];
	}

	for (int i = 0; i < N; i++) f[i] = i, c[i] = 1;
	for (int i = 0; i < idx; i++)
	{
		int a = e[i].a, b = e[i].b;
		st[a] = st[b] = true;
		int pa = find(a), pb = find(b);
		if (pa != pb)
		{
			if (pa < pb) swap(pa, pb);
			c[pb] += c[pa];
			ha[pb] += ha[pa];
			hc[pb] += hc[pa];
			f[pa] = pb;
		}
	}
	vector<Family> family;
	for (int i = 0; i < N; i++)
	{
		if (f[i] == i && st[i]) family.push_back({ i,c[i],hc[i],ha[i] });
	}

	sort(family.begin(), family.end(), cmp);

	cout << family.size() << endl;
	for (auto f : family)
		printf("%04d %d %.3lf %.3lf\n", f.id, f.c, (double)f.hc / f.c, (double)f.ha / f.c);
    return 0;
}