PAT--1114. Family Property(并查集)

problem link

题解

对每个人的id以及其双亲 和孩子id建立并查集。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
using namespace std;

const int maxn = 10005;
struct Person{
    int m_esate;
    int area;
};
struct Ans_info{
    int id, m;
    double avg_sets, avg_area;
};
Person p_info[maxn];
int p[maxn];
bool flag[maxn];
int n;

int find(int x) { return x == p[x] ? x : p[x] = find(p[x]); }
void Union(int x, int y){
    x = find(x), y = find(y);
    if(x != y){
        p[x] = y;
    }
}

int main(){
#ifndef ONLINE_JUDGE
freopen("data.in", "r", stdin);
#endif // ONLINE_JUDGE

    for(int i = 0; i < maxn; ++i) p[i]= i;

    cin >> n;
    int id, f_id, m_id, k, kid;
    for(int i = 0; i < n; ++i){
        cin >> id >> f_id >> m_id >> k;
        flag[id] = flag[f_id] = flag[m_id] = true;
        if(f_id != -1) Union(id, f_id);
        if(m_id != -1) Union(id, m_id);
        for(int j = 0; j < k; ++j){
            cin >> kid;
            flag[kid] = true;
            Union(id, kid);
        }
        cin >> p_info[id].m_esate >> p_info[id].area;
    }
    // the root id of every family
    vector<int> roots;
    for(int i = 0; i < maxn; ++i){
        if(flag[i] && find(i) == i) roots.push_back(i);
    }
    vector<Ans_info> vec;
    for(auto root : roots){
        int tot_esate = 0, tot_area = 0, tot_m = 0;
        id = root;
        for(int i = 0; i < maxn; ++i){
            // if i is the member of the family
            if(flag[i] && find(i) == root){
                id = min(id, i);
                tot_m++;
                tot_area += p_info[i].area;
                tot_esate += p_info[i].m_esate;
            }
        }
        vec.push_back(Ans_info{id, tot_m, 1.0*tot_esate/tot_m, 1.0*tot_area/tot_m});
    }

    sort(vec.begin(), vec.end(), [](Ans_info a1, Ans_info a2){
            if(a1.avg_area != a2.avg_area) return a1.avg_area > a2.avg_area;
            return a1.id < a2.id;
         });

    cout<< vec.size() << endl;
    for(int i = 0; i < vec.size(); ++i){
        printf("%04d %d %.3f %.3f\n", vec[i].id, vec[i].m, vec[i].avg_sets, vec[i].avg_area);
    }
    return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值