結果
問題 | No.2245 Second Smallest |
ユーザー |
![]() |
提出日時 | 2023-03-10 23:52:05 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 25 ms / 2,000 ms |
コード長 | 1,892 bytes |
コンパイル時間 | 2,803 ms |
コンパイル使用メモリ | 216,236 KB |
最終ジャッジ日時 | 2025-02-11 09:23:01 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
コンパイルメッセージ
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) { | ^~~~~
ソースコード
#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, k;cin >> h >> w >> k;mint ans;mint c = 1;int x = 1, y = h * w + k;for(int i = 0;; i++) {if (i > h || i > w) break;while(x < k + i) c *= x++;while(y > h * w - i + 1) c /= --y;ans += comb(h, i) * comb(w, i) * c;}ans *= mint(k) / (h * w + k);cout << ans.val() << endl;}