Description
给出一棵
n
个节点边权为
n≤5×104,m≤500
。
Solution
这好像和多校的一道题一模一样啊。。
若
m=1
直接
O(n)
DP。
题目要求使一个数集的元素加
1
,并询问所有元素的
数的幂和下降幂之间有这样的关系:
xn=∑k=0nxk↓S(n,k)
其中
xk↓
为
x
的下降幂。有:
(x+1)k↓=xk↓+kx(k−1)↓
就可以
O(m)
转移啦。
总复杂度 O(nm) 。
#include <bits/stdc++.h>
using namespace std;
const int N = 50505;
const int M = 505;
const int MOD = 10007;
typedef long long ll;
inline char get(void) {
static char buf[100000], *S = buf, *T = buf;
if (S == T) {
T = (S = buf) + fread(buf, 1, 100000, stdin);
if (S == T) return EOF;
}
return *S++;
}
inline void read(int &x) {
static char c; x = 0;
for (c = get(); c < '0' || c > '9'; c = get());
for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
}
int S[M][M];
struct edge {
int to, next;
edge (int t = 0, int n = 0):to(t), next(n) {}
};
edge G[N << 1];
int n, m, Gcnt, x, y, test, ans, tmp;
int L, now, A, B, Q;
int head[N];
int dp[N][M];
inline void AddEdge(int from, int to) {
G[++Gcnt] = edge(to, head[from]); head[from] = Gcnt;
G[++Gcnt] = edge(from, head[to]); head[to] = Gcnt;
}
inline void Add(int &x, int a) {
x += a; while (x >= a) x -= MOD;
while (x < 0) x += MOD;
}
inline void dfs1(int u, int fa) {
int to;
for (int i = 0; i <= m; i++) dp[u][i] = 0;
dp[u][0] = 1;
for (int i = head[u]; i; i = G[i].next) {
to = G[i].to; if (to == fa) continue;
dfs1(to, u); Add(dp[u][0], dp[to][0]);
for (int j = 1; j <= m; j++)
Add(dp[u][j], dp[to][j] + j * dp[to][j - 1] % MOD);
}
}
inline void dfs2(int u, int fa) {
int res;
if (fa) {
for (int j = m; j >= 2; j--) {
res = (dp[fa][j] + j * dp[fa][j - 1]) % MOD;
res -= (dp[u][j] + j * dp[u][j - 1]) % MOD;
res -= (dp[u][j - 1] + (j - 1) * dp[u][j - 2]) % MOD * j % MOD;
Add(dp[u][j], res % MOD);
}
dp[u][1] = (dp[fa][1] + dp[fa][0] - 2 * dp[u][0] % MOD + MOD) % MOD;
dp[u][0] = dp[fa][0];
}
for (int i = head[u]; i; i = G[i].next)
if (G[i].to != fa) dfs2(G[i].to, u);
}
int main(void) {
freopen("1.in", "r", stdin);
S[0][0] = 1;
for (int i = 1; i <= 500; i++) {
S[i][0] = 0;
for (int j = 1; j <= i; j++)
S[i][j] = (S[i - 1][j - 1] + S[i - 1][j] * j) % MOD;
}
read(n); read(m); read(L);
read(now); read(A); read(B); read(Q);
for (int i = 1; i < n; i++) {
now = (now * A + B) % Q;
tmp = i < L ? i : L;
x = i - now % tmp; y = i + 1;
AddEdge(x, y);
}
dfs1(1, 0); dfs2(1, 0);
for (int i = 1; i <= n; i++) {
ans = 0;
for (int j = 1; j <= m; j++)
Add(ans, dp[i][j] * S[m][j] % MOD);
printf("%d\n", ans);
}
return 0;
}