結果
問題 | No.2613 Sum of Combination |
ユーザー | Kude |
提出日時 | 2024-01-19 22:54:14 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 167 ms / 4,500 ms |
コード長 | 2,292 bytes |
コンパイル時間 | 3,395 ms |
コンパイル使用メモリ | 285,112 KB |
実行使用メモリ | 21,156 KB |
最終ジャッジ日時 | 2024-01-19 22:54:24 |
合計ジャッジ時間 | 8,956 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 5 ms
11,332 KB |
testcase_01 | AC | 5 ms
11,332 KB |
testcase_02 | AC | 7 ms
11,588 KB |
testcase_03 | AC | 4 ms
11,332 KB |
testcase_04 | AC | 4 ms
11,332 KB |
testcase_05 | AC | 4 ms
11,332 KB |
testcase_06 | AC | 4 ms
11,332 KB |
testcase_07 | AC | 5 ms
11,332 KB |
testcase_08 | AC | 5 ms
11,332 KB |
testcase_09 | AC | 4 ms
11,332 KB |
testcase_10 | AC | 4 ms
11,332 KB |
testcase_11 | AC | 4 ms
11,332 KB |
testcase_12 | AC | 4 ms
11,332 KB |
testcase_13 | AC | 8 ms
11,588 KB |
testcase_14 | AC | 8 ms
11,588 KB |
testcase_15 | AC | 7 ms
11,460 KB |
testcase_16 | AC | 9 ms
11,588 KB |
testcase_17 | AC | 10 ms
11,588 KB |
testcase_18 | AC | 8 ms
11,588 KB |
testcase_19 | AC | 9 ms
11,588 KB |
testcase_20 | AC | 5 ms
11,332 KB |
testcase_21 | AC | 4 ms
11,332 KB |
testcase_22 | AC | 14 ms
11,716 KB |
testcase_23 | AC | 158 ms
20,560 KB |
testcase_24 | AC | 159 ms
20,544 KB |
testcase_25 | AC | 155 ms
19,880 KB |
testcase_26 | AC | 159 ms
21,104 KB |
testcase_27 | AC | 73 ms
16,232 KB |
testcase_28 | AC | 158 ms
21,056 KB |
testcase_29 | AC | 163 ms
20,816 KB |
testcase_30 | AC | 157 ms
21,116 KB |
testcase_31 | AC | 161 ms
20,764 KB |
testcase_32 | AC | 155 ms
20,676 KB |
testcase_33 | AC | 155 ms
21,156 KB |
testcase_34 | AC | 157 ms
21,156 KB |
testcase_35 | AC | 159 ms
21,156 KB |
testcase_36 | AC | 159 ms
21,156 KB |
testcase_37 | AC | 167 ms
21,156 KB |
testcase_38 | AC | 156 ms
21,020 KB |
testcase_39 | AC | 156 ms
21,040 KB |
testcase_40 | AC | 156 ms
21,040 KB |
testcase_41 | AC | 157 ms
21,088 KB |
testcase_42 | AC | 159 ms
21,076 KB |
testcase_43 | AC | 155 ms
21,156 KB |
testcase_44 | AC | 161 ms
21,156 KB |
testcase_45 | AC | 5 ms
11,332 KB |
testcase_46 | AC | 4 ms
11,332 KB |
testcase_47 | AC | 4 ms
11,332 KB |
testcase_48 | AC | 3 ms
11,332 KB |
testcase_49 | AC | 4 ms
11,332 KB |
testcase_50 | AC | 143 ms
21,156 KB |
testcase_51 | AC | 151 ms
21,156 KB |
コンパイルメッセージ
main.cpp:52:7: warning: '{anonymous}::dmint {anonymous}::perm(int, int)' defined but not used [-Wunused-function] 52 | dmint perm(int n, int k) { | ^~~~ main.cpp:51:7: warning: '{anonymous}::dmint {anonymous}::fact(int)' defined but not used [-Wunused-function] 51 | dmint fact(int n) {return Fact[n];} | ^~~~ main.cpp:47:7: warning: '{anonymous}::dmint {anonymous}::icomb(int, int)' defined but not used [-Wunused-function] 47 | dmint 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; using dmint = modint; int p; constexpr int FACT_SIZE = 1000000; dmint Fact[FACT_SIZE + 1]; dmint iFact[FACT_SIZE + 1]; const auto fact_init = [] { int FACT_SIZE = p - 1; Fact[0] = dmint::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; }; dmint comb(int n, int k) { if (k == 0) return dmint::raw(1); assert(n >= 0 && k >= 0); if (k > n) return dmint::raw(0); return Fact[n] * iFact[n - k] * iFact[k]; } dmint icomb(int n, int k) { return iFact[n] * Fact[n - k] * Fact[k]; } dmint fact(int n) {return Fact[n];} dmint perm(int n, int k) { assert(0 <= n); return Fact[n] * iFact[n - k]; } } int main() { ios::sync_with_stdio(false); cin.tie(0); ll n; cin >> n >> p; dmint::set_mod(p); fact_init(); int r = internal::primitive_root_constexpr(p); VI val2e(p), e2val(p); { int v = 1; for (int e = 0; e < p - 1; e++) { val2e[v] = e; e2val[e] = v; v = ll(v * r) % p; } assert(v == 1); } vector<mint> f(p - 1); f[0] = 1; while (n) { int m = n % p; n /= p; vector<mint> g(p - 1); rep(i, m + 1) g[val2e[comb(m, i).val()]]++; f = convolution(f, g); while (ssize(f) > p - 1) { f[ssize(f) - 1 - (p - 1)] += f[ssize(f) - 1]; f.pop_back(); } } mint ans; rep(e, p - 1) ans += e2val[e] * f[e]; cout << ans.val() << '\n'; }