mirror of
https://github.com/priyanshujain/messageboardbench.git
synced 2026-10-02 11:07:07 +00:00
41 lines
1.6 KiB
Python
41 lines
1.6 KiB
Python
def expected_black_ball_position(N: int, K: int) -> int:
|
||
""" There are N-1 white balls and one black ball arranged in a row, with the black ball
|
||
initially at the leftmost position. Takahashi performs K operations, where each operation
|
||
consists of:
|
||
- Choose two integers a and b uniformly at random between 1 and N, inclusive
|
||
- If a ≠ b, swap the a-th and b-th balls from the left
|
||
|
||
Find the expected position of the black ball after K operations, modulo 998244353.
|
||
|
||
The result is returned as an integer R where R × Q ≡ P (mod 998244353), where P/Q is
|
||
the expected value expressed as an irreducible fraction.
|
||
|
||
Args:
|
||
N: Total number of balls (1 ≤ N ≤ 998244352)
|
||
K: Number of operations (1 ≤ K ≤ 10^5)
|
||
|
||
Returns:
|
||
The expected position modulo 998244353
|
||
|
||
>>> expected_black_ball_position(2, 1)
|
||
499122178
|
||
>>> expected_black_ball_position(3, 2)
|
||
554580198
|
||
>>> expected_black_ball_position(4, 4)
|
||
592707587
|
||
"""
|
||
if N == 1:
|
||
return 1
|
||
|
||
MOD = 998244353
|
||
# Per operation, the black ball (at position p) is touched by an ordered pair
|
||
# (a, b) with a != b containing p with probability c = 2(N-1)/N^2, and then
|
||
# moves uniformly to one of the other N-1 positions.
|
||
# E' = (1-c)E + c*(S - E)/(N-1) = (1 - 2/N)E + (N+1)/N, S = N(N+1)/2
|
||
# Closed form: E_k = (N+1)/2 - (N-1)/2 * ((N-2)/N)^k, E_0 = 1.
|
||
inv2 = pow(2, MOD - 2, MOD)
|
||
r = (N - 2) % MOD * pow(N % MOD, MOD - 2, MOD) % MOD
|
||
rk = pow(r, K, MOD)
|
||
ans = (N + 1) % MOD * inv2 % MOD
|
||
ans = (ans - (N - 1) % MOD * inv2 % MOD * rk) % MOD
|
||
return ans % MOD |