結果
問題 | No.2164 Equal Balls |
ユーザー | t33f |
提出日時 | 2022-12-17 12:02:28 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,115 bytes |
コンパイル時間 | 800 ms |
コンパイル使用メモリ | 91,780 KB |
実行使用メモリ | 13,896 KB |
最終ジャッジ日時 | 2024-04-28 07:19:00 |
合計ジャッジ時間 | 73,827 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
7,884 KB |
testcase_01 | AC | 55 ms
7,756 KB |
testcase_02 | AC | 110 ms
7,756 KB |
testcase_03 | AC | 53 ms
7,696 KB |
testcase_04 | AC | 90 ms
7,760 KB |
testcase_05 | AC | 111 ms
7,752 KB |
testcase_06 | AC | 106 ms
7,756 KB |
testcase_07 | AC | 98 ms
7,760 KB |
testcase_08 | AC | 2,396 ms
7,888 KB |
testcase_09 | AC | 2,029 ms
7,888 KB |
testcase_10 | AC | 1,141 ms
7,760 KB |
testcase_11 | AC | 4,471 ms
7,888 KB |
testcase_12 | AC | 2,492 ms
7,888 KB |
testcase_13 | AC | 1,756 ms
7,760 KB |
testcase_14 | AC | 2,206 ms
7,628 KB |
testcase_15 | AC | 4,337 ms
7,760 KB |
testcase_16 | AC | 2,345 ms
7,888 KB |
testcase_17 | AC | 731 ms
7,764 KB |
testcase_18 | AC | 3,200 ms
7,888 KB |
testcase_19 | AC | 4,943 ms
8,016 KB |
testcase_20 | AC | 2,767 ms
7,764 KB |
testcase_21 | AC | 514 ms
7,892 KB |
testcase_22 | AC | 434 ms
7,760 KB |
testcase_23 | AC | 1,008 ms
8,732 KB |
testcase_24 | AC | 3,184 ms
8,360 KB |
testcase_25 | AC | 530 ms
8,660 KB |
testcase_26 | AC | 3,603 ms
8,016 KB |
testcase_27 | AC | 3,510 ms
8,332 KB |
testcase_28 | AC | 3,427 ms
8,352 KB |
testcase_29 | AC | 974 ms
8,064 KB |
testcase_30 | AC | 2,414 ms
8,372 KB |
testcase_31 | AC | 781 ms
8,988 KB |
testcase_32 | AC | 2,997 ms
8,432 KB |
testcase_33 | AC | 555 ms
8,388 KB |
testcase_34 | AC | 1,102 ms
8,576 KB |
testcase_35 | AC | 143 ms
7,924 KB |
testcase_36 | AC | 3,082 ms
9,324 KB |
testcase_37 | AC | 793 ms
9,344 KB |
testcase_38 | TLE | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
ソースコード
#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 = offset + step * t * 2; 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); } } }; 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]); vector<mint> qt(1 << 18, 1); 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]; for (int i = 0; i < m; ++i) { vector<mint> tmp(1 << 18, 0); for (int x = 300 - b[i]; x <= 300 + a[i]; ++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; } NTT::ntt(tmp, false); for (int j = 0; j < 1 << 18; ++j) qt[j] *= tmp[j]; } NTT::ntt(qt, true); const int offset = 300 * m; cout << qt[offset].value() << '\n'; }