[2021CCPC 威海M] 810975 (组合计数容斥原理多项式快速幂)

凌乱之风

已于 2022-09-22 22:06:19 修改

阅读量1.9k

点赞数 3

分类专栏：数论题文章标签：算法多项式

于 2021-12-08 14:59:43 首次发布

本文链接：https://blog.csdn.net/messywind/article/details/121791509

版权

数论题专栏收录该内容

34 篇文章 2 订阅

订阅专栏

前言

今天看了衣锦夜行 $2021$ 年度 $\text{top10}$ ，看完 $810975$ 突然想起来这题还没补完代码，最近又刚学习了一点多项式，学完多项式快速幂之后终于可以补这道题了，所以决定重新写一遍对这个题发一个重制版的题解

先科普一下 $810975$ 是什么意思：知名炉石传说主播衣锦夜行在 $8$ 月 $10$ 号打了 $9$ 盘酒馆战旗，吃了 $7$ 鸡，其中一个还是 $5$ 连鸡，后来多次在直播间疯狂吹嘘自己，节目效果拉满 https://www.bilibili.com/video/BV1Uy4y1V75X 后来上了 $317$ 期的逗鱼时刻，片尾给夜吹做了一个鬼畜 https://www.bilibili.com/video/BV11f4y1H7TJ 深刻的被洗脑了， $810975$ 还荣登 $2021$ 逗鱼时刻 $\text{TOP50}$ 的 $\text{TOP0}$ (压轴级别)
顺带一提，衣锦夜行是我最喜欢的主播，技术不错虽然有时候嘴很硬，因夺得 $2020$ 年世俱杯冠军被称为“世界冠军”，可惜现在只有 $8000$ 分左右，但是我最赞同他的一句话：分数没有意义，快乐才是真谛。

QQ截图20220204220559.png

题意

夜吹下了 $n$ 盘酒馆战旗，吃了 $m$ 次鸡，并且 $k$ 连鸡，求方案数对 $998244353$ 取模。

$\le n,m,k \le 10^5$

分析：

已知下了 $n$ 盘棋，吃了 $m$ 次鸡，所以有 $n - m$ 局是未吃鸡的，所以考虑把 $m$ 次鸡插空， $n - m$ 局未吃鸡局有 $n - m + 1$ 个空位，那么每个空的生成函数为

$1+x+x^2+x^3+\cdots+x^k$

所以所有的方案数就为

$m](1+x+x^2+x^3+\cdots+x^k)^{n - m + 1}$

$x^m]$ 表示 $m$ 次项的系数

记 $f (k)$ 为 $n$ 把 $m$ 鸡 小于等于 $k$ 连鸡的方案数

那么答案就为 $f (k) - f (k - 1)$ ，可以用多项式快速幂来求解

代码：

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int mod = 998244353;
int norm(int x) {
    if (x < 0) {
        x += mod;
    }
    if (x >= mod) {
        x -= mod;
    }
    return x;
}
template<class T>
T power(T a, int b) {
    T res = 1;
    for (; b; b /= 2, a *= a) {
        if (b % 2) {
            res *= a;
        }
    }
    return res;
}
struct Z {
    int x;
    Z(int x = 0) : x(norm(x)) {}
    int val() const {
        return x;
    }
    Z operator-() const {
        return Z(norm(mod - x));
    }
    Z inv() const {
        assert(x != 0);
        return power(*this, mod - 2);
    }
    Z &operator*=(const Z &rhs) {
        x = i64(x) * rhs.x % mod;
        return *this;
    }
    Z &operator+=(const Z &rhs) {
        x = norm(x + rhs.x);
        return *this;
    }
    Z &operator-=(const Z &rhs) {
        x = norm(x - rhs.x);
        return *this;
    }
    Z &operator/=(const Z &rhs) {
        return *this *= rhs.inv();
    }
    friend Z operator*(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res *= rhs;
        return res;
    }
    friend Z operator+(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res += rhs;
        return res;
    }
    friend Z operator-(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res -= rhs;
        return res;
    }
    friend Z operator/(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res /= rhs;
        return res;
    }
    friend istream &operator>>(istream &is, Z &a) {
        i64 v;
        is >> v;
        a = Z(v);
        return is;
    }
    friend ostream &operator<<(ostream &os, const Z &a) {
        return os << a.val();
    }
};
vector<int> rev;
vector<Z> roots{0, 1};
void dft(vector<Z> &a) {
    int n = a.size();
    if (int(rev.size()) != n) {
        int k = __builtin_ctz(n) - 1;
        rev.resize(n);
        for (int i = 0; i < n; i ++) {
            rev[i] = rev[i >> 1] >> 1 | (i & 1) << k;
        }
    }
    for (int i = 0; i < n; i ++) {
        if (rev[i] < i) {
            swap(a[i], a[rev[i]]);
        }
    }
    if (int(roots.size()) < n) {
        int k = __builtin_ctz(roots.size());
        roots.resize(n);
        while ((1 << k) < n) {
            Z e = power(Z(3), (mod - 1) >> (k + 1));
            for (int i = 1 << (k - 1); i < (1 << k); i ++) {
                roots[i << 1] = roots[i];
                roots[i << 1 | 1] = roots[i] * e;
            }
            k ++;
        }
    }
    for (int k = 1; k < n; k *= 2) {
        for (int i = 0; i < n; i += 2 * k) {
            for (int j = 0; j < k; j ++) {
                Z u = a[i + j], v = a[i + j + k] * roots[k + j];
                a[i + j] = u + v, a[i + j + k] = u - v;
            }
        }
    }
}
void idft(vector<Z> &a) {
    int n = a.size();
    reverse(a.begin() + 1, a.end());
    dft(a);
    Z inv = (1 - mod) / n;
    for (int i = 0; i < n; i ++) {
        a[i] *= inv;
    }
}
struct Poly {
    vector<Z> a;
    Poly() {}
    Poly(const vector<Z> &a) : a(a) {}
    Poly(const initializer_list<Z> &a) : a(a) {}
    int size() const {
        return a.size();
    }
    void resize(int n) {
        a.resize(n);
    }
    Z operator[](int idx) const {
        if (idx < size()) {
            return a[idx];
        } else {
            return 0;
        }
    }
    Z &operator[](int idx) {
        return a[idx];
    }
    Poly mulxk(int k) const {
        auto b = a;
        b.insert(b.begin(), k, 0);
        return Poly(b);
    }
    Poly modxk(int k) const {
        k = min(k, size());
        return Poly(vector<Z>(a.begin(), a.begin() + k));
    }
    Poly divxk(int k) const {
        if (size() <= k) {
            return Poly();
        }
        return Poly(vector<Z>(a.begin() + k, a.end()));
    }
    friend Poly operator+(const Poly &a, const Poly &b) {
        vector<Z> res(max(a.size(), b.size()));
        for (int i = 0; i < int(res.size()); i ++) {
            res[i] = a[i] + b[i];
        }
        return Poly(res);
    }
    friend Poly operator-(const Poly &a, const Poly &b) {
        vector<Z> res(max(a.size(), b.size()));
        for (int i = 0; i < int(res.size()); i ++) {
            res[i] = a[i] - b[i];
        }
        return Poly(res);
    }
    friend Poly operator*(Poly a, Poly b) {
        if (a.size() == 0 || b.size() == 0) {
            return Poly();
        }
        int sz = 1, tot = a.size() + b.size() - 1;
        while (sz < tot) {
            sz *= 2;
        }
        a.a.resize(sz);
        b.a.resize(sz);
        dft(a.a);
        dft(b.a);
        for (int i = 0; i < sz; i ++) {
            a.a[i] = a[i] * b[i];
        }
        idft(a.a);
        a.resize(tot);
        return a;
    }
    friend Poly operator*(Z a, Poly b) {
        for (int i = 0; i < int(b.size()); i ++) {
            b[i] *= a;
        }
        return b;
    }
    friend Poly operator*(Poly a, Z b) {
        for (int i = 0; i < int(a.size()); i ++) {
            a[i] *= b;
        }
        return a;
    }
    Poly &operator+=(Poly b) {
        return (*this) = (*this) + b;
    }
    Poly &operator-=(Poly b) {
        return (*this) = (*this) - b;
    }
    Poly &operator*=(Poly b) {
        return (*this) = (*this) * b;
    }
    Poly deriv() const {
        if (a.empty()) {
            return Poly();
        }
        vector<Z> res(size() - 1);
        for (int i = 0; i < size() - 1; i ++) {
            res[i] = (i + 1) * a[i + 1];
        }
        return Poly(res);
    }
    Poly integr() const {
        vector<Z> res(size() + 1);
        for (int i = 0; i < size(); i ++) {
            res[i + 1] = a[i] / (i + 1);
        }
        return Poly(res);
    }
    Poly inv(int m) const {
        Poly x{a[0].inv()};
        int k = 1;
        while (k < m) {
            k *= 2;
            x = (x * (Poly{2} - modxk(k) * x)).modxk(k);
        }
        return x.modxk(m);
    }
    Poly log(int m) const {
        return (deriv() * inv(m)).integr().modxk(m);
    }
    Poly exp(int m) const {
        Poly x{1};
        int k = 1;
        while (k < m) {
            k *= 2;
            x = (x * (Poly{1} - x.log(k) + modxk(k))).modxk(k);
        }
        return x.modxk(m);
    }
    Poly pow(int k, int m) const {
        int i = 0;
        while (i < size() && a[i].val() == 0) {
            i ++;
        }
        if (i == size() || 1LL * i * k >= m) {
            return Poly(vector<Z>(m));
        }
        Z v = a[i];
        auto f = divxk(i) * v.inv();
        return (f.log(m - i * k) * k).exp(m - i * k).mulxk(i * k) * power(v, k);
    }
    Poly sqrt(int m) const {
        Poly x{1};
        int k = 1;
        while (k < m) {
            k *= 2;
            x = (x + (modxk(k) * x.inv(k)).modxk(k)) * ((mod + 1) / 2);
        }
        return x.modxk(m);
    }
    Poly mulT(Poly b) const {
        if (b.size() == 0) {
            return Poly();
        }
        int n = b.size();
        reverse(b.a.begin(), b.a.end());
        return ((*this) * b).divxk(n - 1);
    }
};
signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int n, m, k;
    cin >> n >> m >> k;
    if (!m) {
        cout << 1 << "\n";
    } else if (!n) {
        cout << 0 << "\n";
    } else if (n < m) {
        cout << 0 << "\n";
    } else {
        vector<Z> f(k + 1, 1);
        auto res = Poly(f).pow(n - m + 1, m + 1);
        if (!k) {
            cout << 0 << "\n";
        } else if (k == 1) {
            cout << res[m] << "\n";
        } else {
            vector<Z> f(k, 1);
            auto res2 = Poly(f).pow(n - m + 1, m + 1);
            cout << res[m] - res2[m] << "\n";
        }
    }
}

凌乱之风

关注

3
点赞
踩
6

收藏

觉得还不错? 一键收藏
6
评论
[2021CCPC 威海M] 810975 (组合计数容斥原理多项式快速幂)

题意夜吹下了 nnn 盘酒馆战旗，吃了 mmm 次鸡，并且 kkk 连鸡，求方案数对 998244353998244353998244353 取模。分析：已知下了 nnn 盘棋，吃了 mmm 次鸡，所以有 n−mn - mn−m 局是未吃鸡的，所以考虑把 mmm 次鸡插空，n−mn - mn−m 局未吃鸡局有 n−m+1n - m + 1n−m+1 个空位，那么每个空的生成函数为1+x+x2+x3+⋯+xk1+x+x^2+x^3+\cdots+x^k1+x+x2+x3+⋯+xk所以所有的方案数
复制链接

扫一扫