結果
問題 | No.2874 Gunegune Tree |
ユーザー | Today03 |
提出日時 | 2024-09-07 12:03:31 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 3,260 bytes |
コンパイル時間 | 3,299 ms |
コンパイル使用メモリ | 250,148 KB |
実行使用メモリ | 17,248 KB |
最終ジャッジ日時 | 2024-09-07 12:03:36 |
合計ジャッジ時間 | 4,823 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 4 ms
6,944 KB |
testcase_04 | AC | 12 ms
9,088 KB |
testcase_05 | AC | 6 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 24 ms
16,352 KB |
testcase_08 | AC | 13 ms
9,472 KB |
testcase_09 | AC | 3 ms
6,944 KB |
testcase_10 | AC | 21 ms
14,324 KB |
testcase_11 | AC | 18 ms
12,032 KB |
testcase_12 | AC | 7 ms
6,940 KB |
testcase_13 | AC | 24 ms
16,264 KB |
testcase_14 | AC | 21 ms
13,952 KB |
testcase_15 | AC | 5 ms
6,940 KB |
testcase_16 | AC | 25 ms
16,836 KB |
testcase_17 | AC | 5 ms
6,940 KB |
testcase_18 | AC | 5 ms
6,940 KB |
testcase_19 | AC | 4 ms
6,940 KB |
testcase_20 | AC | 4 ms
6,944 KB |
testcase_21 | AC | 10 ms
7,680 KB |
testcase_22 | AC | 14 ms
9,856 KB |
testcase_23 | AC | 9 ms
7,424 KB |
testcase_24 | AC | 11 ms
8,704 KB |
testcase_25 | AC | 19 ms
12,672 KB |
testcase_26 | AC | 13 ms
9,088 KB |
testcase_27 | AC | 25 ms
16,592 KB |
testcase_28 | AC | 8 ms
6,940 KB |
testcase_29 | AC | 15 ms
11,008 KB |
testcase_30 | AC | 13 ms
9,344 KB |
testcase_31 | AC | 10 ms
7,808 KB |
testcase_32 | AC | 26 ms
17,248 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; const int INF = 1e9 + 10; const ll INFL = 4e18; /* dp[i][j]:=i日たったときに、向きがj(上、右上、左上、右、左)である確率 N日全体を通してのY方向の座標の増分の総和の期待値 =それぞれの日のY方向の座標の増分の期待値の総和 =それぞれの日のY方向の座標が+1される確率の総和 */ template <ll MOD> struct ModInt { ll value; ModInt(ll x = 0) { if (x >= 0) { value = x % MOD; } else { value = MOD - (-x) % MOD; } } ModInt operator-() const { return ModInt(-value); } ModInt operator+() const { return ModInt(*this); } ModInt &operator+=(const ModInt &other) { value += other.value; if (value >= MOD) { value -= MOD; } return *this; } ModInt &operator-=(const ModInt &other) { value += MOD - other.value; if (value >= MOD) { value -= MOD; } return *this; } ModInt &operator*=(const ModInt other) { value = value * other.value % MOD; return *this; } ModInt &operator/=(ModInt other) { (*this) *= other.inv(); return *this; } ModInt operator+(const ModInt &other) const { return ModInt(*this) += other; } ModInt operator-(const ModInt &other) const { return ModInt(*this) -= other; } ModInt operator*(const ModInt &other) const { return ModInt(*this) *= other; } ModInt operator/(const ModInt &other) const { return ModInt(*this) /= other; } ModInt pow(ll x) const { ModInt ret(1), mul(value); while (x) { if (x & 1) { ret *= mul; } mul *= mul; x >>= 1; } return ret; } ModInt inv() const { return pow(MOD - 2); } bool operator==(const ModInt &other) const { return value == other.value; } bool operator!=(const ModInt &other) const { return value != other.value; } friend ostream &operator<<(ostream &os, const ModInt &x) { return os << x.value; } friend istream &operator>>(istream &is, ModInt &x) { ll v; is >> v; x = ModInt<MOD>(v); return is; } static constexpr ll get_mod() { return MOD; } }; using Mod998 = ModInt<998244353>; using Mod107 = ModInt<1000000007>; using mint = Mod998; int main() { int N; cin >> N; mint inv2 = mint(1) / 2, inv3 = mint(1) / 3; vector<vector<mint>> dp(N + 1, vector<mint>(5)); dp[1][0] = dp[1][1] = dp[1][2] = dp[1][3] = dp[1][4] = mint(1) / 5; for (int i = 1; i < N; i++) { for (int j = 0; j < 5; j++) { mint c = j == 0 || j == 4 ? inv2 : inv3; if (j > 0) dp[i + 1][j - 1] += dp[i][j] * c; dp[i + 1][j] += dp[i][j] * c; if (j < 4) dp[i + 1][j + 1] += dp[i][j] * c; } } mint ans = 0; for (int i = 1; i <= N; i++) { for (int j = 1; j < 4; j++) { ans += dp[i][j]; } } cout << ans << endl; }