結果

問題 No.2164 Equal Balls
ユーザー t33ft33f
提出日時 2022-12-17 13:24:28
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,035 ms / 5,000 ms
コード長 5,664 bytes
コンパイル時間 1,408 ms
コンパイル使用メモリ 100,344 KB
実行使用メモリ 14,648 KB
最終ジャッジ日時 2024-11-16 21:49:04
合計ジャッジ時間 38,842 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
5,248 KB
testcase_01 AC 4 ms
5,248 KB
testcase_02 AC 6 ms
5,248 KB
testcase_03 AC 4 ms
5,248 KB
testcase_04 AC 6 ms
5,248 KB
testcase_05 AC 7 ms
5,248 KB
testcase_06 AC 7 ms
5,248 KB
testcase_07 AC 7 ms
5,248 KB
testcase_08 AC 324 ms
6,856 KB
testcase_09 AC 266 ms
6,684 KB
testcase_10 AC 126 ms
5,808 KB
testcase_11 AC 721 ms
8,800 KB
testcase_12 AC 328 ms
6,852 KB
testcase_13 AC 234 ms
6,680 KB
testcase_14 AC 300 ms
6,920 KB
testcase_15 AC 701 ms
8,424 KB
testcase_16 AC 314 ms
6,860 KB
testcase_17 AC 87 ms
5,628 KB
testcase_18 AC 514 ms
8,492 KB
testcase_19 AC 791 ms
8,992 KB
testcase_20 AC 468 ms
9,080 KB
testcase_21 AC 47 ms
5,372 KB
testcase_22 AC 39 ms
5,376 KB
testcase_23 AC 145 ms
7,724 KB
testcase_24 AC 518 ms
9,168 KB
testcase_25 AC 54 ms
6,272 KB
testcase_26 AC 805 ms
12,968 KB
testcase_27 AC 763 ms
13,544 KB
testcase_28 AC 752 ms
13,040 KB
testcase_29 AC 150 ms
6,924 KB
testcase_30 AC 438 ms
9,160 KB
testcase_31 AC 99 ms
7,052 KB
testcase_32 AC 522 ms
9,684 KB
testcase_33 AC 68 ms
6,456 KB
testcase_34 AC 161 ms
7,624 KB
testcase_35 AC 12 ms
5,248 KB
testcase_36 AC 689 ms
14,648 KB
testcase_37 AC 69 ms
6,656 KB
testcase_38 AC 1,882 ms
13,748 KB
testcase_39 AC 1,884 ms
13,748 KB
testcase_40 AC 1,899 ms
13,880 KB
testcase_41 AC 1,876 ms
13,748 KB
testcase_42 AC 2,035 ms
13,692 KB
testcase_43 AC 2,035 ms
13,752 KB
testcase_44 AC 1,876 ms
13,880 KB
testcase_45 AC 1,895 ms
13,880 KB
testcase_46 AC 1,895 ms
13,748 KB
testcase_47 AC 1,889 ms
13,880 KB
testcase_48 AC 1,925 ms
13,880 KB
testcase_49 AC 608 ms
6,272 KB
testcase_50 AC 614 ms
6,272 KB
testcase_51 AC 613 ms
6,400 KB
testcase_52 AC 607 ms
6,528 KB
testcase_53 AC 613 ms
6,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <queue>
#include <array>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <vector>
#include <iostream>
using namespace std;

template<int mod>
class modint {
    int val = 0;
    constexpr static int normalize(long long x) {
        if (0 <= x and x < mod) return static_cast<int>(x);
        else { x %= mod; return static_cast<int>(x >= 0 ? x : x + mod); }
    }
public:
    static const int modulus = mod;
    modint() {}
    constexpr modint(long long n) : val(normalize(n)) {}
    constexpr int value() const { return val; }
    constexpr modint operator-() const { return modint(mod - val); }
    constexpr modint inverse() const {
        long long x = mod, y = val, p = 1, q = 0, r = 0, s = 1;
        while (y != 0) {
            long long u = x / y;
            long long x0 = y; y = x - y * u; x = x0;
            long long r0 = p - r * u, s0 = q - s * u;
            p = r; r = r0; q = s; s = s0;
        }
        return modint(q);
    }
    constexpr const modint pow(long long e) const {
        if (e < 0) return pow(-e).inverse();
        long long ans = 1, p = val;
        while (e > 0) {
            if (e % 2 != 0) ans = (ans * p) % mod;
            p = (p * p) % mod;
            e >>= 1;
        }
        return modint(ans);
    }
    constexpr modint &operator+=(const modint r) {
        val += r.value();
        if (val >= mod) val -= mod;
        return *this;
    }
    constexpr modint &operator-=(const modint r) {
        val -= r.value();
        if (val < 0) val += mod;
        return *this;
    }
    constexpr modint &operator*=(const modint r) {
        val = (long long)val * r.value() % mod;
        return *this;
    }
    constexpr modint &operator/=(const modint r) {
        if (r.value() == 2) {
            val = (val % 2 ? val + mod : val) / 2;
        } else {
            val = (long long)val * r.inverse().value() % mod;
        }
        return *this;
    }

    friend constexpr modint operator+(const modint l, const modint r) {
        const int newval = l.value() + r.value();
        return newval >= mod ? newval - mod : newval;
    }
    friend constexpr modint operator-(const modint l, const modint r) { return l + (- r); }
    friend constexpr modint operator*(const modint l, const modint r) { return (long long)l.value() * r.value(); }
    friend constexpr modint operator/(const modint l, const modint r) { return l * r.inverse(); }
    friend constexpr bool operator==(const modint l, const modint r) { return l.value() == r.value(); }
    friend constexpr bool operator!=(const modint l, const modint r) { return l.value() != r.value(); }
};

constexpr int M = 998244353;
using mint = modint<M>;

namespace NTT {
template<typename T>
constexpr bool is_primitive_root(int i) {
    constexpr int p = T::modulus;
    int d = 2, r = p - 1;
    while ((long long)d * d <= r) {
        if (r % d == 0) {
            if (T(i).pow((p - 1) / d).value() == 1) return false;
            do { r /= d; } while (r % d == 0);
        }
        d++;
    }
    if (r > 1 and T(i).pow((p - 1) / r).value() == 1) return false;
    return true;
}

template<typename T>
constexpr T primitive_root() {
    constexpr int p = T::modulus;
    for (int i = 2; i < p; i++) if (is_primitive_root<T>(i)) return i;
    return 0;
}

template<typename T>
void ntt(vector<T> &a, bool inv) {
    constexpr int p = T::modulus;
    constexpr T r = primitive_root<T>();
    const int n = int(a.size());
    assert((p - 1) % n == 0);
    const int expn = (p - 1) / n * (inv ? -1 : 1);
    const T zn = r.pow(expn);
    auto b = a;
    for (int step = n / 2; step > 0; step /= 2) {
        const T wn = zn.pow(step);
        T w = 1;
        for (int t = 0, tmax = n / step / 2; t < tmax; t++) {
            for (int offset = 0; offset < step; offset++) {
                const int i = offset + step * t, j = i + step * t;
                assert(j + step < n);
                const T x = a[j], y = w * a[j + step];
                b[i] = x + y;
                b[i + n/2] = x - y;
            }
            w *= wn;
        }
        if (inv) for (int i = 0; i < n; i++) b[i] /= 2;
        swap(a, b);
    }
}
};

template<typename T>
void convolution_inplace(vector<T>& a, vector<T>& b) {
    int n = 1;
    while (n < a.size() + b.size()) n <<= 1;
    a.resize(n);
    b.resize(n);

    NTT::ntt(a, false);
    NTT::ntt(b, false);
    for (int i = 0; i < n; i++) a[i] *= b[i];
    NTT::ntt(a, true);
}


int main() {
    int n, m; scanf("%d %d", &n, &m);
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) scanf(" %d", &a[i]);
    for (int i = 0; i < n; i++) scanf(" %d", &b[i]);

    array<array<mint, 601>, 601> comb;
    for (int i = 0; i < 601; ++i)
        for (int j = 0; j < 601; ++j)
            if (j == 0) comb[i][j] = 1;
            else if (i == 0) comb[i][j] = 0;
            else comb[i][j] = comb[i-1][j] + comb[i-1][j-1];

    queue<vector<mint>> que;
    const int offset = 300 * m;
    for (int i = 0; i < m; ++i) {
        vector<mint> tmp(601, 0);
        int xmin = 0, xmax = 600;
        for (int j = i; j < n; j += m)
            xmin = max(xmin, 300 - b[j]), xmax = min(xmax, 300 + a[j]);
        for (int x = xmin; x <= xmax; ++x)  {
            mint t = 1;
            for (int j = i; j < n; j += m)
                t *= comb[a[j] + b[j]][x - 300 + b[j]];
            tmp[x] = t;
        }
        que.push(tmp);
    }

    while (que.size() > 1) {
        vector<mint> f = que.front();
        que.pop();
        vector<mint> g = que.front();
        que.pop();
        convolution_inplace(f, g);
        que.push(f);
    }
    cout << que.front()[offset].value() << '\n';
}
0