結果
問題 | No.2499 Sum of Products of Sums |
ユーザー | Kude |
提出日時 | 2023-10-07 01:17:39 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 124 ms / 2,000 ms |
コード長 | 2,129 bytes |
コンパイル時間 | 3,676 ms |
コンパイル使用メモリ | 283,108 KB |
実行使用メモリ | 11,340 KB |
最終ジャッジ日時 | 2024-07-26 17:40:07 |
合計ジャッジ時間 | 5,322 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 14 ms
11,208 KB |
testcase_01 | AC | 14 ms
11,212 KB |
testcase_02 | AC | 15 ms
11,200 KB |
testcase_03 | AC | 14 ms
11,212 KB |
testcase_04 | AC | 14 ms
11,204 KB |
testcase_05 | AC | 14 ms
11,208 KB |
testcase_06 | AC | 14 ms
11,208 KB |
testcase_07 | AC | 15 ms
11,340 KB |
testcase_08 | AC | 15 ms
11,212 KB |
testcase_09 | AC | 14 ms
11,208 KB |
testcase_10 | AC | 14 ms
11,336 KB |
testcase_11 | AC | 15 ms
11,208 KB |
testcase_12 | AC | 15 ms
11,200 KB |
testcase_13 | AC | 79 ms
11,208 KB |
testcase_14 | AC | 73 ms
11,208 KB |
testcase_15 | AC | 70 ms
11,204 KB |
testcase_16 | AC | 84 ms
11,212 KB |
testcase_17 | AC | 124 ms
11,336 KB |
testcase_18 | AC | 124 ms
11,204 KB |
testcase_19 | AC | 124 ms
11,208 KB |
コンパイルメッセージ
main.cpp:49:6: warning: '{anonymous}::mint {anonymous}::perm(int, int)' defined but not used [-Wunused-function] 49 | mint perm(int n, int k) { | ^~~~ main.cpp:48:6: warning: '{anonymous}::mint {anonymous}::fact(int)' defined but not used [-Wunused-function] 48 | mint fact(int n) {return Fact[n];} | ^~~~ main.cpp:44:6: warning: '{anonymous}::mint {anonymous}::icomb(int, int)' defined but not used [-Wunused-function] 44 | mint icomb(int n, int k) { | ^~~~~ main.cpp:37:6: warning: '{anonymous}::mint {anonymous}::comb(int, int)' defined but not used [-Wunused-function] 37 | mint comb(int n, int k) { | ^~~~
ソースコード
#include<bits/stdc++.h>namespace {#pragma GCC diagnostic ignored "-Wunused-function"#include<atcoder/all>#pragma GCC diagnostic warning "-Wunused-function"using namespace std;using namespace atcoder;#define rep(i,n) for(int i = 0; i < (int)(n); i++)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }using ll = long long;using P = pair<int,int>;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;using mint = modint998244353;constexpr int FACT_SIZE = 1000000;mint Fact[FACT_SIZE + 1];mint iFact[FACT_SIZE + 1];const auto fact_init = [] {Fact[0] = mint::raw(1);for(int i = 1; i <= FACT_SIZE; ++i) {Fact[i] = Fact[i-1] * i;}iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();for(int i = FACT_SIZE; i; --i) {iFact[i-1] = iFact[i] * i;}return false;}();mint comb(int n, int k) {if (k == 0) return mint::raw(1);assert(n >= 0 && k >= 0);if (k > n) return mint::raw(0);return Fact[n] * iFact[n - k] * iFact[k];}mint icomb(int n, int k) {return iFact[n] * Fact[n - k] * Fact[k];}mint fact(int n) {return Fact[n];}mint perm(int n, int k) {assert(0 <= n);return Fact[n] * iFact[n - k];}} int main() {ios::sync_with_stdio(false);cin.tie(0);int h, w;cin >> h >> w;vector<mint> f(w + 1);f[0] = 1;auto calc = [&](int b) {vector<mint> g(w + 1);mint p = 1;rrep(i, w) p *= b + w - i;rep(i, w + 1) {g[i] = p * iFact[w + i];p *= b - i;}return g;};rep(i, h) {int a, b;cin >> a >> b;auto g = calc(b);if (a) {auto g2 = calc(a - 1);rep(i, w + 1) g[i] -= g2[i];}rep(i, w + 1) g[i] *= iFact[i];f = convolution(f, g);f.resize(w + 1);}mint ans = f[w] * Fact[w];cout << ans.val() << '\n';}