PTA家庭房产

#include<bits/stdc++.h>
using namespace std;
struct node
{
	int id;
	int ba;
	int ma;
	int k;
	int child[6];
	int num;
	int area;
} member[1007];
struct family
{
	int id_xiao;
	int ren;
	double fang_num;
	double fang_area;
	int flag=0;//记录家庭的个数
} family[10000];
int pre[10000];
int flag[10000];//标记总共有的人数
bool cmp(struct family a,struct family b)
{
	if(a.fang_area!=b.fang_area)
	{
		return a.fang_area>b.fang_area;
	}
	else
	{
		return a.id_xiao<b.id_xiao;
	}
}
void init()
{
	for(int i = 0; i < 10000; i++) pre[i] = i;
}
int unionsearch(int root)
{
	int son=root;
	int temp;
	while(root!=pre[root])
	{
		root=pre[root];
	}
	//压缩路径
	while(son!=root)
	{
		temp=pre[root];
		pre[son] = root;
		son=temp;
	}
	return root;
}
int join(int a,int b)
{
	int a1=unionsearch(a);
	int b1=unionsearch(b);
	if(a1<b1)
	{
		pre[b1]=a1;
	}
	else if(a1>b1)
	{
		pre[a1]=b1;
	}
}

int main()
{
	int n;
	cin >> n;
	init();
	for(int i=0; i<n; i++)
	{
		cin >> member[i].id>>member[i].ba>>member[i].ma>>member[i].k;
		flag[member[i].id]=1;//标记整pre中哪个有值
		if(member[i].ba!=-1)
		{
			join(member[i].id,member[i].ba);
			flag[member[i].ba]=1;

		}
		if(member[i].ma!=-1)
		{
			join(member[i].id,member[i].ma);
			flag[member[i].ma]=1;
		}
		int num;
		for(int j=0; j<member[i].k; j++)
		{
			cin >> member[i].child[j];
			join(member[i].child[j],member[i].id);
			flag[member[i].child[j]]=1;

		}
		cin >> member[i].num>>member[i].area;

	}
	for(int i=0; i<n; i++)
	{
		int Id=unionsearch(member[i].id);
		family[Id].id_xiao=Id;
		family[Id].fang_area+=member[i].area;
		family[Id].fang_num+=member[i].num;
		family[Id].flag=1;
	}
	int cnt=0;//记录家庭总数
	for(int i=0; i<10000; i++)
	{
		if(flag[i]==1)
		{
			family[unionsearch(i)].ren++;
		}
		if(family[i].flag==1)
		{
			cnt++;
		}
	}
	for(int i=0; i<10000; i++)
	{
		if(family[i].flag==1)
		{
			family[i].fang_num/=1.0*family[i].ren;
			family[i].fang_area/=1.0*family[i].ren;
		}
	}
	sort(family, family+10000, cmp);
	cout << cnt << endl;
	for(int i=0; i<cnt; i++)
	{
		printf("%04d %d %.3lf %.3lf\n",family[i].id_xiao,family[i].ren,family[i].fang_num,family[i].fang_area);

	}
	return 0;
}