pat a 1114

最新推荐文章于 2020-11-27 20:02:28 发布

git-reset--hard

最新推荐文章于 2020-11-27 20:02:28 发布

阅读量107

点赞数

本文链接：https://blog.csdn.net/blxl313/article/details/104269904

版权

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <unordered_set>
using namespace std;

const int maxv=10010;
int father[maxv];
bool vis[maxv];

struct Node{
	int id;
	int member=0;
	double pset=0;
	double parea=0;
}node[maxv],family[maxv];

bool cmp(Node a,Node b){
	if(a.member!=0&&b.member!=0){
		if(a.parea/a.member!=b.parea/b.member){
			return a.parea/a.member>b.parea/b.member;
		}else{
			return a.id<b.id;
		}
	}else{
		return a.member>b.member;
	}
}

void inti(){
	for(int i=0;i<maxv;i++){
		father[i]=i;
	}
}

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;
}

void Union(int a,int b){
	int faA=findfather(a);
	int faB=findfather(b);
	father[max(faA,faB)]=min(faA,faB);
}


int main(){
	memset(vis,false,sizeof(vis));
	int n;
	scanf("%d",&n);
	inti();
	for(int i=0;i<n;i++){
		int id,fa,mo,num;
		scanf("%d %d %d %d",&id,&fa,&mo,&num);
		vis[id]=true;
		if(fa!=-1){
			Union(id,fa);
			vis[fa]=true;
		}
		if(mo!=-1){
			Union(id,mo);
			vis[mo]=true;
		}
		for(int j=0;j<num;j++){
			int child;
			scanf("%d",&child);
			vis[child]=true;
			Union(id,child);
		}
		scanf("%lf %lf",&node[id].pset,&node[id].parea);
	}
	unordered_set<int> se;
	for(int i=0;i<maxv;i++){
		if(vis[i]==true){
			int root=findfather(i);
			family[root].id=root;
			family[root].member++;
			family[root].parea+=node[i].parea;
			family[root].pset+=node[i].pset;
			se.insert(root);
		}
	}
	
	sort(family,family+maxv,cmp);
	printf("%d\n",se.size());
	for(int i=0;i<se.size();i++){
		printf("%04d %d %.3f %.3f\n",family[i].id,family[i].member,family[i].pset/family[i].member,family[i].parea/family[i].member);
	}

	return 0;
}