题目详情 - L2-007 家庭房产 (25 分) (pintia.cn)
题解:
并查集的典型应用,主要应用所有子孙点给祖宗点贡献,将祖宗点存入vector数组中进行排序!
#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
int number;
int ren;
double tao;
double mianji;
}ans[10010];
bool cmp(node a,node b){
if(a.mianji!=b.mianji)return a.mianji>b.mianji;
return a.number<b.number;
}
int fa[10000];
void init(){
for(int i=1;i<=9999;i++)fa[i]=i;
}
int find(int x){
if(x==fa[x])return x;
return fa[x]=find(fa[x]);
}
void merge(int a,int b){
int x=find(a);
int y=find(b);
if(x<y)fa[y]=x;
if(x>y)fa[x]=y;
}
bool st[10010];
vector<node>res;
double mian[10100],tao[10100];
int main(){
cin>>n;
init();
for(int i=1;i<=n;i++){
int num,dad,mom;
cin>>num>>dad>>mom;
if(dad!=-1)merge(num,dad),st[dad]=1;
if(mom!=-1)merge(num,mom),st[mom]=1;
int son;cin>>son;
while(son--){
int x;cin>>x;
st[x]=1;
merge(x,num);
}
cin>>tao[num]>>mian[num];
st[num]=1;
}
for(int i=0;i<=9999;i++){
if(st[i]){//在题目中出现过
int zuzong=find(i);
//ans[cnt].number=i;
ans[zuzong].mianji+=mian[i];
ans[zuzong].ren++;
ans[zuzong].tao+=tao[i];
}
}
for(int i=0;i<10000;i++){
if(st[i]&&fa[i]==i){
ans[i].number=i;
ans[i].tao=ans[i].tao/ans[i].ren;
ans[i].mianji=ans[i].mianji/ans[i].ren;
res.push_back(ans[i]);
}
}
sort(res.begin(),res.end(),cmp);
cout<<res.size()<<endl;
for(int i=0;i<res.size();i++){
printf("%04d",res[i].number);
cout<<" "<<res[i].ren<<" ";
printf("%.3lf %.3lf\n",res[i].tao,res[i].mianji);
}
}