L2-011. 玩转二叉树

L2-011. 玩转二叉树

题目是一道并查集的题， 就是麻烦点，需要建结构体。。。。

#include<bits/stdc++.h>

using namespace std;

const int maxn=11000;
int vis[maxn],m[maxn];
int p[10010];

typedef struct node{
    double ans1, ans2;
    int id, num;
};

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

void init() {
    for(int i = 0; i <= 10000; i++) p[i] = i;
}

int fin(int x) {
    if(x == p[x]) return x;
    else return p[x] = fin(p[x]);
}

void un(int a, int b) {
    int x = fin(a);
    int y = fin(b);
    if(x != y) {
        if(x > y) p[x] = y;
        else p[y] = x;
    }
}


int main()
{
    int i, j, n;
    node a[10005];
    node b[10005];
    node mul[10005];
    cin >> n;
    init();
    memset(vis, 0, sizeof(vis));
    memset(m, 0, sizeof(m));
    for(int i = 0; i < n; i++) {
        int p1, p2, d, k;
        cin >> a[i].id >> p1 >> p2;
        vis[a[i].id] = 1;
        if(p1 != -1) {
            un(p1, a[i].id);
            vis[p1] = 1;
        }
        if(p2 != -1 ) {
            un(p2, a[i].id);
            vis[p2] = 1;
        }
        cin >> k;
        while(k--) {
            cin >> d;
            if(d != -1) {
                un(a[i].id, d);
                vis[d] = 1;
            }
        }
        cin >> a[i].ans1 >> a[i].ans2;
    }
    for(int i = 0; i < n; i++) {
        int id = fin(a[i].id);
        mul[id].id = id;
        mul[id].ans1 += a[i].ans1;
        mul[id].ans2 += a[i].ans2;
    }
    for(int i = 0; i < 10000; i++)  if(vis[i])  mul[fin(i)].num++;

    int cnt = 0;
    for(int i = 0; i < 10000; i++)
        if(vis[i]) {
            int id = fin(i);
            if(!m[id]) {
                m[id] = 1;
                double x = double(mul[id].num);
                b[cnt].ans1 = mul[id].ans1*1.0/x;
                b[cnt].ans2 = mul[id].ans2*1.0/x;
                b[cnt].id = id;
                b[cnt++].num = int(x);
            }
        }
    cout << cnt << endl;
    sort(b, b+cnt, cmp);
    for(int i = 0; i < cnt; i++) printf("%04d %d %.3lf %.3lf\n", b[i].id, b[i].num, b[i].ans1, b[i].ans2);
    return 0;
}