2021牛客多校10 Game of Death（容斥ntt）

题意

有 $n$ 个人，每个人会等概率随机向另外一个人开枪，有 $p$ 的概率击中。问恰好有 $k(k=0,1,2,..,n)$ 个人活着的概率，对 $998244353$ 取模。
其中，$n\le 3\times 10^5$。

分析

设 $f_i$ 为特定 $i$ 个人活着，其它人不管死活的概率。
那么根据容斥原理，$an{s}_k=C_n^k\sum _{i=k}^n(-1{)}^{i-k}{C}_{n-k}^{,i-k}{f}_i=C_n^k(n-k)!\sum _{i=k}^n\frac{(-1{)}^{i-k}}{(i-k)!}\frac{f_i}{(n-i)!}$。后面是个卷积的形式，翻转一下然后 $ntt$ 即可。
考虑计算 $f_i$。计 $q=1-p$。
这 $i$ 个人要么杀不死人，要么成功击中另外 $n-i$ 个人中的一个。另外 $n-i$ 个人要么杀不死人，要么成功击中 $n-i-1$ 个人中的一个。因此，$f_i=(q+p\times \frac{n-i}{n-1}{)}^i(q+p\times \frac{n-i-1}{n-1}{)}^{n-i}$。
这样这题就做完了，复杂度是 $O(nlogn)$。

代码如下

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void debug_out(){
    cerr << endl;
}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
    cerr << ' ' << H;
    debug_out(T...);
}
#ifdef local
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 55
#endif
typedef unsigned int uint;
namespace Poly {
#define LL long long
    int W;
    const int mod = 998244353;
    typedef vector<uint> poly;
    constexpr uint Max_size = 1 << 20 | 5;
    constexpr int gn = 3;

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

    inline uint mf(uint x) {
        return (static_cast<LL>(x) << 32) / mod;
    }

    int sz;
    uint w[Max_size], w_mf[Max_size];

    inline void init(int n) {
        for (sz = 2; sz < n; sz <<= 1);
        uint pr = power(gn, (mod - 1) / sz);
        w[sz / 2] = 1, w_mf[sz / 2] = mf(w[sz / 2]);
        for (int i = 1; i < sz / 2; ++i)
            w[sz / 2 + i] = (LL) w[sz / 2 + i - 1] * pr % mod, w_mf[sz / 2 + i] = mf(w[sz / 2 + i]);
        for (int i = sz / 2 - 1; i; --i)
            w[i] = w[i << 1], w_mf[i] = w_mf[i << 1];
    }

    inline void NTT(poly &A, const int L) {
        for (int d = L >> 1; d; d >>= 1)
            for (int i = 0; i != L; i += d << 1)
                for (int j = 0; j != d; ++j) {
                    uint x = A[i + j] + A[i + d + j];
                    if (x >= mod * 2)
                        x -= mod * 2;
                    LL t = A[i + j] + mod * 2 - A[i + d + j];
                    LL q = t * w_mf[d + j] >> 32;
                    uint y = t * w[d + j] - q * mod;
                    A[i + j] = x, A[i + d + j] = y;
                }
    }

    inline void INTT(poly &A, const int L) {
        for (int d = 1; d != L; d <<= 1)
            for (int i = 0; i != L; i += d << 1)
                for (int j = 0; j != d; ++j) {
                    uint x = A[i + j];
                    if (x >= mod * 2)
                        x -= mod * 2;
                    LL y = A[i + d + j];
                    LL q = y * w_mf[d + j] >> 32;
                    LL t = y * w[d + j] - q * mod;
                    A[i + j] = x + t, A[i + d + j] = x + mod * 2 - t;
                }
        reverse(A.begin() + 1, A.end());
        if (L == 2) {
            if (A[0] >= mod * 2)
                A[0] -= mod * 2;
            if (A[1] >= mod * 2)
                A[1] -= mod * 2;
        }
        int k = __builtin_ctz(L);
        for (int i = 0; i != L; ++i) {
            LL m = -A[i] & (L - 1);
            A[i] = (A[i] + m * mod) >> k;
        }
    }

    poly operator+(poly a, poly b) {
        int n = max(a.size(), b.size());
        a.resize(n), b.resize(n);
        for (int i = 0; i < n; i++) a[i] = (a[i] + b[i]) % mod;
        return a;
    }

    poly operator-(poly a, poly b) {
        int n = max(a.size(), b.size());
        a.resize(n), b.resize(n);
        for (int i = 0; i < n; i++) a[i] = (a[i] - b[i] + mod) % mod;
        return a;
    }

    poly operator*(poly a, poly b) {
        int n = a.size() + b.size() - 1, R = 2;
        for (; R <= n; R <<= 1);
        init(R);
        a.resize(R), b.resize(R);
        NTT(a, R);
        NTT(b, R);
        for (int i = 0; i < R; i++)a[i] = 1LL * b[i] * a[i] % mod;
        INTT(a, R);
        a.resize(n);
        for (int i = 0; i < n; i++)if (a[i] >= mod)a[i] -= mod;
        return a;
    }
}using namespace Poly;
const int N = 3e5 + 5;
int fac[N], inv[N];
int C(int n, int m){
    if(n < m) return 0;
    return (ll)fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main() {
#ifdef local
    freopen("../in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int n, a, b;
    cin >> n >> a >> b;
    int p = (ll)a * power(b, mod - 2) % mod, q = mod + 1 - p;
    fac[0] = 1;
    for(int i = 1; i <= n; i++) fac[i] = (ll)fac[i - 1] * i % mod;
    inv[n] = power(fac[n], mod - 2);
    for(int i = n - 1; i >= 0; i--) inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
    poly f(n + 1), g(n + 1);
    int I = power(n - 1, mod - 2);
    for(int i = 0; i <= n; i++){
        if(i % 2) f[i] = mod - 1;
        else f[i] = 1;
        int x = (q + (ll)p * (n - i) % mod * I % mod) % mod;
        int y = (q + (ll)p * (n - i - 1) % mod * I % mod) % mod;
        g[i] = power(x, i) * power(y, n - i) % mod * inv[n - i] % mod;
        f[i] = (ll)f[i] * inv[i] % mod;
    }
    reverse(f.begin(), f.begin() + n + 1);
    g = f * g;
    for(int i = 0; i <= n; i++) cout << (ll)g[n + i] * C(n, i) % mod * fac[n - i] % mod << '\n';
    return 0;
}