L2-007 家庭房产

 

 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

int p[maxn];
int Find(int x)
{
    return x==p[x]?x:p[x]=Find(p[x]);
}
void join(int x,int y)
{
    int jx=Find(x);
    int jy=Find(y);
    if(jx>jy)
    {
        p[jx]=jy;
    }
    else p[jy]=jx;
}
struct node
{
    int ren;
    int id;
    int num;
    double ar;
}a[maxn],b[maxn],tp[maxn];

bool cmp(node a,node b)
{
    if(a.ar/a.ren!=b.ar/b.ren) return a.ar/a.ren>b.ar/b.ren;
    else return a.id<b.id;
}

bool vis[maxn];

int main()
{
    //freopen("input.txt", "r", stdin);
    //FASTIO;
    int n;
    cin>>n;
    for(int i=0;i<=10000;i++) p[i]=i;
    for(int i=0;i<n;i++)
    {
        int id,fa,mo;
        cin>>id>>fa>>mo;
        vis[id]=1;
        if(fa!=-1)
            join(id,fa),vis[fa]=1;
        if(mo!=-1)
            join(id,mo),vis[mo]=1;
        int k;
        cin>>k;
        while(k--)
        {
            int ch;
            cin>>ch;
            if(ch!=-1)
            {
                join(id,ch);
                vis[ch]=1;
            }

        }
        a[i].id=id;
        cin>>a[i].num>>a[i].ar;
    }
    int c=0;
    for(int i=0;i<n;i++)
    {
        int fa=Find(a[i].id);
        b[fa].id=fa;
        b[fa].ar+=a[i].ar;
        b[fa].num+=a[i].num;
    }
    for(int i=0;i<10000;i++)
    {
        if(vis[i])
        {
            int fa=Find(i);
            b[fa].ren++;
        }
    }
    for(int i=0;i<10000;i++)
    {
        if(vis[i])
        {
            if(p[i]==i)
            {
                tp[c].id=i;
                tp[c].num=b[i].num;
                tp[c].ar=b[i].ar;
                tp[c].ren=b[i].ren;
                c++;
            }
        }
    }
    sort(tp,tp+c,cmp);
    cout<<c<<endl;
    for(int i=0;i<c;i++)
    {
        //cout<<tp[i].id<<" "<<tp[i].ren<<" "<<tp[i].num<<" "<<tp[i].ar<<endl;
        printf("%04d %d %0.3lf %0.3lf\n",tp[i].id,tp[i].ren,tp[i].num*1.0/tp[i].ren,tp[i].ar/tp[i].ren);
    }
    return 0;
}