Codeforces Round #844 (Div. 1 + Div. 2, based on VK Cup 2022 - Elimination Round)

F.

题意:初始有空括号序列,现在执行n次操作,每次会等概率在序列的空位中插入'()'或者')(',概率分别是p和1-p.求最后构成合法括号序列的概率.

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
// namespace nqio { const unsigned R = 4e5, W = 4e5; char* a, * b, i[R], o[W], * c = o, * d = o + W, h[40], * p = h, y; bool s; struct q { void r(char& x) { x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++; } void f() { fwrite(o, 1, c - o, stdout); c = o; } ~q() { f(); }void w(char x) { *c = x; if (++c == d) f(); } q& operator >>(char& x) { do r(x); while (x <= 32); return *this; } q& operator >>(char* x) { do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this; } template<typename t> q& operator>>(t& x) { for (r(y), s = 0; !isdigit(y); r(y)) s |= y == 45; if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this; } q& operator <<(char x) { w(x); return *this; }q& operator<< (char* x) { while (*x) w(*x++); return *this; }q& operator <<(const char* x) { while (*x) w(*x++); return *this; }template<typename t> q& operator<< (t x) { if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p); return *this; } }qio; }using nqio::qio;
using namespace std;
const int N = 510, M = 1e5 + 10, MOD = 998244353;
int n, q, f[N][N], g[N][N];
int inv[M], fact[M], infact[M];
void init (int n) {
    fact[0] = infact[0] = inv[0] = inv[1] = 1;
    for (int i = 2; i <= n; ++ i) 
        inv[i] = 1ll * (MOD - MOD / i) * inv[MOD % i] % MOD;
    for (int i = 1; i <= n; ++ i) {
        fact[i] = 1ll * fact[i - 1] * i % MOD;
        infact[i] = 1ll * infact[i - 1] * inv[i] % MOD;
    }
}
int C(int n, int m) {
    if(n < m) return 0;
    if(m == 0 || n == m) return 1;
    return 1ll * fact[n] * infact[m] % MOD * infact[n - m] % MOD;
}
signed main() {
	IOS;
	init(M - 10);
	cin >> n >> q;
	int p = q * inv[10000] % MOD;
	for (int i = 0; i <= n; ++i) {
		f[0][i] = g[0][i] = 1;
	}
	for (int i = 1; i <= n; ++i) {
		for (int x = 0; x <= n - i; ++x) {
			for (int j = 0; j <= i - 1; ++j) {
				(f[i][x] += (p * f[j][x + 1] % MOD + (x == 0 ? 0 : (MOD + 1 - p) % MOD * f[j][x - 1]) % MOD) % MOD * C(i - 1, j) % MOD * g[i - j - 1][x] % MOD) %= MOD;
			}
			for (int j = 0; j <= i; ++j) {
				(g[i][x] += C(i, j) * f[j][x] % MOD * f[i - j][x] % MOD) %= MOD;
			}
		}
	}
	int ans = f[n][0];
	for (int i = 1; i <= 2 * n; i += 2) {
		(ans *= inv[i]) %= MOD;
	}
	cout << ans << "\n";
}