結果
問題 | No.2164 Equal Balls |
ユーザー | minato |
提出日時 | 2023-01-28 22:21:51 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 757 ms / 5,000 ms |
コード長 | 9,396 bytes |
コンパイル時間 | 3,771 ms |
コンパイル使用メモリ | 252,552 KB |
実行使用メモリ | 9,992 KB |
最終ジャッジ日時 | 2024-06-28 23:50:58 |
合計ジャッジ時間 | 23,203 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 3 ms
6,940 KB |
testcase_07 | AC | 3 ms
6,944 KB |
testcase_08 | AC | 43 ms
6,940 KB |
testcase_09 | AC | 31 ms
6,940 KB |
testcase_10 | AC | 18 ms
6,940 KB |
testcase_11 | AC | 79 ms
6,944 KB |
testcase_12 | AC | 43 ms
6,940 KB |
testcase_13 | AC | 27 ms
6,944 KB |
testcase_14 | AC | 34 ms
6,940 KB |
testcase_15 | AC | 75 ms
6,944 KB |
testcase_16 | AC | 41 ms
6,944 KB |
testcase_17 | AC | 10 ms
6,940 KB |
testcase_18 | AC | 56 ms
6,940 KB |
testcase_19 | AC | 90 ms
7,532 KB |
testcase_20 | AC | 46 ms
6,940 KB |
testcase_21 | AC | 7 ms
6,944 KB |
testcase_22 | AC | 7 ms
6,940 KB |
testcase_23 | AC | 308 ms
6,940 KB |
testcase_24 | AC | 236 ms
8,480 KB |
testcase_25 | AC | 268 ms
6,940 KB |
testcase_26 | AC | 147 ms
8,304 KB |
testcase_27 | AC | 277 ms
8,928 KB |
testcase_28 | AC | 284 ms
8,776 KB |
testcase_29 | AC | 110 ms
6,944 KB |
testcase_30 | AC | 249 ms
6,940 KB |
testcase_31 | AC | 375 ms
6,940 KB |
testcase_32 | AC | 314 ms
8,656 KB |
testcase_33 | AC | 203 ms
6,940 KB |
testcase_34 | AC | 278 ms
6,944 KB |
testcase_35 | AC | 54 ms
6,944 KB |
testcase_36 | AC | 529 ms
9,460 KB |
testcase_37 | AC | 421 ms
6,944 KB |
testcase_38 | AC | 744 ms
9,856 KB |
testcase_39 | AC | 747 ms
9,988 KB |
testcase_40 | AC | 739 ms
9,992 KB |
testcase_41 | AC | 739 ms
9,988 KB |
testcase_42 | AC | 757 ms
9,988 KB |
testcase_43 | AC | 745 ms
9,856 KB |
testcase_44 | AC | 745 ms
9,860 KB |
testcase_45 | AC | 756 ms
9,860 KB |
testcase_46 | AC | 755 ms
9,860 KB |
testcase_47 | AC | 738 ms
9,860 KB |
testcase_48 | AC | 750 ms
9,860 KB |
testcase_49 | AC | 649 ms
6,940 KB |
testcase_50 | AC | 644 ms
6,940 KB |
testcase_51 | AC | 636 ms
6,944 KB |
testcase_52 | AC | 634 ms
6,944 KB |
testcase_53 | AC | 635 ms
6,944 KB |
ソースコード
#line 1 "library-cpp/other/template.hpp" // clang-format off #include <bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<long long, long long>; template <class T> using maxheap = priority_queue<T>; template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <class T> using vec = vector<T>; template <class T> using vvec = vector<vector<T>>; #define OVERLOAD_REP(_1, _2, _3, name, ...) name #define REP0(n) for (auto minato = decay_t<decltype(n)>{}; minato < (n); ++minato) #define REP1(i, n) for (auto i = decay_t<decltype(n)>{}; (i) < (n); (i)++) #define REP2(i, l, r) for (auto i = (l); (i) < (r); (i)++) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__) #define OVERLOAD_RREP(_1, _2, _3, name, ...) name #define RREP1(i, n) for (auto i = (n) - 1; (i) >= decay_t<decltype(n)>{}; (i)--) #define RREP2(i, l, r) for (auto i = (r) - 1; (i) >= (l); (i)--) #define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__) #define all(x) begin(x), end(x) template <class Container> int SZ(const Container& v) { return int(v.size()); } template <class T> void UNIQUE(vector<T>& v) { v.erase(unique(v.begin(), v.end()), v.end()); } template <class T> T MAX(const vector<T>& v) { return *max_element(v.begin(), v.end()); } template <class T> T MIN(const vector<T>& v) { return *min_element(v.begin(), v.end()); } template <class T> T SUM(const vector<T>& v) { return *accumulate(v.begin(), v.end(), T(0)); } template <class T1, class T2> bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } template <class T1, class T2> bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } int topbit(ull x) { return x == 0 ? -1 : 63 - __builtin_clzll(x); } int botbit(ull x) { return x == 0 ? 64 : __builtin_ctzll(x); } int popcount(ull x) { return __builtin_popcountll(x); } int kthbit(ull x, int k) { return (x >> k) & 1; } constexpr long long TEN(int x) { return x == 0 ? 1 : TEN(x - 1) * 10; } template <typename S> void rearrange(const vector<S>& id) {} template <typename S, typename T> void rearrange_exec(const vector<S>& id, vector<T>& v) { vector<T> w(v.size()); for (size_t i = 0; i < id.size(); i++) { w[i] = v[id[i]]; } v.swap(w); } template <typename S, typename Head, typename... Tail> void rearrange(const vector<S>& id, Head& a, Tail& ...tail) { rearrange_exec(id, a); rearrange(id, tail...); } constexpr char ln = '\n'; const string YESNO[2] = {"NO", "YES"}; const string YesNo[2] = {"No", "Yes"}; void YES(bool t = true) { cout << YESNO[t] << "\n"; } void Yes(bool t = true) { cout << YesNo[t] << "\n"; } template <class T> void drop(T x) { cout << x << "\n"; exit(0); } #define INT(...) \ int __VA_ARGS__; \ IN(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ IN(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ IN(__VA_ARGS__) #define CHR(...) \ char __VA_ARGS__; \ IN(__VA_ARGS__) #define LDB(...) \ long double __VA_ARGS__; \ IN(__VA_ARGS__) #define VEC(type, name, size) \ vector<type> name(size); \ IN(name) #define VEC2(type, name1, name2, size) \ vector<type> name1(size), name2(size); \ for (int i = 0; i < size; i++) IN(name1[i], name2[i]) #define VEC3(type, name1, name2, name3, size) \ vector<type> name1(size), name2(size), name3(size); \ for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i]) #define VEC4(type, name1, name2, name3, name4, size) \ vector<type> name1(size), name2(size), name3(size), name4(size); \ for (int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]); #define VV(type, name, N, M) \ vector<vector<type>> name(N, vector<type>(M)); \ IN(name) template <class T> void scan(T& a) { cin >> a; } template <class T> void scan(vector<T>& a) { for (auto& i : a) scan(i); } void IN() {} template <class Head, class... Tail> void IN(Head& head, Tail&... tail) { scan(head); IN(tail...); } void print() { cout << "\n"; } template <class T> void print(const vector<T>& v) { for (auto it = v.begin(); it != v.end(); ++it) { if (it != v.begin()) { cout << " "; } cout << *it; } print(); } template <class T, class... Args> void print(const T& x, const Args& ... args) { cout << x; if (sizeof...(Args)) cout << " "; print(args...); } #ifdef MINATO_LOCAL template <class T1, class T2> ostream& operator<<(ostream& os, pair<T1, T2> p) { return os << "(" << p.first << ", " << p.second << ")"; } template <size_t N, class TUPLE> void debug_tuple(ostream& os, TUPLE _) { (void)os; (void)_; } template <size_t N, class TUPLE, class T, class ...Args> void debug_tuple(ostream &os, TUPLE t) { os << (N == 0 ? "" : ", ") << get<N>(t); debug_tuple<N + 1, TUPLE, Args...>(os, t); } template <class ...Args> ostream& operator<<(ostream& os, tuple<Args...> t) { os << "("; debug_tuple<0, tuple<Args...>, Args...>(os, t); return os << ")"; } string debug_delim(int& i) { return i++ == 0 ? "" : ", "; } #define debug_embrace(x) { int i = 0; os << "{"; { x } return os << "}"; } template <class T> ostream& operator<<(ostream& os, vector<T> v) { debug_embrace( for (T e : v) { os << debug_delim(i) << e; } ) } template <class T, size_t N> ostream& operator<<(ostream& os, array<T, N> a) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class T, size_t N> enable_if_t<!is_same_v<char, remove_cv_t<T>>, ostream>& operator<<(ostream& os, T(&a)[N]) { debug_embrace( for (T e : a) { os << debug_delim(i) << e; } ) } template <class Key> ostream& operator<<(ostream& os, set<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class Key, class T> ostream& operator<<(ostream& os, map<Key, T> mp) { debug_embrace( for (auto e : mp) { os << debug_delim(i) << e; }) } template <class Key> ostream& operator<<(ostream& os, multiset<Key> s) { debug_embrace( for (Key e : s) { os << debug_delim(i) << e; }) } template <class T> ostream& operator<<(ostream& os, queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.front(); } ) } template <class T> ostream& operator<<(ostream& os, deque<T> q) { debug_embrace( for (T e : q) { os << debug_delim(i) << e; } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } template <class T> ostream& operator<<(ostream& os, priority_queue<T, vector<T>, greater<T>> q) { debug_embrace( for (; !q.empty(); q.pop()) { os << debug_delim(i) << q.top(); } ) } void debug_out() { cerr << endl; } template <class T, class... Args> void debug_out(const T& x, const Args& ... args) { cerr << " " << x; debug_out(args...); } #define debug(...) cerr << __LINE__ << " : [" << #__VA_ARGS__ << "] =", debug_out(__VA_ARGS__) #else #define debug(...) (void(0)) #endif struct fast_ios { fast_ios() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(7); }; } fast_ios_; /////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// // clang-format on #line 2 "A.cpp" #include <atcoder/convolution> template <class M> struct ModCombination { public: ModCombination() { } ModCombination(int n) : n_(n), fac_(n + 1), facinv_(n + 1) { assert(1 <= n); fac_[0] = 1; for (int i = 1; i <= n; i++) fac_[i] = fac_[i - 1] * i; facinv_[n] = M(1) / fac_[n]; for (int i = n; i >= 1; i--) facinv_[i - 1] = facinv_[i] * i; } M fac(int k) const { assert(0 <= k and k <= n_); return fac_[k]; } M facinv(int k) const { assert(0 <= k and k <= n_); return facinv_[k]; } M inv(int k) const { assert(1 <= k and k <= n_); return facinv_[k] * fac_[k - 1]; } M P(int n, int k) const { if (k < 0 or k > n) return M(0); assert(n <= n_); return fac_[n] * facinv_[n - k]; } M C(int n, int k) const { if (k < 0 or k > n) return M(0); assert(n <= n_); return fac_[n] * facinv_[n - k] * facinv_[k]; } M H(int n, int k) const { if (n == 0 and k == 0) return M(1); return C(n + k - 1, n); } M catalan(int n) const { if (n == 0) return M(1); return C(2 * n, n) - C(2 * n, n - 1); } private: int n_; vector<M> fac_, facinv_; }; using mint = atcoder::modint998244353; void solve() { ModCombination<mint> MC(10000); INT(N, M); VEC(int, A, N); VEC(int, B, N); vvec<mint> C(M, vec<mint>(601, 1)); rep(i, N) { int k = i % M; rep(j, 601) { C[k][j] *= MC.C(A[i] + B[i], j + B[i] - 300); } } queue<vec<mint>> que; rep(i, M) que.emplace(C[i]); while (SZ(que) >= 2) { auto X = que.front(); que.pop(); auto Y = que.front(); que.pop(); que.emplace(atcoder::convolution(X, Y)); } cout << que.front()[300 * M].val() << ln; } int main() { int T = 1; // cin >> T; for (int i = 0; i < T; i++) { solve(); } }