CF923E Perpetual Subtraction 题解

洛谷传送门

设$f(\tau ,i)$表示第$\tau$次操作进行之前，也就是第$(\tau -1)$次操作进行之后得到的数是$i$的概率。那么$f(1,i)=p_i$，我们需要对于每个$i$求出$f(m+1,i)$。

不要问我为什么用$\tau$这个奇怪的字母

考虑一次操作带来的影响：显然有

$$f(\tau +1,i)=\sum _{j=i}^n\frac{f(\tau ,j)}{j+1}$$

看起来不是很明显，我们利用生成函数来找关系。设$F_{\tau }(x)=\sum _{i=0}^{n}f(\tau ,i)x^i$，那么

$$F_{\tau +1}(x)=\sum _{i=0}^{n}f(\tau +1,i)x^i$$

$$=\sum _{i=0}^n\sum _{j=i}^n\frac{f(\tau ,j)}{j+1}{x}^i$$

$$=\sum _{j=0}^n\frac{f(\tau ,j)}{j+1}\sum _{i=0}^j{x}^i$$

$$=\sum _{j=0}^n\frac{f(\tau ,j)}{j+1}\cdot \frac{x^{j+1}-1}{x-1}$$

$$=\frac{1}{x-1}\sum _{j=0}^{n}f(\tau ,j)\frac{x^{j+1}-1}{j+1}$$

$$=\frac{1}{x-1}\sum _{j=0}^{n}f(\tau ,j){\int }_1^x{t}^j\mathrm{d}t$$

$$=\frac{1}{x-1}{\int }_1^x{F}_{\tau }(t)\mathrm{d}t$$

我们喜闻乐见的是${\int }_0^{x}f(t)\mathrm{d}t=\int f(x)\mathrm{d}x$并且常数项为$0$。但这里积分下限是$1$，不好处理。

设$G_{\tau }(x)=F_{\tau }(x+1)$，并且$G_{\tau }(x)=\sum _{i=0}^{n}g(\tau ,i)x^i$，那么

$$G_{\tau +1}(x)=\frac{1}{x}{\int }_1^{x+1}{F}_{\tau }(t)\mathrm{d}t$$

$$=\frac{1}{x}{\int }_0^x{F}_{\tau }(t+1)\mathrm{d}(t+1)$$

$$=\sum _{i=0}^n\frac{g(\tau ,i)}{i+1}{x}^i$$

于是我们发现

$$g(\tau +1,i)=\frac{g(\tau ,i)}{i+1}$$

这是等比数列。那么

$$g(m+1,i)=\frac{g(1,i)}{(i+1{)}^m}$$

下面的问题就是如何求出$g(1,i)$，以及如何由$g(m+1,i)$求出$f(m+1,i)$。

$$\because G_{\tau }(x)=F_{\tau }(x+1)$$

$$\therefore \sum _{i=0}^{n}g(\tau ,i)x^i=\sum _{i=0}^{n}f(\tau ,i)\sum _{j=0}^i{C}_i^j{x}^j$$

$$=\sum _{j=0}^n{x}^j\sum _{i=j}^{n}f(\tau ,i)C_i^j$$

$$\therefore g(\tau ,i)=\sum _{j=i}^n{C}_j^{i}f(\tau ,j)$$

令$\tau =1$，这时$f(\tau ,i)=p_i$，那么

$$g(1,i)=\sum _{j=i}^n\frac{j!p_j}{i!(j-i)!}$$

$$=\frac{1}{i!}\sum _{j=0}^{n-i}\frac{1}{j!}(j+i)!p_{j+i}$$

记$a_i=\frac{1}{i!},b_i=(n-i)!p_{n-i}$，那么

$$g(1,i)=\frac{1}{i!}\sum _{j=0}^{n-i}{a}_j{b}_{n-i-j}$$

NTT求卷积即可。

然后再考虑怎么求出$f(m+1,i)$。为了方便起见，将$f(m+1,i)$记为$f_i$，将$g(m+1,i)$记为$g_i$。

我们发现由$f$求出$g$的过程就是个卷积，现在要反过来求，我们需要多项式求逆吗？并不需要，只要一个反演即可。

$$\because g_i=\sum _{j=i}^n{C}_j^i{f}_j$$

$$\therefore f_i=\sum _{j=i}^n(-1{)}^{j-i}{C}_j^i{g}_j$$

$$=\frac{1}{i!}\sum _{j=i}^n\frac{(-1{)}^{j-i}}{(j-i)!}j!g_j$$

$$=\frac{1}{i!}\sum _{j=0}^{n-i}\frac{(-1{)}^j}{j!}(j+i)!g_{j+i}$$

设$c_i=\frac{(-1{)}^i}{i!},d_i=(n-i)!g_{n-i}$，那么

$$f_i=\frac{1}{i!}\sum _{j=0}^{n-i}{c}_j{d}_{n-i-j}$$

NTT求卷积即可。

时间复杂度$O(n\log n)$。

#include <cctype>
#include <cstdio>
#include <climits>
#include <algorithm>

template <typename T> inline void read(T& x) {
    int f = 0, c = getchar(); x = 0;
    while (!isdigit(c)) f |= c == '-', c = getchar();
    while (isdigit(c)) x = x * 10 + c - 48, c = getchar();
    if (f) x = -x;
}
template <typename T, typename... Args>
inline void read(T& x, Args&... args) {
    read(x); read(args...); 
}
template <typename T> void write(T x) {
    if (x < 0) x = -x, putchar('-');
    if (x > 9) write(x / 10);
    putchar(x % 10 + 48);
}
template <typename T> inline void writeln(T x) { write(x); puts(""); }
template <typename T> inline bool chkmin(T& x, const T& y) { return y < x ? (x = y, true) : false; }
template <typename T> inline bool chkmax(T& x, const T& y) { return x < y ? (x = y, true) : false; }

typedef long long LL;

const LL mod = 998244353, G = 3, Gi = 332748118;
const int maxn = 1e5 + 7;

inline LL qpow(LL x, LL k) {
    LL s = 1;
    for (; k; x = x * x % mod, k >>= 1)
        if (k & 1) s = s * x % mod;
    return s;
}

inline void ntt(LL *A, int *r, int lim, int tp) {
    for (int i = 0; i < lim; ++i)
        if (i < r[i]) std::swap(A[i], A[r[i]]);
    for (int mid = 1; mid < lim; mid <<= 1) {
        LL wn = qpow(tp == 1 ? G : Gi, (mod - 1) / (mid << 1));
        for (int j = 0; j < lim; j += mid << 1) {
            LL w = 1;
            for (int k = 0; k < mid; ++k, w = w * wn % mod) {
                LL x = A[j + k], y = w * A[j + k + mid] % mod;
                A[j + k] = (x + y) % mod;
                A[j + k + mid] = (x - y + mod) % mod;
            }
        }
    }
    if (tp == -1) {
        LL inv = qpow(lim, mod - 2);
        for (int i = 0; i < lim; ++i)
            A[i] = A[i] * inv % mod;
    }
}

int n, r[maxn << 2], lim, l;
LL m, p[maxn], fac[maxn], ifac[maxn];
LL a[maxn << 2], b[maxn << 2], g[maxn];

int main() {
    read(n, m);
    for (int i = 0; i <= n; ++i) read(p[i]);
    fac[0] = ifac[0] = 1;
    for (int i = 1; i <= n + 1; ++i)
        fac[i] = fac[i - 1] * i % mod;
    ifac[n + 1] = qpow(fac[n + 1], mod - 2);
    for (int i = n; i; --i)
        ifac[i] = ifac[i + 1] * (i + 1) % mod;
    for (int i = 0; i <= n; ++i) {
        a[i] = ifac[i];
        b[i] = fac[n - i] * p[n - i] % mod;
    }
    for (lim = 1; lim <= (n << 1); ++l) lim <<= 1;
    for (int i = 0; i < lim; ++i)
        r[i] = (r[i >> 1] >> 1) | ((i & 1) << (l - 1));
    ntt(a, r, lim, 1); ntt(b, r, lim, 1);
    for (int i = 0; i < lim; ++i)
        a[i] = a[i] * b[i] % mod;
    ntt(a, r, lim, -1);
    for (int i = 0; i <= n; ++i)
        g[i] = ifac[i] * a[n - i] % mod * qpow(qpow(i + 1, m), mod - 2) % mod;
    for (int i = 0; i <= n; ++i) {
        a[i] = ((i & 1) ? mod - 1 : 1ll) * ifac[i] % mod;
        b[i] = fac[n - i] * g[n - i] % mod;
    }
    for (int i = n + 1; i < lim; ++i)
        a[i] = b[i] = 0;
    ntt(a, r, lim, 1); ntt(b, r, lim, 1);
    for (int i = 0; i < lim; ++i)
        a[i] = a[i] * b[i] % mod;
    ntt(a, r, lim, -1);
    for (int i = 0; i <= n; ++i)
        write(ifac[i] * a[n - i] % mod), putchar(' ');
    return 0;
}