【BZOJ5289】【HNOI2018】排列（堆，并查集）

Description

click me

---

Solution

将问题转化为：给定一棵树，要求将所有点排成一个排列，在父亲必须在儿子前面的情况下使得每个点的位置乘以该点权值的和最小。

然后就是poj2054的套路了。。。
先将所有点看成很多个数列，然后考虑怎么合并。
将平均值作为权值，每次合并最小的即可。
可以用pbds堆（兹磁修改）和并查集维护。

---

Code

/************************************************
 * Au: Hany01
 * Date: Apr 22nd, 2018
 * Prob: [BZOJ5289][HNOI2018] 排列
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/priority_queue.hpp>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<long double, int> PDI;
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 500005;

int n, beg[maxn], nex[maxn], e, v[maxn], pa[maxn], fa[maxn], deg[maxn], sz[maxn], s;
LL w[maxn], Ans;

__gnu_pbds::priority_queue<PDI, greater<PDI> > q;
__gnu_pbds::priority_queue<PDI, greater<PDI> >::point_iterator it[maxn];

inline void add(int uu, int vv) {
    if (uu != s) ++ deg[vv];
    v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e;
}

inline void Assert()
{
    For(u, 1, n) if (!deg[u]) return ;
    puts("-1"); exit(0);
}

void getpa(int u)
{
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != fa[u]) pa[v[i]] = u, getpa(v[i]);
}

int find(int u) { return fa[u] == u ? u : fa[u] = find(fa[u]); }

int main()
{
#ifdef hany01
    File("bzoj5289");
#endif

    n = read(), s = n + 1;
    int tmp;
    For(i, 1, n) add((tmp = read()) ? tmp : s, i);
    For(i, 1, n) w[i] = read();
    Assert();

    getpa(s);
    sz[s] = 1, fa[s] = s, sz[s] = 1;
    For(i, 1, n) fa[i] = i, sz[i] = 1, it[i] = q.push(mp(w[i], i));

    while (!q.empty())
    {
        int u = q.top().y, anc = find(pa[u]);
        q.pop(), Ans += w[u] * 1ll * sz[anc], fa[u] = anc, sz[anc] += sz[u], w[anc] += w[u];
        if (anc != s) q.modify(it[anc], mp((long double)w[anc] * 1. / sz[anc], anc));
    }
    printf("%lld\n", Ans);

    return 0;
}
//月明船笛参差起，风定池莲自在香。
//    -- 秦观《纳凉》