团体程序设计天梯赛-练习集-L2-007. 家庭房产(并查集)

记录一个菜逼的成长。。

题目链接
并查集的略微扩展，用Size数组记录人数，num数组记录房产数，area数组记录面积
就是处理起来会有点麻烦。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cctype>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define clr clear()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int maxn = 100000 + 10;
int pre[maxn],Size[maxn],area[maxn],num[maxn];
int tmp[maxn];
set<int>ve;
struct Node {
    int id,tot_size;
    double avg_num,avg_area;
    Node(){}
    Node(int a,int b,double c,double d):id(a),tot_size(b),avg_num(c),avg_area(d){}
};
vector<Node>node;
void init()
{
    ve.clr,node.clr;
    for( int i = 0; i < maxn; i++ )
        pre[i] = i,Size[i] = 1;
    cl(area,0),cl(num,0);
}
int findr(int x)
{
    return pre[x] == x?pre[x]:pre[x] = findr(pre[x]);
}
void unio(int x,int y)
{
    int fx = findr(x),fy = findr(y);
    if(fy > fx)swap(fx,fy);//保证根节点是最小的序号
    if(fx != fy){
        pre[fx] = fy;
        Size[fy] += Size[fx];
        Size[fx] = Size[fy];
        num[fy] += num[fx];
        num[fx] = num[fy];
        area[fy] += area[fx];
        area[fx] = area[fy];
    }
}
bool cmp(Node a, Node b)
{
    if(a.avg_area != b.avg_area)return a.avg_area > b.avg_area;
    return a.id < b.id;
}
int main()
{
    int n;
    while(cin>>n){
        init();
        int id,fa,mo,k,c,a;
        for( int i = 1; i <= n; i++ ){
            scanf("%d%d%d%d",&id,&fa,&mo,&k);
            ve.insert(id);
            if(fa != -1)ve.insert(fa);
            if(mo != -1)ve.insert(mo);
            for( int j = 0; j < k; j++ ){
                scanf("%d",tmp+j);
                if(tmp[j] != -1)
                    ve.insert(tmp[j]);
            }
            scanf("%d%d",&c,&a);
            int r = findr(id);
            num[r] += c;
            area[r] += a;
            if(fa != -1 && mo != -1)unio(fa,mo);
            if(fa != -1)unio(id,fa);
            if(mo != -1)unio(id,mo);
            for( int j = 0; j < k; j++ ){
                if(tmp[j] != -1)unio(id,tmp[j]);
            }
        }
        set<int>::iterator it;
        for( it = ve.begin(); it != ve.end(); it++ ){
            int root = findr(*it);
            if(root == *it){
                node.pb(Node(root,Size[root],(double)num[root]/Size[root],(double)area[root]/Size[root]));
            }
        }
        sort(ALL(node),cmp);
        cout<<node.size()<<endl;
        for( int i = 0; i < node.size(); i++ )
            printf("%04d %d %.3f %.3f\n",node[i].id,node[i].tot_size,node[i].avg_num,node[i].avg_area);
    }
    return 0;
}