結果
問題 | No.2872 Depth of the Parentheses |
ユーザー |
![]() |
提出日時 | 2024-09-06 22:18:35 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,995 bytes |
コンパイル時間 | 2,981 ms |
コンパイル使用メモリ | 253,724 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-06 22:18:46 |
合計ジャッジ時間 | 9,414 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 20 MLE * 5 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;const int INF = 1e9 + 10;const ll INFL = 4e18;/*dp[i][j][k]:=前からi番目までみていて、現在の深さがjであって、深さの最大値がkであるような確率*/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 X, K;cin >> X >> K;mint up = X, dw = 100 - X;up /= 100;dw /= 100;vector dp(2 * K + 1, vector(2 * K + 10, vector<mint>(2 * K + 10)));dp[0][0][0] = 1;for (int i = 0; i < 2 * K; i++) {for (int j = 0; j <= i; j++) {for (int k = 0; k <= i; k++) {dp[i + 1][j + 1][max(k, j + 1)] += dp[i][j][k] * up;if (j > 0) dp[i + 1][j - 1][k] += dp[i][j][k] * dw;}}}mint ans = 0;for (int i = 0; i <= 2 * K; i++) ans += dp[2 * K][0][i] * i;cout << ans << endl;}