1114 Family Property

并查集

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
struct Node{
	int id,fid,mid,k,num,area;
	int child[10];
}node[1005];
struct Ans{
	int people,id;
	double num,area;
	bool flag=false;
}ans[10000];
int visit[10000]={0};
int father[10000];
int find(int a){
	while(father[a]!=a){
		a=father[a];
	}
	return a;
}
void Union(int A,int B){
	int faA=find(A);
	int faB=find(B);
	if(faA>faB){
		father[faA]=faB;
	}else if(faA<faB){
		father[faB]=faA;
	}
}
bool cmpl(Ans a,Ans b){
	if(a.area!=b.area)
		return a.area>b.area;
	else 
		return a.id<b.id;	
}
int main() {
	int n,cnt=0;
	cin>>n;
	for(int i=0;i<10000;i++){
		father[i]=i;
	}
	for(int i=0;i<n;i++){
		scanf("%d %d %d %d",&node[i].id,&node[i].fid,&node[i].mid,&node[i].k);
		visit[node[i].id]=1;
		if(node[i].fid!=-1){
			visit[node[i].fid]=1;
			Union(node[i].id,node[i].fid);
		}
		if(node[i].mid!=-1){
			visit[node[i].mid]=1;
			Union(node[i].id,node[i].mid);
		}
		for(int j=0;j<node[i].k;j++){
			scanf("%d",&node[i].child[j]);
			visit[node[i].child[j]]=1;
			Union(node[i].id,node[i].child[j]);
		}
		scanf("%d %d",&node[i].num,&node[i].area);
	}
	for(int i=0;i<n;i++){
		int id=find(node[i].id);
		ans[id].id=id;
		ans[id].num+=node[i].num;
		ans[id].area+=node[i].area;
		ans[id].flag=true;
	}
	for(int i=0;i<10000;i++){
		if(visit[i]==true)
			ans[find(i)].people++;
		if(ans[i].flag==true)
			cnt++;	
	}
	for(int i=0;i<10000;i++){
		if(ans[i].flag){
			ans[i].num=(1.0*ans[i].num)/ans[i].people;
			ans[i].area=(1.0*ans[i].area)/ans[i].people;
		}
	}
	sort(ans,ans+10000,cmpl);
	cout<<cnt<<endl;
	for(int i = 0; i < cnt; i++)
        printf("%04d %d %.3f %.3f\n", ans[i].id, ans[i].people, ans[i].num, ans[i].area);
    return 0;
}