結果
問題 | No.2141 Enumeratest |
ユーザー | AngrySadEight |
提出日時 | 2022-12-02 21:32:13 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 742 ms / 2,000 ms |
コード長 | 3,241 bytes |
コンパイル時間 | 5,365 ms |
コンパイル使用メモリ | 301,800 KB |
実行使用メモリ | 26,768 KB |
最終ジャッジ日時 | 2024-04-27 04:18:24 |
合計ジャッジ時間 | 31,680 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 649 ms
19,004 KB |
testcase_01 | AC | 658 ms
18,928 KB |
testcase_02 | AC | 649 ms
19,308 KB |
testcase_03 | AC | 656 ms
18,948 KB |
testcase_04 | AC | 669 ms
26,736 KB |
testcase_05 | AC | 663 ms
26,768 KB |
testcase_06 | AC | 649 ms
18,952 KB |
testcase_07 | AC | 653 ms
18,984 KB |
testcase_08 | AC | 647 ms
19,032 KB |
testcase_09 | AC | 647 ms
19,036 KB |
testcase_10 | AC | 647 ms
19,016 KB |
testcase_11 | AC | 646 ms
18,940 KB |
testcase_12 | AC | 656 ms
18,928 KB |
testcase_13 | AC | 658 ms
18,960 KB |
testcase_14 | AC | 655 ms
18,796 KB |
testcase_15 | AC | 652 ms
19,024 KB |
testcase_16 | AC | 654 ms
18,856 KB |
testcase_17 | AC | 660 ms
23,868 KB |
testcase_18 | AC | 667 ms
25,320 KB |
testcase_19 | AC | 666 ms
25,756 KB |
testcase_20 | AC | 667 ms
24,456 KB |
testcase_21 | AC | 662 ms
25,064 KB |
testcase_22 | AC | 669 ms
23,424 KB |
testcase_23 | AC | 742 ms
21,068 KB |
testcase_24 | AC | 677 ms
20,488 KB |
testcase_25 | AC | 648 ms
19,056 KB |
testcase_26 | AC | 666 ms
25,876 KB |
testcase_27 | AC | 659 ms
24,960 KB |
testcase_28 | AC | 712 ms
26,492 KB |
testcase_29 | AC | 659 ms
22,924 KB |
testcase_30 | AC | 667 ms
25,952 KB |
testcase_31 | AC | 660 ms
23,632 KB |
testcase_32 | AC | 661 ms
24,428 KB |
testcase_33 | AC | 676 ms
23,472 KB |
testcase_34 | AC | 667 ms
23,096 KB |
testcase_35 | AC | 658 ms
19,236 KB |
testcase_36 | AC | 669 ms
26,160 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int,int> #define pil pair<int,ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int,int>> #define vpll vector<pair<ll,ll>> #define vvpii vector<vector<pair<int,int>>> #define vvpll vector<vector<pair<ll,ll>>> template<typename T> void debug(T e){ cerr << e << endl; } template<typename T> void debug(vector<T> &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template<typename T> void debug(vector<vector<T>> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template<typename T> void debug(vector<pair<T, T>> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template<typename T> void debug(set<T> &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(multiset<T> &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template<typename T> void debug(map<T, T> &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod){ // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0){ ret = 1; } else if (n % 2 == 1){ ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else{ ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } ll inv(ll x, ll mod){ return my_pow(x, mod - 2, mod); } int main(){ ll N,M; cin >> N >> M; vector<ll> fact(1000005); fact[0] = 1; for (ll i = 0; i < 1000004; i++) fact[i + 1] = (fact[i] * (i + 1)) % mod2; vector<ll> fact_inv(1000005); for (ll i = 0; i < 1000005; i++) fact_inv[i] = inv(fact[i], mod2); vector<ll> A(N); rep(i,N){ A[i] = (M + i) / N; } //debug(A); ll ans = 1; ll num = M; for (ll i = 0; i < N; i++){ ll ncr = 1; ncr = (ncr * fact[num]) % mod2; ncr = (ncr * fact_inv[num - A[i]]) % mod2; ncr = (ncr * fact_inv[A[i]]) % mod2; num -= A[i]; ans = (ans * ncr) % mod2; } cout << ans << endl; }