1114 Family Property (25 point(s))（并查集：计算家族成员个数及总财产）

题目链接

思路：并查集

另一篇
①并查集的目的在于分类和高效地合并，因为每个集合内部都有很强的关系约束，所以只要将两个集合代表结点建立关系就相当于两个集合的合并。要不然，时间有的是的话，直接来个用STL的set傻傻地find、insert就好了
②并查集的个人理解：先并（Union函数），然后查（findFather），最后集（建立联系）
③这一题虽然是并查集，但对附加信息处理的要求实在有点狗血，即在union两个人的时候，需要先把a和b的个人财产分别归并到大家族中，然后对两个大集合进行合并成一个家族

代码

using namespace std;
#include<bits/stdc++.h>
int n, id, id1, id2, num1, id3, id4,cnt;
int father[10000], peoples[10000], min_id[10000], property[10000], num_property[10000];
vector<int>son[10000],result;
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;
}
bool root(int a) {
	if (a == -1)return false;
	int fa = findfather(a);
	if (fa != a) {
		peoples[fa] += peoples[a];
		property[fa] += property[a];
		num_property[fa] += num_property[a];
		peoples[a] = property[a] = num_property[a] = 0;	
	}
	min_id[fa] = min(a, min_id[fa]);
	return true;
}
void Union(int a, int b) {
	if (root(a) && root(b)) {
		int fa = findfather(a);
		int fb = findfather(b);
		if (fb != fa) {
			father[fb] = fa;
			peoples[fa] += peoples[fb];
			property[fa] += property[fb];
			num_property[fa] += num_property[fb];
			peoples[fb] = property[fb] = num_property[fb] = 0;
		}
		min_id[fa] = min(min(a, b), min(min_id[fb], min_id[fa]));
	}
}
bool cmp(int a, int b) {
	if (property[a] * 1.0 /peoples[a] == property[b] * 1.0 / peoples[b])
		return min_id[a] < min_id[b];
	else return property[a] * 1.0 /peoples[a] > property[b] * 1.0 / peoples[b];	
}
int main() {
	cin >> n;
	for (int i = 0; i < 10000; i++)father[i] = i;
	fill(peoples, peoples + 10000, 1);
	memset(min_id, 0x3f, sizeof min_id);
	for (int i = 0; i < n; i++) {
		cin >> id >> id1 >> id2;
		cin >> num1;
		for (int j = 0; j < num1; j++) cin >> id3,son[id].push_back(id3);
		cin >> num_property[id] >> property[id];
	    Union(id, id1);
		Union(id, id2);
		for (auto n : son[id])Union(id, n);
	}
	for (int i = 0; i <10000; i++) {
		if (property[i]!= 0)cnt++,result.push_back(i);
	}
	sort(result.begin(), result.end(), cmp);
	cout << cnt << endl;
	for (int i = 0; i < cnt; i++) {
		int a = result[i];
		cout << setfill('0') << setw(4) << min_id[a];
		cout<< " " << peoples[a] <<fixed << setprecision(3) <<" "<< num_property[a] * 1.0 / peoples[a] << " " << property[a] * 1.0 / peoples[a] << endl;
	}
	return 0;
}

新年快乐吖(￣o￣) . z Z