#710551 (C++17) No.1762 🐙🐄🌲

提出ソース

結果

問題	No.1762 🐙🐄🌲
ユーザー	tokusakurai
提出日時	2021-10-26 13:34:55
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	1,015 ms / 4,000 ms
コード長	10,072 bytes
コンパイル時間	2,361 ms
コンパイル使用メモリ	209,916 KB
実行使用メモリ	44,652 KB
最終ジャッジ日時	2023-09-02 00:08:06
合計ジャッジ時間	15,818 ms
ジャッジサーバーID （参考情報）	judge13 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	17 ms 10,812 KB
testcase_01	AC	17 ms 10,896 KB
testcase_02	AC	244 ms 20,800 KB
testcase_03	AC	16 ms 10,788 KB
testcase_04	AC	18 ms 11,280 KB
testcase_05	AC	16 ms 10,972 KB
testcase_06	AC	19 ms 11,100 KB
testcase_07	AC	17 ms 11,092 KB
testcase_08	AC	16 ms 10,860 KB
testcase_09	AC	19 ms 11,084 KB
testcase_10	AC	17 ms 11,076 KB
testcase_11	AC	17 ms 10,916 KB
testcase_12	AC	17 ms 10,792 KB
testcase_13	AC	482 ms 28,016 KB
testcase_14	AC	484 ms 27,756 KB
testcase_15	AC	482 ms 28,328 KB
testcase_16	AC	482 ms 27,524 KB
testcase_17	AC	484 ms 27,688 KB
testcase_18	AC	982 ms 44,184 KB
testcase_19	AC	1,015 ms 44,112 KB
testcase_20	AC	16 ms 10,808 KB
testcase_21	AC	16 ms 10,780 KB
testcase_22	AC	16 ms 10,908 KB
testcase_23	AC	16 ms 10,964 KB
testcase_24	AC	16 ms 10,796 KB
testcase_25	AC	16 ms 10,868 KB
testcase_26	AC	475 ms 28,544 KB
testcase_27	AC	485 ms 28,020 KB
testcase_28	AC	16 ms 10,988 KB
testcase_29	AC	17 ms 10,904 KB
testcase_30	AC	491 ms 28,356 KB
testcase_31	AC	16 ms 10,836 KB
testcase_32	AC	491 ms 27,512 KB
testcase_33	AC	16 ms 11,060 KB
testcase_34	AC	16 ms 10,848 KB
testcase_35	AC	16 ms 10,820 KB
testcase_36	AC	481 ms 27,864 KB
testcase_37	AC	16 ms 10,824 KB
testcase_38	AC	996 ms 44,652 KB
testcase_39	AC	16 ms 10,860 KB
testcase_40	AC	494 ms 27,988 KB
testcase_41	AC	17 ms 11,100 KB
testcase_42	AC	490 ms 28,080 KB
testcase_43	AC	16 ms 10,904 KB
testcase_44	AC	491 ms 28,612 KB
testcase_45	AC	17 ms 10,868 KB
testcase_46	AC	485 ms 27,820 KB
testcase_47	AC	16 ms 10,828 KB
testcase_48	AC	996 ms 44,140 KB
testcase_49	AC	16 ms 10,792 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

template <int mod>
struct Mod_Int {
    int x;

    Mod_Int() : x(0) {}

    Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    static int get_mod() { return mod; }

    Mod_Int &operator+=(const Mod_Int &p) {
        if ((x += p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator-=(const Mod_Int &p) {
        if ((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    Mod_Int &operator*=(const Mod_Int &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }

    Mod_Int &operator/=(const Mod_Int &p) {
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator++() { return *this += Mod_Int(1); }

    Mod_Int operator++(int) {
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator--() { return *this -= Mod_Int(1); }

    Mod_Int operator--(int) {
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator-() const { return Mod_Int(-x); }

    Mod_Int operator+(const Mod_Int &p) const { return Mod_Int(*this) += p; }

    Mod_Int operator-(const Mod_Int &p) const { return Mod_Int(*this) -= p; }

    Mod_Int operator*(const Mod_Int &p) const { return Mod_Int(*this) *= p; }

    Mod_Int operator/(const Mod_Int &p) const { return Mod_Int(*this) /= p; }

    bool operator==(const Mod_Int &p) const { return x == p.x; }

    bool operator!=(const Mod_Int &p) const { return x != p.x; }

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod - 2);
    }

    Mod_Int pow(long long k) const {
        Mod_Int now = *this, ret = 1;
        for (; k > 0; k >>= 1, now *= now) {
            if (k & 1) ret *= now;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const Mod_Int &p) { return os << p.x; }

    friend istream &operator>>(istream &is, Mod_Int &p) {
        long long a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

template <typename T>
struct Combination {
    static vector<T> _fac, _ifac;

    Combination() {}

    static void init(int n) {
        _fac.resize(n + 1), _ifac.resize(n + 1);
        _fac[0] = 1;
        for (int i = 1; i <= n; i++) _fac[i] = _fac[i - 1] * i;
        _ifac[n] = _fac[n].inverse();
        for (int i = n; i >= 1; i--) _ifac[i - 1] = _ifac[i] * i;
    }

    static T fac(int k) { return _fac[k]; }

    static T ifac(int k) { return _ifac[k]; }

    static T inv(int k) { return fac(k - 1) * ifac(k); }

    static T P(int n, int k) {
        if (k < 0 || n < k) return 0;
        return fac(n) * ifac(n - k);
    }

    static T C(int n, int k) {
        if (k < 0 || n < k) return 0;
        return fac(n) * ifac(n - k) * ifac(k);
    }

    static T H(int n, int k) { // k個の区別できない玉をn個の区別できる箱に入れる場合の数
        if (n < 0 || k < 0) return 0;
        return k == 0 ? 1 : C(n + k - 1, k);
    }

    static T second_stirling_number(int n, int k) { // n個の区別できる玉を、k個の区別しない箱に、各箱に1個以上玉が入るように入れる場合の数
        T ret = 0;
        for (int i = 0; i <= k; i++) {
            T tmp = C(k, i) * T(i).pow(n);
            ret += ((k - i) & 1) ? -tmp : tmp;
        }
        return ret * ifac(k);
    }

    static T bell_number(int n, int k) { // n個の区別できる玉を、k個の区別しない箱に入れる場合の数
        if (n == 0) return 1;
        k = min(k, n);
        vector<T> pref(k + 1);
        pref[0] = 1;
        for (int i = 1; i <= k; i++) {
            if (i & 1) {
                pref[i] = pref[i - 1] - ifac(i);
            } else {
                pref[i] = pref[i - 1] + ifac(i);
            }
        }
        T ret = 0;
        for (int i = 1; i <= k; i++) ret += T(i).pow(n) * ifac(i) * pref[k - i];
        return ret;
    }
};

template <typename T>
vector<T> Combination<T>::_fac = vector<T>();

template <typename T>
vector<T> Combination<T>::_ifac = vector<T>();

using comb = Combination<mint>;

template <typename T>
struct Number_Theoretic_Transform {
    static int max_base;
    static T root;
    static vector<T> r, ir;

    Number_Theoretic_Transform() {}

    static void init() {
        if (!r.empty()) return;
        int mod = T::get_mod();
        int tmp = mod - 1;
        root = 2;
        while (root.pow(tmp >> 1) == 1) root++;
        max_base = 0;
        while (tmp % 2 == 0) tmp >>= 1, max_base++;
        r.resize(max_base), ir.resize(max_base);
        for (int i = 0; i < max_base; i++) {
            r[i] = -root.pow((mod - 1) >> (i + 2)); // r[i]:=1の2^(i+2)乗根
            ir[i] = r[i].inverse();                 // ir[i]:=1/r[i]
        }
    }

    static void ntt(vector<T> &a) {
        init();
        int n = a.size();
        assert((n & (n - 1)) == 0);
        assert(n <= (1 << max_base));
        for (int k = n; k >>= 1;) {
            T w = 1;
            for (int s = 0, t = 0; s < n; s += 2 * k) {
                for (int i = s, j = s + k; i < s + k; i++, j++) {
                    T x = a[i], y = w * a[j];
                    a[i] = x + y, a[j] = x - y;
                }
                w *= r[__builtin_ctz(++t)];
            }
        }
    }

    static void intt(vector<T> &a) {
        init();
        int n = a.size();
        assert((n & (n - 1)) == 0);
        assert(n <= (1 << max_base));
        for (int k = 1; k < n; k <<= 1) {
            T w = 1;
            for (int s = 0, t = 0; s < n; s += 2 * k) {
                for (int i = s, j = s + k; i < s + k; i++, j++) {
                    T x = a[i], y = a[j];
                    a[i] = x + y, a[j] = w * (x - y);
                }
                w *= ir[__builtin_ctz(++t)];
            }
        }
        T inv = T(n).inverse();
        for (auto &e : a) e *= inv;
    }

    static vector<T> convolve(vector<T> a, vector<T> b) {
        int k = (int)a.size() + (int)b.size() - 1, n = 1;
        while (n < k) n <<= 1;
        a.resize(n), b.resize(n);
        ntt(a), ntt(b);
        for (int i = 0; i < n; i++) a[i] *= b[i];
        intt(a), a.resize(k);
        return a;
    }
};

template <typename T>
int Number_Theoretic_Transform<T>::max_base = 0;

template <typename T>
T Number_Theoretic_Transform<T>::root = T();

template <typename T>
vector<T> Number_Theoretic_Transform<T>::r = vector<T>();

template <typename T>
vector<T> Number_Theoretic_Transform<T>::ir = vector<T>();

using NTT = Number_Theoretic_Transform<mint>;

int main() {
    int N, P;
    cin >> N >> P;
    comb::init(1000000);

    if (N % 4 != 1) {
        cout << "0\n";
        return 0;
    }

    int M = (N - 1) / 4;

    if (M == 1) {
        cout << (P == 0 ? "5\n" : "0\n");
        return 0;
    }

    if (7 * P > M - 1) {
        cout << "0\n";
        return 0;
    }

    vector<vector<mint>> c(29, vector<mint>(5, 0));
    rep(i, 8) rep(j, 8) rep(k, 8) rep(l, 8) {
        int a = i + j + k + l;
        int b = (i == 7) + (j == 7) + (k == 7) + (l == 7);
        if (a == 0) continue;
        c[a][b] += comb::ifac(i) * comb::ifac(j) * comb::ifac(k) * comb::ifac(l) * a;
    }

    int n = 1;
    while (n <= 18 * (M - 1)) n <<= 1;
    vector<mint> f(n, 0);
    rep(i, 7) f[i] = comb::ifac(i);
    NTT::ntt(f);
    rep(i, n) f[i] = f[i].pow(3 * (M - 1) - P);
    NTT::intt(f);
    // print(f);

    mint ans = 0;

    rep(b, 5) {
        int L = P - b;
        if (L < 0) break;
        mint tmp = 0;
        rep(a, 29) {
            if (a == 0) continue;
            int K = M - 1 - a;
            int X = K - 7 * L;
            if (X >= 0 && X < n) tmp += f[X] * c[a][b];
        }
        ans += tmp * comb::C(3 * (M - 1), L) * comb::ifac(7).pow(L);
        f.resize(n + 6);
        rep3(i, n - 1, 0) rep3(j, 6, 1) f[i + j] += f[i] * comb::ifac(j);
        n += 6;
    }

    ans *= comb::C(N, M) * comb::fac(M - 2) * comb::fac(N - M);
    ans *= comb::ifac(3).pow(M - 1) * comb::ifac(4);
    cout << ans << '\n';
}

yukicoder

結果

テストケース

ソースコード