結果
問題 | No.1967 Sugoroku Optimization |
ユーザー | ___Johniel |
提出日時 | 2022-06-18 18:47:45 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 543 ms / 2,000 ms |
コード長 | 3,220 bytes |
コンパイル時間 | 1,928 ms |
コンパイル使用メモリ | 166,484 KB |
実行使用メモリ | 34,984 KB |
最終ジャッジ日時 | 2024-04-18 16:16:26 |
合計ジャッジ時間 | 6,548 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 10 ms
34,812 KB |
testcase_02 | AC | 9 ms
34,836 KB |
testcase_03 | AC | 543 ms
34,936 KB |
testcase_04 | AC | 11 ms
34,720 KB |
testcase_05 | AC | 489 ms
34,760 KB |
testcase_06 | AC | 514 ms
34,888 KB |
testcase_07 | AC | 11 ms
34,836 KB |
testcase_08 | AC | 362 ms
34,916 KB |
testcase_09 | AC | 276 ms
34,732 KB |
testcase_10 | AC | 127 ms
34,844 KB |
testcase_11 | AC | 25 ms
34,804 KB |
testcase_12 | AC | 335 ms
34,872 KB |
testcase_13 | AC | 168 ms
34,736 KB |
testcase_14 | AC | 19 ms
34,780 KB |
testcase_15 | AC | 19 ms
34,776 KB |
testcase_16 | AC | 24 ms
34,840 KB |
testcase_17 | AC | 27 ms
34,692 KB |
testcase_18 | AC | 11 ms
34,812 KB |
testcase_19 | AC | 10 ms
34,984 KB |
testcase_20 | AC | 539 ms
34,904 KB |
testcase_21 | AC | 10 ms
34,728 KB |
testcase_22 | AC | 2 ms
6,944 KB |
testcase_23 | AC | 333 ms
34,980 KB |
ソースコード
// yukicoder/1967/main.cpp // author: @___Johniel // github: https://github.com/johniel/ #include <bits/stdc++.h> #define each(i, c) for (auto& i : c) #define unless(cond) if (!(cond)) // #define endl "\n" using namespace std; template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << "," << p.second << ")"; return os; } template<typename P, typename Q> istream& operator >> (istream& is, pair<P, Q>& p) { is >> p.first >> p.second; return is; } template<typename T> ostream& operator << (ostream& os, vector<T> v) { os << "("; for (auto& i: v) os << i << ","; os << ")"; return os; } template<typename T> istream& operator >> (istream& is, vector<T>& v) { for (auto& i: v) is >> i; return is; } template<typename T> ostream& operator << (ostream& os, set<T> s) { os << "#{"; for (auto& i: s) os << i << ","; os << "}"; return os; } template<typename K, typename V> ostream& operator << (ostream& os, map<K, V> m) { os << "{"; for (auto& i: m) os << i << ","; os << "}"; return os; } template<typename E, size_t N> istream& operator >> (istream& is, array<E, N>& a) { for (auto& i: a) is >> i; return is; } template<typename E, size_t N> ostream& operator << (ostream& os, array<E, N>& a) { os << "[]{"; for (auto& i: a) os << i << ","; os << "}"; return os; } template<typename T> inline T setmax(T& a, T b) { return a = std::max(a, b); } template<typename T> inline T setmin(T& a, T b) { return a = std::min(a, b); } using lli = long long int; using ull = unsigned long long; using point = complex<double>; using str = string; template<typename T> using vec = vector<T>; constexpr array<int, 8> di({0, 1, -1, 0, 1, -1, 1, -1}); constexpr array<int, 8> dj({1, 0, 0, -1, 1, -1, -1, 1}); constexpr lli mod = 998244353; namespace math { lli extgcd(lli a, lli b, lli& x, lli& y) { lli g = a; x = 1; y = 0; if (b != 0) { g = extgcd(b, a % b, y, x); y -= (a / b) * x; } return g; } lli mod_inverse(lli a, lli m) { lli x, y; extgcd(a, m, x, y); return (m + x % m) % m; } lli mod_pow(lli n, lli p) { if (p == 0) return 1; if (p == 1) return n % mod; lli m = mod_pow(n, p / 2); m *= m; m %= mod; if (p % 2) m = (m * n) % mod; return m; } lli mod_pow(lli n, lli p, const lli mod) { if (p == 0) return 1; if (p == 1) return n % mod; lli m = mod_pow(n, p / 2, mod); m *= m; m %= mod; if (p % 2) m = (m * n) % mod; return m; } }; int main(int argc, char *argv[]) { ios_base::sync_with_stdio(0); cin.tie(0); cout.setf(ios_base::fixed); cout.precision(15); int n, k; while (cin >> n >> k) { if (n <= k) { cout << 1 << endl; continue; } const int N = 2000 + 3; const int K = 2000 + 3; static lli dp[K][N]; fill(&dp[0][0], &dp[K - 1][N - 1] + 1, 0); dp[0][0] = 1; for (int i = 0; i <= k; ++i) { lli x = 0; for (int j = 0; j <= n; ++j) { dp[i + 1][j] = x; (x += dp[i][j] * math::mod_inverse(n - j, mod) % mod) %= mod; } } lli z = 0; for (int i = 0; i <= k; ++i) { (z += dp[i][n]) %= mod; } cout << z << endl; } return 0; }