【BZOJ2159】Crash的文明世界（树形DP，斯特林数的性质）

Description

给定一棵$n$个节点的树和定值$k$，求每个点的$S(u)$，$S(u)$的定义如下：
$$S(u)=\sum _{v\in tree}dist(u,v{)}^k$$

Solution

感觉很巧妙的一个题，好评 （除了输入要解压外）

先推一波式子：
$$S(u)=\sum _{i=1}^{n}dist(u,i{)}^k$$
$$=\sum _{i=1}^n\sum _{j=1}^k\left(\genfrac{}{}{0ex}{}{dist(u,i)}{j}\right)\left\{\begin{array}{c}k\\ j\end{array}\right\}j!$$
(第二类斯特林数的性质)
$$=\sum _{j=1}^k\left\{\begin{array}{c}k\\ j\end{array}\right\}j!\sum _{i=1}^n\left(\genfrac{}{}{0ex}{}{dist(n,i)}{j}\right)$$
设$d{p}_{i,j}={\sum }_{k=1}^n\left(\genfrac{}{}{0ex}{}{dist(i,k)}{j}\right)$，直接DP即可。

具体实现：
设$f_{u,i}={\sum }_{v在u的子树中}\left(\genfrac{}{}{0ex}{}{dist(u,v)}{i}\right)$，$g_{u,i}$反之。
一遍DFS求出$f_{u,i}$，第二遍求出$g_{u,i}$，类似组合数的转移。
然后将结果带入上面推出的式子就行了。
$$perfect!!!$$

Source

/****************************
 * Au: Hany01
 * Prob: [BZOJ2159] Crash的文明世界
 * Date: Feb 19th, 2018
 * Email: hany01@foxmail.com
****************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define rep(i , j) for (int i = 0 , i##_end_ = j; i < i##_end_ ; ++ i)
#define For(i , j , k) for (int i = (j) , i##_end_ = (k) ; i <= i##_end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , i##_end_ = (k) ; i >= i##_end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (10007)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr , __VA_ARGS__)
#else
#define debug(...)
#endif

inline void File() {
#ifdef hany01 
	freopen("bzoj2159.in" , "r" , stdin);
    freopen("bzoj2159.out" , "w" , stdout);
#endif
}

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 char c_; register int _ , __;
    for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void mod(int &x) {
    while (x < 0) x += Mod;
    while (x >= Mod) x -= Mod;
}

const int maxn = 50005, maxk = 155, maxm = 100005;

int n, k, v[maxm], nex[maxm], beg[maxn], e, f[maxn][maxk], g[maxn][maxk], S[maxk][maxk], fac[maxk], sz[maxn];

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

inline void Input_Normal()
{
    register int u, v;
    n = read(), k = read();
    For(i, 2, n) u = read(), v = read(), add(u, v), add(v, u);
}

inline void Input_Uncompress()
{
    register int l, now, a, b, q, tmp, u, v;
    n = read(), k = read(), l = read(), now = read(), a = read(), b = read(), q = read();
    For(i, 1, n - 1)
        now = (now * a + b) % q, tmp = i < l ? i : l,
        u = i - now % tmp, v = i + 1, add(u, v), add(v, u);
}

inline void Init()
{
    S[0][0] = 1;
    For(i, 1, k) {
        S[i][0] = 0, S[i][i] = 1;
        For(j, 1, i - 1) S[i][j] = (S[i - 1][j - 1] + S[i - 1][j] * j) % Mod;
    }
    fac[0] = 1;
    For(i, 1, k) fac[i] = fac[i - 1] * i % Mod;
}

inline void DFS1(int u, int fa)
{
    f[u][0] = 1, sz[u] = 1;
    for (register int i = beg[u]; i; i = nex[i]) if (fa != v[i]) {
        DFS1(v[i], u);
        sz[u] += sz[v[i]];
        mod(f[u][0] += f[v[i]][0]);
        For(j, 1, k) mod(f[u][j] += f[v[i]][j - 1] + f[v[i]][j]);
    }
}

inline void DFS2(int u, int fa)
{
    if (u > 1) For(i, 1, k) {
        g[u][i] = g[fa][i] + g[fa][i - 1] + f[fa][i] + f[fa][i - 1];
        g[u][i] -= f[u][i - 1] * 2 + f[u][i];
        if (i > 1) g[u][i] -= f[u][i - 2];
        mod(g[u][i]);
    }
    g[u][0] = (n - sz[u]) % Mod;
    for (register int i = beg[u]; i; i = nex[i]) if (fa != v[i]) DFS2(v[i], u);
}

inline void Print()
{
    register int Ans;
    For(i, 1, n) {
        Ans = 0;
        For(j, 1, k) (Ans += S[k][j] * fac[j] % Mod * (f[i][j] + g[i][j]) % Mod) %= Mod;
        printf("%d\n", Ans);
    }
}

int main()
{
    File();
    //Input_Normal();
    Input_Uncompress();
    Init();
    DFS1(1, 0);
    DFS2(1, 0);
    Print();
    return 0;
}