2020CCPC网络赛 Residual Polynomial 指数型母函数+多项式 (HDU 6900)

题解

$f_i(x)=b_i{f}_{i-1}^{\prime }(x)+c_i{f}_{i-1}(x)$
这个形式，有点像是能提出一个系数然后递推
就是这里的$f_{i-1}^{\prime }(x)$怎么处理是个问题
因为题目给的$f(x)$是一个普通型母函数，所以求导的话，$(a_i{x}^i{)}^{\prime }=i{a}_i{x}^{i-1}$
其实是所有系数都左移并且乘上当前$x$的幂次，没法处理
考虑指数型母函数$g(x)=\sum _{i=0}^{\propto }{t}_i\frac{x^i}{i!}$，如果对$g(x)$求导，则有$g^{\prime }(x)=\frac{g(x)}{x}$
所以我们先将$f_1(x)$转化为指数型生成函数，即
$$f_1(x)=\sum _{i=0}^n{a}_i{x}^i=\sum _{i=0}^n{t}_i\frac{x^i}{i!}$$
那么就有
$$\begin{array}{rl}{f}_i(x)& =b_i{f}_{i-1}^{\prime }(x)+c_i{f}_{i-1}(x)\\ & =b_i\frac{f_{i-1}(x)}{x}+c_i{f}_{i-1}(x)\\ & =\left(c_i+b_i{x}^{-1}\right)f_{i-1}(x)\\ & =\prod _{j=2}^n\left(c_j+b_j{x}^{-1}\right)f_1(x)\end{array}$$
可以看到最后的形式就是好几个$a+b{x}^{-1}$形式的多项式累乘，再乘上$f_1(x)$
对于前面的$\prod$，直接计算要$n$次乘法，考虑分治乘法，这样只需要$O(nlo{g}^{2}n)$
具体细节看代码部分
赛后交T了，神奇神奇，思路看看就行

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;

ll qpow(ll a, ll b, ll mod) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

const ll mod = 998244353;
const ll G = 3;
const ll invG = qpow(G, mod - 2, mod);
int tr[N];

int getLen(int n) {
    int len = 1;
    while (len < (n << 1)) len <<= 1;
    for (int i = 0; i < len; i++) tr[i] = (tr[i >> 1] >> 1) | (i & 1 ? len >> 1 : 0);
    return len;
}

void NTT(ll *A, int len, int type) {
    for (int i = 0; i < len; i++) if (i < tr[i]) swap(A[i], A[tr[i]]);
    for (int i = 2; i <= len; i <<= 1) {
        int mid = i / 2;
        ll Wn = qpow(type == 1 ? G : invG, (mod - 1) / i, mod);
        for (int k = 0; k < len; k += i) {
            ll w = 1;
            for (int l = k; l < k + mid; l++) {
                ll t = w * A[l + mid] % mod;
                A[l + mid] = (A[l] - t + mod) % mod;
                A[l] = (A[l] + t) % mod;
                w = w * Wn % mod;
            }
        }
    }
    if (type == -1) {
        ll invn = qpow(len, mod - 2, mod);
        for (int i = 0; i < len; i++)
            A[i] = A[i] * invn % mod;
    }
}


void solve(ll *f1, ll *f2, ll *g, int l, int r) {//分治乘法
    if (l == r) return (void) (g[(l - 1) * 2] = f1[l], g[(l - 1) * 2 + 1] = f2[l]);
    int mid = (l + r) / 2;
    solve(f1, f2, g, l, mid);
    solve(f1, f2, g, mid + 1, r);
    static ll a[N], b[N];
    int len1 = mid - l + 2, len2 = r - mid + 1;
    for (int i = 0; i < len1; i++) a[i] = g[(l - 1) * 2 + i];
    for (int i = 0; i < len2; i++) b[i] = g[mid * 2 + i];
    int n = r - l + 2, len = getLen(n);
    NTT(a, len, 1), NTT(b, len, 1);
    for (int i = 0; i < len; i++) a[i] = a[i] * b[i] % mod;
    NTT(a, len, -1);
    for (int i = 0; i < n; i++) g[(l - 1) * 2 + i] = a[i];
    for (int i = n; i < len; i++) g[(l - 1) * 2 + i] = 0;
    for (int i = 0; i < len; i++) a[i] = b[i] = 0;

}

int n;
ll a[N], b[N], c[N], f[N], g[N];

ll fac[N], ifac[N];
void init(int siz) {
    fac[0] = 1;
    for (int i = 1; i <= siz; i++)
        fac[i] = i * fac[i - 1] % mod;
    ifac[siz] = qpow(fac[siz], mod - 2, mod);
    for (int i = siz; i >= 1; i--) ifac[i - 1] = ifac[i] * i % mod;
}

int main() {
#ifdef ACM_LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#endif
    init(1e5);
    int T; scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 0; i <= (n * 10); i++) a[i] = b[i] = c[i] = f[i] = g[i] = 0;
        for (int i = 0; i <= n; i++) {
            scanf("%lld", &a[i]);
            //将普通型母函数转化为指数型生成函数, 即系数乘上i!
            a[i] = a[i] * fac[i] % mod;
        }
        for (int i = 1; i < n; i++) scanf("%lld", &b[i]);
        for (int i = 1; i < n; i++) scanf("%lld", &c[i]);
        solve(c, b, f, 1, n - 1);//分治乘法
        //这里x的幂次是0, -1, -2, -3, ..., -(n - 2), -(n - 1)
        //所以最后我要swap一下, 就变成-(n - 1), -(n - 2), ..., 2, 1, 0
        for (int i = 0; i < n / 2; i++) swap(f[i], f[n - i - 1]);
        int len = getLen(n + 1);
        //再跟f_1(x)做一下NTT
        NTT(f, len, 1), NTT(a, len, 1);
        for (int i = 0; i < len; i++) g[i] = a[i] * f[i] % mod;
        NTT(g, len, -1);
        //最后这里将指数型母函数还原为普通型母函数, 即系数乘上i!的逆元
        //此外这里取g[i + n - 1]项是因为我们前面算出来的幂是负的，我右移了n - 1位, 现在还原回去
        for (int i = 0; i <= n; i++)
            printf("%lld%s", g[i + n - 1] * ifac[i] % mod, i == n ? "\n" : " ");

    }
    return 0;
}