L2-007 家庭房产(并查集)

 

核心代码就是运用并查集基础知识进行对每个家庭关系进行维护 

对数据的处理需细心点

#include <iostream>
#include <set>
#include <vector>
#define maxn 100001
using namespace std;

struct node{//存储每个人的信息 
	int people_number;
	int house_number;
	int house_all_S;
	vector<int>family;
};
struct result_node{//存储每个家庭的信息 
	int min_people_number;
	int family_people;
	double house_number;
	double house_S;
};
struct Rule{//输出每个家庭的信息时规则 
	bool operator()(const result_node&a1,const result_node&a2)const{
		if(a1.house_S==a2.house_S){
			return a1.min_people_number<a2.min_people_number;
		}else{
			return a1.house_S>a2.house_S;
		}
	}
};
int f[maxn];
int h[maxn];
void Init(){
	for(int i=0;i<=10000;i++){
		f[i]=i;h[i]=0;
	}
}
int Find(int i){
	return f[i]==i?i:f[i]=Find(f[i]);
}
void merge(int a,int b){
	int fa=Find(a);
	int fb=Find(b);
	if(fa==fb)return;
	if(fa<fb){
		f[fa]=fb;
	}else{
		f[fb]=fa;
		if(h[fa]==h[fb])h[fa]++;
	}
}
int main(){
	int N;
	cin>>N;
	int num=N;
	Init();//初始化 
	node *list=new node[N+1];
	int p=0;
	while(N--){
		int people_number,f,m,k,house_number,house_all_S;
		cin>>people_number>>f>>m>>k;
		if(f!=-1){
			list[p].family.push_back(f);
			merge(people_number,f);//合并在一个家庭中 
		}
		if(m!=-1){
			list[p].family.push_back(m);
			merge(people_number,m);
		}
		for(int i=1;i<=k;i++){
			int child;
			cin>>child;
			list[p].family.push_back(child);
			merge(people_number,child);//子女合并在一个家庭中 
		}
		cin>>house_number>>house_all_S;
		list[p].people_number=people_number;
		list[p].house_number=house_number;
		list[p++].house_all_S=house_all_S;	
	}
	int ns=0;//统计家庭个数
	set<int>number;//存储家庭根节点 
	for(int i=0;i<num;i++){
		int root=Find(list[i].people_number);
		number.insert(root);
	}
	ns=number.size();
	cout<<ns<<"\n";
	set<result_node,Rule>answer;
	for(set<int>::iterator it=number.begin();it!=number.end();it++){
		set<int>family; 
		result_node result;
		result.family_people=0;//统计家庭人数
		result.min_people_number=10000;
		result.house_number=0;//人均房产套数 
		result.house_S=0;//人均房产面积 
		for(int i=0;i<num;i++){
			if(Find(list[i].people_number)==*it)//属于该家庭成员 
			{
				if(list[i].people_number<result.min_people_number){
					result.min_people_number=list[i].people_number;
				}
				for(int j=0;j<list[i].family.size();j++){
					family.insert(list[i].family[j]);
					if(list[i].family[j]<result.min_people_number){
						result.min_people_number=list[i].family[j];
					}
				}
				family.insert(list[i].people_number);
				result.house_number+=list[i].house_number;
				result.house_S+=list[i].house_all_S;
			}
		}
		result.family_people+=family.size();
		result.house_number/=result.family_people;
		result.house_S/=result.family_people;
		answer.insert(result);
	}
	for(set<result_node,Rule>::iterator it=answer.begin();it!=answer.end();it++)printf("%04d %d %.03f %.03f\n",it->min_people_number,it->family_people,it->house_number,it->house_S);
	delete [] list;
	return 0;
}