[HAOI2018]染色 题解

传送门

题目大意：一个长度为$n$的颜色序列，至多$m$种颜色，如果有$k$种颜色恰好出现了$S$次，愉悦度增加$w_k$（$k=0,1,2,\cdots ,m$）。求所有方案愉悦度之和。

首先颜色数量至多$L=\min \left(m,\lfloor \frac{n}{S}\rfloor \right)$种。

设$f_i$表示至少有$i$种颜色出现了恰好$S$次的方案数
$g_i$表示恰好有$i$种颜色出现了恰好$S$次的方案数

不难发现$f_i$与$g_i$具有容斥的关系，并且$ans=\sum _{i=0}^L{g}_i{w}_i$

考虑$f_i$：从$m$种颜色中选出$i$种（$C_m^i$），从$n$个位置中选出$iS$个（$C_n^{iS}$），强行让这$i$种颜色每种都出现$S$次，它们的排列数就是$\frac{(iS)!}{(S!{)}^i}$，然后剩下$n-iS$个位置的颜色从剩下$m-i$种中任选（$(m-i{)}^{n-iS}$），所以有
$$f_i=C_m^i{C}_n^{iS}\frac{(iS)!}{(S!{)}^i}(m-i{)}^{n-iS}$$

对$f_i$进行容斥即可得到$g_i$

$$g_i=\sum _{j=i}^L(-1{)}^{j-i}{C}_j^i{f}_j$$

$$g_i=\sum _{j=i}^L(-1{)}^{j-i}\frac{j!}{i!(j-i)!}{f}_j$$

$$g_{i}i!=\sum _{j=i}^L\frac{(-1{)}^{j-i}}{(j-i)!}j!f_j$$

设$a_i=\frac{(-1{)}^i}{i!},b_i=i!f_i$，并且设$c_i$为$b_i$的翻转，那么

$$g_{i}i!=\sum _{j=i}^L{a}_{j-i}{b}_j$$

$$=\sum _{j=0}^{L-i}{a}_j{b}_{i+j}$$

$$=\sum _{j=0}^{L-i}{a}_j{c}_{L-i-j}$$

化为了卷积的形式，NTT即可解决。

#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;

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

const int maxm = 1e5 + 207;
const int maxn = 1e7 + 7;
const LL P = 1004535809, G = 3, Gi = qpow(G, P - 2);

int w[maxm], low, up, n, m, S;
int r[maxm << 2], lim, l;
LL a[maxm << 2], c[maxm << 2];
LL fac[maxn], ifac[maxn];

inline void ntt(LL *A, 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, (P - 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 % P) {
                LL x = A[j + k], y = w * A[j + k + mid] % P;
                A[j + k] = (x + y) % P;
                A[j + k + mid] = (x - y + P) % P;
            }
        }
    }
    if (tp == -1) {
        LL inv = qpow(lim, P - 2);
        for (int i = 0; i < lim; ++i)
            A[i] = A[i] * inv % P;
    }
}

inline void initFac(int n) {
    fac[0] = 1;
    for (int i = 1; i <= n; ++i)
        fac[i] = fac[i - 1] * i % P;
    ifac[n] = qpow(fac[n], P - 2);
    for (int i = n - 1; i; --i)
        ifac[i] = ifac[i + 1] * (i + 1) % P;
    ifac[0] = 1;
}

inline void initArray() {
    for (int i = 0, cur = 1; i <= low; ++i, cur *= -1)
        a[i] = (P + cur) * ifac[i] % P;
    for (int i = 0; i <= low; ++i)
        c[i] = fac[m] * ifac[m - i] % P * fac[n] % P * qpow(ifac[S], i) % P * ifac[n - i * S] % P * qpow(m - i, n - i * S) % P;
    std::reverse(c, c + low + 1);
}

inline void calcConvolution() {
    for (lim = 1; lim <= low << 1; lim <<= 1, ++l);
    for (int i = 0; i < lim; ++i)
        r[i] = (r[i >> 1] >> 1) | ((i & 1) << (l - 1));
    ntt(a, 1); ntt(c, 1);
    for (int i = 0; i < lim; ++i)
        a[i] = a[i] * c[i] % P;
    ntt(a, -1);
}

int main() {
    read(n, m, S);

    for (int i = 0; i <= m; ++i) read(w[i]);
    low = std::min(m, n / S);
    up = std::max(m, n);

    initFac(up);
    initArray();

    calcConvolution();

    LL ans = 0;
    for (int i = 0; i <= low; ++i)
        ans = (ans + ifac[i] * a[low - i] % P * w[i] % P) % P;
    writeln(ans);
    return 0;
}