#765612 (C++17) No.1956 猫の額

提出ソース
結果

問題	No.1956 猫の額
ユーザー	Pachicobue
提出日時	2022-05-24 03:39:17
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	WA
実行時間	-
コード長	26,613 bytes
コンパイル時間	4,291 ms
コンパイル使用メモリ	271,868 KB
最終ジャッジ日時	2025-01-29 14:58:59
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
other	AC * 12 WA * 9
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <bits/stdc++.h>
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = double;
using f80 = long double;
using f128 = __float128;
constexpr i32 operator"" _i32(u64 v)
{
    return v;
}
constexpr i32 operator"" _u32(u64 v)
{
    return v;
}
constexpr i64 operator"" _i64(u64 v)
{
    return v;
}
constexpr u64 operator"" _u64(u64 v)
{
    return v;
}
constexpr f64 operator"" _f64(f80 v)
{
    return v;
}
constexpr f80 operator"" _f80(f80 v)
{
    return v;
}
using Istream = std::istream;
using Ostream = std::ostream;
using Str = std::string;
template<typename T>
using Lt = std::less<T>;
template<typename T>
using Gt = std::greater<T>;
template<typename T>
using IList = std::initializer_list<T>;
template<int n>
using BSet = std::bitset<n>;
template<typename T1, typename T2>
using Pair = std::pair<T1, T2>;
template<typename... Ts>
using Tup = std::tuple<Ts...>;
template<typename T, int N>
using Arr = std::array<T, N>;
template<typename... Ts>
using Deq = std::deque<Ts...>;
template<typename... Ts>
using Set = std::set<Ts...>;
template<typename... Ts>
using MSet = std::multiset<Ts...>;
template<typename... Ts>
using USet = std::unordered_set<Ts...>;
template<typename... Ts>
using UMSet = std::unordered_multiset<Ts...>;
template<typename... Ts>
using Map = std::map<Ts...>;
template<typename... Ts>
using MMap = std::multimap<Ts...>;
template<typename... Ts>
using UMap = std::unordered_map<Ts...>;
template<typename... Ts>
using UMMap = std::unordered_multimap<Ts...>;
template<typename... Ts>
using Vec = std::vector<Ts...>;
template<typename... Ts>
using Stack = std::stack<Ts...>;
template<typename... Ts>
using Queue = std::queue<Ts...>;
template<typename T>
using MaxHeap = std::priority_queue<T>;
template<typename T>
using MinHeap = std::priority_queue<T, Vec<T>, Gt<T>>;
using NSec = std::chrono::nanoseconds;
using USec = std::chrono::microseconds;
using MSec = std::chrono::milliseconds;
using Sec = std::chrono::seconds;
template<typename T>
constexpr T LIMMIN = std::numeric_limits<T>::min();
template<typename T>
constexpr T LIMMAX = std::numeric_limits<T>::max();
template<typename T>
constexpr T INF = (LIMMAX<T> - 1) / 2;
template<typename T>
constexpr T PI = T{3.141592653589793238462643383279502884};
template<typename T = u64>
constexpr T TEN(const int n)
{
    return n == 0 ? T{1} : TEN<T>(n - 1) * T{10};
}
Ostream& operator<<(Ostream& os, i128 v)
{
    bool minus = false;
    if (v < 0) { minus = true, v = -v; }
    Str ans;
    if (v == 0) { ans = "0"; }
    while (v) {
        ans.push_back('0' + v % 10), v /= 10;
    }
    std::reverse(ans.begin(), ans.end());
    return os << (minus ? "-" : "") << ans;
}
Ostream& operator<<(Ostream& os, u128 v)
{
    Str ans;
    if (v == 0) { ans = "0"; }
    while (v) {
        ans.push_back('0' + v % 10), v /= 10;
    }
    std::reverse(ans.begin(), ans.end());
    return os << ans;
}
template<typename T>
bool chmin(T& a, const T& b)
{
    if (a > b) {
        a = b;
        return true;
    } else {
        return false;
    }
}
template<typename T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    } else {
        return false;
    }
}
template<typename T>
constexpr T floorDiv(T x, T y)
{
    if (y < T{}) { x = -x, y = -y; }
    return x >= T{} ? x / y : (x - y + 1) / y;
}
template<typename T>
constexpr T ceilDiv(T x, T y)
{
    if (y < T{}) { x = -x, y = -y; }
    return x >= T{} ? (x + y - 1) / y : x / y;
}
template<typename T, typename I>
constexpr T modPower(T v, I n, T mod)
{
    T ans = 1 % mod;
    for (; n > 0; n >>= 1, (v *= v) %= mod) {
        if (n % 2 == 1) { (ans *= v) %= mod; }
    }
    return ans;
}
template<typename T, typename I>
constexpr T power(T v, I n)
{
    T ans = 1;
    for (; n > 0; n >>= 1, v *= v) {
        if (n % 2 == 1) { ans *= v; }
    }
    return ans;
}
template<typename T, typename I>
constexpr T power(T v, I n, const T& e)
{
    T ans = e;
    for (; n > 0; n >>= 1, v *= v) {
        if (n % 2 == 1) { ans *= v; }
    }
    return ans;
}
template<typename T>
Vec<T>& operator+=(Vec<T>& vs1, const Vec<T>& vs2)
{
    vs1.insert(vs1.end(), vs2.begin(), vs2.end());
    return vs1;
}
template<typename T>
Vec<T> operator+(const Vec<T>& vs1, const Vec<T>& vs2)
{
    auto vs = vs1;
    vs += vs2;
    return vs;
}
template<typename Vs, typename V>
void fillAll(Vs& arr, const V& v)
{
    if constexpr (std::is_convertible<V, Vs>::value) {
        arr = v;
    } else {
        for (auto& subarr : arr) {
            fillAll(subarr, v);
        }
    }
}
template<typename Vs>
void sortAll(Vs& vs)
{
    std::sort(std::begin(vs), std::end(vs));
}
template<typename Vs, typename C>
void sortAll(Vs& vs, C comp)
{
    std::sort(std::begin(vs), std::end(vs), comp);
}
template<typename Vs>
void reverseAll(Vs& vs)
{
    std::reverse(std::begin(vs), std::end(vs));
}
template<typename V, typename Vs>
V sumAll(const Vs& vs)
{
    if constexpr (std::is_convertible<Vs, V>::value) {
        return static_cast<V>(vs);
    } else {
        V ans = 0;
        for (const auto& v : vs) {
            ans += sumAll<V>(v);
        }
        return ans;
    }
}
template<typename Vs>
int minInd(const Vs& vs)
{
    return std::min_element(std::begin(vs), std::end(vs)) - std::begin(vs);
}
template<typename Vs>
int maxInd(const Vs& vs)
{
    return std::max_element(std::begin(vs), std::end(vs)) - std::begin(vs);
}
template<typename Vs, typename V>
int lbInd(const Vs& vs, const V& v)
{
    return std::lower_bound(std::begin(vs), std::end(vs), v) - std::begin(vs);
}
template<typename Vs, typename V>
int ubInd(const Vs& vs, const V& v)
{
    return std::upper_bound(std::begin(vs), std::end(vs), v) - std::begin(vs);
}
template<typename Vs, typename V>
bool contains(const Vs& vs, const V& v)
{
    const int li = lbInd(vs, v);
    return (li < std::size(vs) and vs[li] == v);
}
template<typename Vs, typename V>
void plusAll(Vs& vs, const V& v)
{
    for (auto& v_ : vs) {
        v_ += v;
    }
}
template<typename T, typename F>
Vec<T> genVec(int n, F gen)
{
    Vec<T> ans;
    std::generate_n(std::back_insert_iterator(ans), n, gen);
    return ans;
}
template<typename T = int>
Vec<T> iotaVec(int n, T offset = 0)
{
    Vec<T> ans(n);
    std::iota(ans.begin(), ans.end(), offset);
    return ans;
}
constexpr int popcount(const u64 v)
{
    return v ? __builtin_popcountll(v) : 0;
}
constexpr int log2p1(const u64 v)
{
    return v ? 64 - __builtin_clzll(v) : 0;
}
constexpr int lsbp1(const u64 v)
{
    return __builtin_ffsll(v);
}
constexpr int clog(const u64 v)
{
    return v ? log2p1(v - 1) : 0;
}
constexpr u64 ceil2(const u64 v)
{
    const int l = clog(v);
    return (l == 64) ? 0_u64 : (1_u64 << l);
}
constexpr u64 floor2(const u64 v)
{
    return v ? (1_u64 << (log2p1(v) - 1)) : 0_u64;
}
constexpr bool ispow2(const u64 v)
{
    return (v > 0) and ((v & (v - 1)) == 0);
}
constexpr bool btest(const u64 mask, const int ind)
{
    return (mask >> ind) & 1_u64;
}
template<typename F>
struct Fix : F
{
    Fix(F&& f) : F{std::forward<F>(f)} {}
    template<typename... Args>
    auto operator()(Args&&... args) const
    {
        return F::operator()(*this, std::forward<Args>(args)...);
    }
};
class irange
{
private:
    struct itr
    {
        itr(i64 start = 0, i64 step = 1) : m_cnt{start}, m_step{step} {}
        bool operator!=(const itr& it) const
        {
            return m_cnt != it.m_cnt;
        }
        int operator*()
        {
            return m_cnt;
        }
        itr& operator++()
        {
            m_cnt += m_step;
            return *this;
        }
        i64 m_cnt, m_step;
    };
    i64 m_start, m_end, m_step;
public:
    irange(i64 start, i64 end, i64 step = 1)
    {
        assert(step != 0);
        const i64 d = std::abs(step);
        const i64 l = (step > 0 ? start : end);
        const i64 r = (step > 0 ? end : start);
        int n = (r - l) / d + ((r - l) % d ? 1 : 0);
        if (l >= r) { n = 0; }
        m_start = start;
        m_end = start + step * n;
        m_step = step;
    }
    itr begin() const
    {
        return itr{m_start, m_step};
    }
    itr end() const
    {
        return itr{m_end, m_step};
    }
};
irange rep(i64 end)
{
    return irange(0, end, 1);
}
irange per(i64 rend)
{
    return irange(rend - 1, -1, -1);
}
/**
 * @ref https://prng.di.unimi.it
 */
namespace xoshiro_impl {
u64 x;
u64 next()
{
    uint64_t z = (x += 0x9e3779b97f4a7c15);
    z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9;
    z = (z ^ (z >> 27)) * 0x94d049bb133111eb;
    return z ^ (z >> 31);
}
} // namespace xoshiro_impl
class Xoshiro32
{
public:
    using result_type = u32;
    using T = result_type;
    Xoshiro32(T seed = 0)
    {
        xoshiro_impl::x = seed;
        s[0] = xoshiro_impl::next();
        s[1] = xoshiro_impl::next();
        s[2] = xoshiro_impl::next();
        s[3] = xoshiro_impl::next();
    }
    static constexpr T min()
    {
        return LIMMIN<T>;
    }
    static constexpr T max()
    {
        return LIMMAX<T>;
    }
    T operator()()
    {
        return next();
    }
private:
    static constexpr T rotl(const T x, int k)
    {
        return (x << k) | (x >> (32 - k));
    }
    T next()
    {
        const T ans = rotl(s[1] * 5, 7) * 9;
        const T t = s[1] << 9;
        s[2] ^= s[0];
        s[3] ^= s[1];
        s[1] ^= s[2];
        s[0] ^= s[3];
        s[2] ^= t;
        s[3] = rotl(s[3], 11);
        return ans;
    }
    T s[4];
};
class Xoshiro64
{
public:
    using result_type = u64;
    using T = result_type;
    Xoshiro64(T seed = 0)
    {
        xoshiro_impl::x = seed;
        s[0] = xoshiro_impl::next();
        s[1] = xoshiro_impl::next();
        s[2] = xoshiro_impl::next();
        s[3] = xoshiro_impl::next();
    }
    static constexpr T min()
    {
        return LIMMIN<T>;
    }
    static constexpr T max()
    {
        return LIMMAX<T>;
    }
    T operator()()
    {
        return next();
    }
private:
    static constexpr T rotl(const T x, int k)
    {
        return (x << k) | (x >> (64 - k));
    }
    T next()
    {
        const T ans = rotl(s[1] * 5, 7) * 9;
        const T t = s[1] << 17;
        s[2] ^= s[0];
        s[3] ^= s[1];
        s[1] ^= s[2];
        s[0] ^= s[3];
        s[2] ^= t;
        s[3] = rotl(s[3], 45);
        return ans;
    }
    T s[4];
};
template<typename Rng>
class RNG
{
public:
    using result_type = typename Rng::result_type;
    using T = result_type;
    static constexpr T min()
    {
        return Rng::min();
    }
    static constexpr T max()
    {
        return Rng::max();
    }
    RNG() : RNG(std::random_device{}()) {}
    RNG(T seed) : m_rng(seed) {}
    T operator()()
    {
        return m_rng();
    }
    template<typename T>
    T val(T min, T max)
    {
        return std::uniform_int_distribution<T>(min, max)(m_rng);
    }
    template<typename T>
    Pair<T, T> pair(T min, T max)
    {
        return std::minmax({val<T>(min, max), val<T>(min, max)});
    }
    template<typename T>
    Vec<T> vec(int n, T min, T max)
    {
        return genVec<T>(n, [&]() { return val<T>(min, max); });
    }
    template<typename T>
    Vec<Vec<T>> vvec(int n, int m, T min, T max)
    {
        return genVec<Vec<T>>(n, [&]() { return vec(m, min, max); });
    }
private:
    Rng m_rng;
};
RNG<std::mt19937> rng;
RNG<std::mt19937_64> rng64;
RNG<Xoshiro32> rng_xo;
RNG<Xoshiro64> rng_xo64;
class Scanner
{
public:
    Scanner(Istream& is = std::cin) : m_is{is}
    {
        m_is.tie(nullptr)->sync_with_stdio(false);
    }
    template<typename T>
    T val()
    {
        T v;
        return m_is >> v, v;
    }
    template<typename T>
    T val(T offset)
    {
        return val<T>() - offset;
    }
    template<typename T>
    Vec<T> vec(int n)
    {
        return genVec<T>(n, [&]() { return val<T>(); });
    }
    template<typename T>
    Vec<T> vec(int n, T offset)
    {
        return genVec<T>(n, [&]() { return val<T>(offset); });
    }
    template<typename T>
    Vec<Vec<T>> vvec(int n, int m)
    {
        return genVec<Vec<T>>(n, [&]() { return vec<T>(m); });
    }
    template<typename T>
    Vec<Vec<T>> vvec(int n, int m, const T offset)
    {
        return genVec<Vec<T>>(n, [&]() { return vec<T>(m, offset); });
    }
    template<typename... Args>
    auto tup()
    {
        return Tup<Args...>{val<Args>()...};
    }
    template<typename... Args>
    auto tup(const Args&... offsets)
    {
        return Tup<Args...>{val<Args>(offsets)...};
    }
private:
    Istream& m_is;
};
Scanner in;
class Printer
{
public:
    Printer(Ostream& os = std::cout) : m_os{os}
    {
        m_os << std::fixed << std::setprecision(15);
    }
    template<typename... Args>
    int operator()(const Args&... args)
    {
        dump(args...);
        return 0;
    }
    template<typename... Args>
    int ln(const Args&... args)
    {
        dump(args...), m_os << '\n';
        return 0;
    }
    template<typename... Args>
    int el(const Args&... args)
    {
        dump(args...), m_os << std::endl;
        return 0;
    }
private:
    template<typename T>
    void dump(const T& v)
    {
        m_os << v;
    }
    template<typename T>
    void dump(const Vec<T>& vs)
    {
        for (const int i : rep(vs.size())) {
            m_os << (i ? " " : ""), dump(vs[i]);
        }
    }
    template<typename T>
    void dump(const Vec<Vec<T>>& vss)
    {
        for (const int i : rep(vss.size())) {
            m_os << (i ? "\n" : ""), dump(vss[i]);
        }
    }
    template<typename T, typename... Ts>
    int dump(const T& v, const Ts&... args)
    {
        dump(v), m_os << ' ', dump(args...);
        return 0;
    }
    Ostream& m_os;
};
Printer out;
template<u32 mod_, u32 root_, u32 max2p_>
class modint
{
    template<typename U = u32&>
    static U modRef()
    {
        static u32 s_mod = 0;
        return s_mod;
    }
    template<typename U = u32&>
    static U rootRef()
    {
        static u32 s_root = 0;
        return s_root;
    }
    template<typename U = u32&>
    static U max2pRef()
    {
        static u32 s_max2p = 0;
        return s_max2p;
    }
public:
    static constexpr bool isDynamic()
    {
        return (mod_ == 0);
    }
    template<typename U = const u32>
    static constexpr std::enable_if_t<mod_ != 0, U> mod()
    {
        return mod_;
    }
    template<typename U = const u32>
    static std::enable_if_t<mod_ == 0, U> mod()
    {
        return modRef();
    }
    template<typename U = const u32>
    static constexpr std::enable_if_t<mod_ != 0, U> root()
    {
        return root_;
    }
    template<typename U = const u32>
    static std::enable_if_t<mod_ == 0, U> root()
    {
        return rootRef();
    }
    template<typename U = const u32>
    static constexpr std::enable_if_t<mod_ != 0, U> max2p()
    {
        return max2p_;
    }
    template<typename U = const u32>
    static std::enable_if_t<mod_ == 0, U> max2p()
    {
        return max2pRef();
    }
    template<typename U = u32>
    static void setMod(std::enable_if_t<mod_ == 0, U> m)
    {
        modRef() = m;
    }
    template<typename U = u32>
    static void setRoot(std::enable_if_t<mod_ == 0, U> r)
    {
        rootRef() = r;
    }
    template<typename U = u32>
    static void setMax2p(std::enable_if_t<mod_ == 0, U> m)
    {
        max2pRef() = m;
    }
    constexpr modint() : m_val{0} {}
    constexpr modint(i64 v) : m_val{normll(v)} {}
    constexpr void setRaw(u32 v)
    {
        m_val = v;
    }
    constexpr modint operator-() const
    {
        return modint{0} - (*this);
    }
    constexpr modint& operator+=(const modint& m)
    {
        m_val = norm(m_val + m.val());
        return *this;
    }
    constexpr modint& operator-=(const modint& m)
    {
        m_val = norm(m_val + mod() - m.val());
        return *this;
    }
    constexpr modint& operator*=(const modint& m)
    {
        m_val = normll((i64)m_val * (i64)m.val() % (i64)mod());
        return *this;
    }
    constexpr modint& operator/=(const modint& m)
    {
        return *this *= m.inv();
    }
    constexpr modint operator+(const modint& m) const
    {
        auto v = *this;
        return v += m;
    }
    constexpr modint operator-(const modint& m) const
    {
        auto v = *this;
        return v -= m;
    }
    constexpr modint operator*(const modint& m) const
    {
        auto v = *this;
        return v *= m;
    }
    constexpr modint operator/(const modint& m) const
    {
        auto v = *this;
        return v /= m;
    }
    constexpr bool operator==(const modint& m) const
    {
        return m_val == m.val();
    }
    constexpr bool operator!=(const modint& m) const
    {
        return not(*this == m);
    }
    friend Istream& operator>>(Istream& is, modint& m)
    {
        i64 v;
        return is >> v, m = v, is;
    }
    friend Ostream& operator<<(Ostream& os, const modint& m)
    {
        return os << m.val();
    }
    constexpr u32 val() const
    {
        return m_val;
    }
    template<typename I>
    constexpr modint pow(I n) const
    {
        return power(*this, n);
    }
    constexpr modint inv() const
    {
        return pow(mod() - 2);
    }
    static modint sinv(u32 n)
    {
        static Vec<modint> is{1, 1};
        for (u32 i = (u32)is.size(); i <= n; i++) {
            is.push_back(-is[mod() % i] * (mod() / i));
        }
        return is[n];
    }
    static modint fact(u32 n)
    {
        static Vec<modint> fs{1, 1};
        for (u32 i = (u32)fs.size(); i <= n; i++) {
            fs.push_back(fs.back() * i);
        }
        return fs[n];
    }
    static modint ifact(u32 n)
    {
        static Vec<modint> ifs{1, 1};
        for (u32 i = (u32)ifs.size(); i <= n; i++) {
            ifs.push_back(ifs.back() * sinv(i));
        }
        return ifs[n];
    }
    static modint comb(int n, int k)
    {
        return k > n or k < 0 ? modint{0} : fact(n) * ifact(n - k) * ifact(k);
    }
private:
    static constexpr u32 norm(u32 x)
    {
        return x < mod() ? x : x - mod();
    }
    static constexpr u32 normll(i64 x)
    {
        return norm(u32(x % (i64)mod() + (i64)mod()));
    }
    u32 m_val;
};
using modint_1000000007 = modint<1000000007, 5, 1>;
using modint_998244353 = modint<998244353, 3, 23>;
template<int id>
using modint_dynamic = modint<0, 0, id>;
using u16 = unsigned short;
template<u16 mod_>
class smodint
{
public:
    static constexpr u16 mod()
    {
        return mod_;
    }
    constexpr smodint() : m_val{0} {}
    constexpr smodint(i32 v) : m_val{normll(v)} {}
    constexpr void setRaw(u16 v)
    {
        m_val = v;
    }
    constexpr smodint operator-() const
    {
        return smodint{0} - (*this);
    }
    constexpr smodint& operator+=(const smodint& m)
    {
        m_val = norm(m_val + m.val());
        return *this;
    }
    constexpr smodint& operator-=(const smodint& m)
    {
        m_val = norm(m_val + mod() - m.val());
        return *this;
    }
    constexpr smodint& operator*=(const smodint& m)
    {
        m_val = normll((i32)m_val * (i32)m.val() % (i32)mod());
        return *this;
    }
    constexpr smodint& operator/=(const smodint& m)
    {
        return *this *= m.inv();
    }
    constexpr smodint operator+(const smodint& m) const
    {
        auto v = *this;
        return v += m;
    }
    constexpr smodint operator-(const smodint& m) const
    {
        auto v = *this;
        return v -= m;
    }
    constexpr smodint operator*(const smodint& m) const
    {
        auto v = *this;
        return v *= m;
    }
    constexpr smodint operator/(const smodint& m) const
    {
        auto v = *this;
        return v /= m;
    }
    constexpr bool operator==(const smodint& m) const
    {
        return m_val == m.val();
    }
    constexpr bool operator!=(const smodint& m) const
    {
        return not(*this == m);
    }
    friend Ostream& operator<<(Ostream& os, const smodint& m)
    {
        return os << m.val();
    }
    constexpr u32 val() const
    {
        return m_val;
    }
    template<typename I>
    constexpr smodint pow(I n) const
    {
        return power(*this, n);
    }
    constexpr smodint inv() const
    {
        return pow(mod() - 2);
    }
private:
    static constexpr u16 norm(u16 x)
    {
        return x < mod() ? x : x - mod();
    }
    static constexpr u16 normll(i32 x)
    {
        return norm(u32(x % (i32)mod() + (i32)mod()));
    }
    u16 m_val;
};
constexpr u32 Ps[] = {32687, 32693, 32707, 32713, 32717, 32719};
using smint0 = smodint<Ps[0]>;
using smint1 = smodint<Ps[1]>;
using smint2 = smodint<Ps[2]>;
using smint3 = smodint<Ps[3]>;
using smint4 = smodint<Ps[4]>;
using smint5 = smodint<Ps[5]>;
template<typename mint1,
         typename mint2,
         typename mint3,
         typename mint4,
         typename mint5,
         typename mint6>
constexpr Tup<mint1, mint2, mint3, mint4, mint5, mint6> coeff(const mint1& x1,
                                                              const mint2& x2,
                                                              const mint3& x3,
                                                              const mint4& x4,
                                                              const mint5& x5,
                                                              const mint6& x6)
{
    constexpr auto m1 = mint1::mod();
    constexpr auto m2 = mint2::mod();
    constexpr auto m3 = mint3::mod();
    constexpr auto m4 = mint4::mod();
    constexpr auto m5 = mint4::mod();
    constexpr mint2 m1_inv = mint2(m1).inv();
    constexpr mint3 m1m2_inv = (mint3(m1) * mint3(m2)).inv();
    constexpr mint4 m1m2m3_inv = (mint4(m1) * mint4(m2) * mint4(m3)).inv();
    constexpr mint5 m1m2m3m4_inv
        = (mint5(m1) * mint5(m2) * mint5(m3) * mint5(m4)).inv();
    constexpr mint6 m1m2m3m4m5_inv
        = (mint6(m1) * mint6(m2) * mint6(m3) * mint6(m4) * mint6(m5)).inv();
    const mint1 y0 = x1;
    const mint2 y1 = (x2 - mint2(y0.val())) * m1_inv;
    const mint3 y2 = (x3 - mint3(y0.val()) - mint3(y1.val()) * m1) * m1m2_inv;
    const mint4 y3 = (x4 - mint4(y0.val()) - mint4(y1.val()) * m1
                      - mint4(y2.val()) * m1 * m2)
                     * m1m2m3_inv;
    const mint5 y4
        = (x5 - mint5(y0.val()) - mint5(y1.val()) * m1
           - mint5(y2.val()) * m1 * m2 - mint5(y3.val()) * m1 * m2 * m3)
          * m1m2m3m4_inv;
    const mint6 y5
        = (x6 - mint6(y0.val()) - mint6(y1.val()) * m1
           - mint6(y2.val()) * m1 * m2 - mint6(y3.val()) * m1 * m2 * m3
           - mint6(y4.val()) * m1 * m2 * m3 * m4)
          * m1m2m3m4m5_inv;
    return {y0, y1, y2, y3, y4, y5};
}
template<typename mint,
         typename mint1,
         typename mint2,
         typename mint3,
         typename mint4,
         typename mint5,
         typename mint6>
constexpr mint restore_mod(const mint1& x1,
                           const mint2& x2,
                           const mint3& x3,
                           const mint4& x4,
                           const mint5& x5,
                           const mint6& x6)
{
    constexpr auto m1 = mint1::mod();
    constexpr auto m2 = mint2::mod();
    constexpr auto m3 = mint3::mod();
    constexpr auto m4 = mint4::mod();
    constexpr auto m5 = mint5::mod();
    constexpr auto m6 = mint6::mod();
    const auto [y0, y1, y2, y3, y4, y5] = coeff(x1, x2, x3, x4, x5, x6);
    return mint(y0.val()) + mint(y1.val()) * m1 + mint(y2.val()) * m1 * m2
           + mint(y3.val()) * m1 * m2 * m3 + mint(y4.val()) * m1 * m2 * m3 * m4
           + mint(y5.val()) * m1 * m2 * m3 * m4 * m5;
}
int main()
{
    using mint = modint_dynamic<0>;
    auto [N, M, C] = in.tup<int, u32, int>();
    mint::setMod(M);
    bool complement = false;
    if (N - C < C) {
        C = N - C;
        complement = true;
    }
    const auto As = in.vec<int>(N);
    const int A = sumAll<int>(As);
    Vec<smint0> ans0(A + 1, 0);
    Vec<smint1> ans1(A + 1, 0);
    Vec<smint2> ans2(A + 1, 0);
    Vec<smint3> ans3(A + 1, 0);
    Vec<smint4> ans4(A + 1, 0);
    Vec<smint5> ans5(A + 1, 0);
    do { using mint = smint0; Vec<Vec<mint>> dp(C + 1); dp.shrink_to_fit(); dp[0] = {1}; for (int i : rep(N)) { for (int c : per(std::min(i + 1, C))) { for (int j : per(dp[c].size())) { const int nj = j + As[i]; if (dp[c + 1].size() < nj + 1) { dp[c + 1].resize(nj + 1); dp[c + 1].shrink_to_fit(); } dp[c + 1][nj] += dp[c][j]; } } } ans0 = dp[C]; } while (0);
    do { using mint = smint1; Vec<Vec<mint>> dp(C + 1); dp.shrink_to_fit(); dp[0] = {1}; for (int i : rep(N)) { for (int c : per(std::min(i + 1, C))) { for (int j : per(dp[c].size())) { const int nj = j + As[i]; if (dp[c + 1].size() < nj + 1) { dp[c + 1].resize(nj + 1); dp[c + 1].shrink_to_fit(); } dp[c + 1][nj] += dp[c][j]; } } } ans1 = dp[C]; } while (0);
    do { using mint = smint2; Vec<Vec<mint>> dp(C + 1); dp.shrink_to_fit(); dp[0] = {1}; for (int i : rep(N)) { for (int c : per(std::min(i + 1, C))) { for (int j : per(dp[c].size())) { const int nj = j + As[i]; if (dp[c + 1].size() < nj + 1) { dp[c + 1].resize(nj + 1); dp[c + 1].shrink_to_fit(); } dp[c + 1][nj] += dp[c][j]; } } } ans2 = dp[C]; } while (0);
    do { using mint = smint3; Vec<Vec<mint>> dp(C + 1); dp.shrink_to_fit(); dp[0] = {1}; for (int i : rep(N)) { for (int c : per(std::min(i + 1, C))) { for (int j : per(dp[c].size())) { const int nj = j + As[i]; if (dp[c + 1].size() < nj + 1) { dp[c + 1].resize(nj + 1); dp[c + 1].shrink_to_fit(); } dp[c + 1][nj] += dp[c][j]; } } } ans3 = dp[C]; } while (0);
    do { using mint = smint4; Vec<Vec<mint>> dp(C + 1); dp.shrink_to_fit(); dp[0] = {1}; for (int i : rep(N)) { for (int c : per(std::min(i + 1, C))) { for (int j : per(dp[c].size())) { const int nj = j + As[i]; if (dp[c + 1].size() < nj + 1) { dp[c + 1].resize(nj + 1); dp[c + 1].shrink_to_fit(); } dp[c + 1][nj] += dp[c][j]; } } } ans4 = dp[C]; } while (0);
    do { using mint = smint5; Vec<Vec<mint>> dp(C + 1); dp.shrink_to_fit(); dp[0] = {1}; for (int i : rep(N)) { for (int c : per(std::min(i + 1, C))) { for (int j : per(dp[c].size())) { const int nj = j + As[i]; if (dp[c + 1].size() < nj + 1) { dp[c + 1].resize(nj + 1); dp[c + 1].shrink_to_fit(); } dp[c + 1][nj] += dp[c][j]; } } } ans5 = dp[C]; } while (0);
    Vec<mint> ans(A);
    for (int i : irange(1, A + 1)) {
        const int a = (complement ? A - i : i);
        ans[a - 1] = restore_mod<mint>(
            ans0[i], ans1[i], ans2[i], ans3[i], ans4[i], ans5[i]);
    }
    out.ln(ans);
    return 0;
}
yukicoder

結果

ソースコード
