1114 Family Property (25分)
This time, you are supposed to help us collect the data for family-owned property. Given each person's family members, and the estate(房产)info under his/her own name, we need to know the size of each family, and the average area and number of sets of their real estate.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (≤1000). Then N lines follow, each gives the infomation of a person who owns estate in the format:
ID
Father
Mother
k Child1⋯Childk Mestate Area
where ID
is a unique 4-digit identification number for each person; Father
and Mother
are the ID
's of this person's parents (if a parent has passed away, -1
will be given instead); k (0≤k≤5) is the number of children of this person; Childi's are the ID
's of his/her children; Mestate is the total number of sets of the real estate under his/her name; and Area
is the total area of his/her estate.
Output Specification:
For each case, first print in a line the number of families (all the people that are related directly or indirectly are considered in the same family). Then output the family info in the format:
ID
M
AVGsets AVGarea
where ID
is the smallest ID in the family; M
is the total number of family members; AVGsets is the average number of sets of their real estate; and AVGarea is the average area. The average numbers must be accurate up to 3 decimal places. The families must be given in descending order of their average areas, and in ascending order of the ID's if there is a tie.
Sample Input:
10
6666 5551 5552 1 7777 1 100
1234 5678 9012 1 0002 2 300
8888 -1 -1 0 1 1000
2468 0001 0004 1 2222 1 500
7777 6666 -1 0 2 300
3721 -1 -1 1 2333 2 150
9012 -1 -1 3 1236 1235 1234 1 100
1235 5678 9012 0 1 50
2222 1236 2468 2 6661 6662 1 300
2333 -1 3721 3 6661 6662 6663 1 100
Sample Output:
3
8888 1 1.000 1000.000
0001 15 0.600 100.000
5551 4 0.750 100.000
题意: 先输出家庭个数,然后家庭信息先按照人均面积降序输出,有并列再按照成员编号升序输出。
#include<iostream>
#include<algorithm>
using namespace std;
struct Data{
int id,fid,mid,mset,area;
int cid[10];
}data[1000];
struct Ans{
int id,people;
double mset,area;
bool flag;
}ans[10000];
bool visit[10000]={false};
int father[10000];
void init(){
for(int i=0;i<10000;i++)
father[i]=i;
}
int findFather(int x){
if(father[x]==x) return x;
else{
int f=findFather(father[x]);
//f=x;
father[x]=f;
return f;
}
}
void Union(int a,int b){
int fa=findFather(a);
int fb=findFather(b);
if(fa>fb) father[fa]=fb;//成员编号大的作为父节点,方便人均面积若有并列,则按成员编号的升序输出
else if(fa<fb) father[fb]=fa;
}
int cmp(Ans a,Ans b){
return a.area!=b.area ?a.area >b.area :a.id<b.id ;
}
int main(){
init();
int n,k;
cin>>n;
for(int i=0;i<n;i++){
scanf("%d %d %d %d",&data[i].id,&data[i].fid,&data[i].mid,&k);
visit[data[i].id]=true;
if(data[i].fid!=-1){
visit[data[i].fid ]=true;
Union(data[i].fid,data[i].id);
}
if(data[i].mid!=-1){
visit[data[i].mid ]=true;
Union(data[i].mid,data[i].id);
}
for(int j=0;j<k;j++){
scanf("%d",&data[i].cid[j]);
if(data[i].cid[j]!=-1){
visit[data[i].cid[j] ]=true;
Union(data[i].cid[j],data[i].id);
}
}
cin>>data[i].mset>>data[i].area;
}
for(int i=0;i<n;i++){
int temp=findFather(data[i].id);
ans[temp].id=temp;
// ans[temp].people++;
ans[temp].mset+=data[i].mset ;
ans[temp].area+=data[i].area ;
ans[temp].flag =true;
}
int cnt=0;
for(int i=0;i<10000;i++){
if(visit[i])
ans[findFather(i)].people++;//计算每个家庭的成员数
if(ans[i].flag) cnt++;//计算家庭数量
}
for(int i=0;i<10000;i++){
if(ans[i].flag)
{
ans[i].mset=ans[i].mset/(double)ans[i].people ;//算均值
ans[i].area=ans[i].area/(double)ans[i].people ;
}
}
sort(ans,ans+10000,cmp);
printf("%d\n",cnt);
for(int i=0;i<cnt;i++){
printf("%04d %d %.3f %.3f\n",ans[i].id,ans[i].people ,ans[i].mset ,ans[i].area );
}
return 0;
}