【BZOJ4543】【POI2014】Hotel加强版（树形DP，长链剖分）

Description

有一个树形结构，每条边的长度相同，任意两个节点可以相互到达。选3个点。两两距离相等。有多少种方案？
$\mathbf{n\le 10^5}$

---

Solution

$n\le 5\times 10 ^ 3$范围的$O(n^2)$题解戳这里：
https://blog.csdn.net/hhaannyyii/article/details/81783087

在$O(n^2)$的基础上，考虑长链剖分：
发现$f[u][k]=\sum f[u][k-1]$、$g[u][k]=\sum g[u][k+1]$这些转移都可以通过数组位移$O(1)$将重儿子信息转移过来，然后将轻儿子暴力合并即可。
网上都是指针的做法，由于我太菜了，指针没学好，发现用std::deque写特别方便，只是有点卡空间，只要把轻儿子的deque在转移之后全部弹出即可。
时间复杂度$O(n)$。

---

Code

/************************************************
 * Au: Hany01
 * Date: Aug 17th, 2018
 * Prob: BZOJ4543 Hotel
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

string procStatus() {
    ifstream t("/proc/self/status");
    return string(istreambuf_iterator<char>(t), istreambuf_iterator<char>());
}

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#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 mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#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() {
    static int _, __; static 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 = 1e5 + 1;

int n, dep[maxn], mxdep[maxn], son[maxn], id[maxn], tot, top[maxn], uu, vv, sum;
deque<int> f[maxn];
deque<LL > g[maxn];
vector<int> G[maxn];
LL Ans;

void DFS1(int u, int pa) {
    dep[u] = mxdep[u] = dep[pa] + 1, son[u] = u;
    rep(i, SZ(G[u])) if (G[u][i] != pa) {
        DFS1(G[u][i], u);
        if (chkmax(mxdep[u], mxdep[G[u][i]])) son[u] = G[u][i];
    }
}

void DFS2(int u, int pa) {
    if (son[u] != u) top[son[u]] = top[u], DFS2(son[u], u);
    rep(i, SZ(G[u])) if (G[u][i] != son[u] && G[u][i] != pa)
        top[G[u][i]] = G[u][i], DFS2(G[u][i], u);
}

void DFS(int u, int pa) {
    if (son[u] == u) {
        f[id[u] = ++ tot].resize(dep[u] - dep[top[u]] + 1), f[tot][0] = 1;
        g[tot].resize(dep[u] - dep[top[u]] + 1);
        return;
    }
    DFS(son[u], u);
    f[id[u] = id[son[u]]].push_front(1), f[id[u]].pop_back();
    g[id[u]].pop_front(), g[id[u]].push_back(0);
    Ans += g[id[u]][0];
    rep(i, SZ(G[u])) if (G[u][i] != pa && G[u][i] != son[u]) {
        DFS(G[u][i], u);
        For(k, 0, mxdep[G[u][i]] - dep[u]) {
            if (k) Ans += g[id[u]][k] * f[id[G[u][i]]][k - 1];
            Ans += f[id[u]][k] * g[id[G[u][i]]][k + 1];
            if (k) g[id[u]][k] += (LL)f[id[u]][k] * f[id[G[u][i]]][k - 1];
            g[id[u]][k] += g[id[G[u][i]]][k + 1];
            if (k) f[id[u]][k] += f[id[G[u][i]]][k - 1];
        }
        while (!f[id[G[u][i]]].empty()) f[id[G[u][i]]].pop_back();
        while (!g[id[G[u][i]]].empty()) g[id[G[u][i]]].pop_back();
    }
}

int main()
{
#ifdef hany01
    freopen("bzoj4543.in", "r", stdin);
    freopen("bzoj4543.out", "w", stdout);
#endif

    n = read();
    For(i, 2, n) uu = read(), vv = read(), G[uu].push_back(vv), G[vv].push_back(uu);
    DFS1(1, 0), top[1] = 1, DFS2(1, 0);
    DFS(1, 0), printf("%lld\n", Ans);

    //cerr << procStatus() << endl;

    return 0;
}