天梯赛 L2家庭房产

这个题看起来比较复杂，但其实就只用了并查集的知识而已。

#include <bits/stdc++.h>
using namespace std;
int n,self,fa,ma,num,son;
int total[10000],area[10000];
int ans;
int f[10000];
int s[10000];
struct house{
	int b;
	int Min;
	int cnt;
	double htotal;
	double harea;
}family[10000];
int vis[10000];
int find(int x){
	if(f[x]==x) return x;
	return f[x]=find(f[x]);
}
void unin(int x,int y){
	int px=find(x);
	int py=find(y);
	if(px!=py)
		f[px]=py;
}
bool cmp(house a,house b){
	if(a.harea==b.harea)
		return a.Min<b.Min;
	return a.harea>b.harea;
}
int main()
{
	cin>>n;
	for(int i=0;i<10000;++i){
		f[i]=i;
		family[i].b=0;
		family[i].Min=0x3f3f3f3f;
		family[i].cnt=0;
		family[i].htotal=0;
		family[i].harea=0;
	}	
	while(n--){
		cin>>self>>fa>>ma>>num;
		vis[self]=1;
		if(fa!=-1){
			vis[fa]=1;
			unin(self,fa);
		}
		if(ma!=-1)
		{
			vis[ma]=1;
			unin(self,ma);
		}
		while(num--){
			cin>>son;
			vis[son]=1;
			unin(self,son);
		}
		cin>>total[self]>>area[self];
	}
	for(int i=0;i<10000;++i){
		if(vis[i]==1){
			family[find(i)].b=1;
			family[find(i)].cnt++;
			family[find(i)].Min=min(family[find(i)].Min,i);
			family[find(i)].htotal+=total[i];
			family[find(i)].harea+=area[i];
		}
	}
	for(int i=0;i<10000;++i){
		if(family[i].b==1){
			ans++;
			family[i].htotal=family[i].htotal*1.0/family[i].cnt;
			family[i].harea=family[i].harea*1.0/family[i].cnt;
		}	
	}
	cout<<ans<<endl;
	sort(family,family+10000,cmp);
	for(int i=0;i<ans;++i){
		printf("%04d %d %.3lf %.3lf\n",family[i].Min,family[i].cnt,family[i].htotal,family[i].harea);	
	}
	return 0;
}