結果

問題 No.1554 array_and_me
ユーザー tamato
提出日時 2021-06-18 23:15:42
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 499 ms / 2,000 ms
コード長 1,315 bytes
コンパイル時間 155 ms
コンパイル使用メモリ 82,688 KB
実行使用メモリ 92,544 KB
最終ジャッジ日時 2024-06-22 21:24:52
合計ジャッジ時間 15,417 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

mod = 998244353
eps = 10**-9
def main():
import sys
from heapq import heappop, heappush
input = sys.stdin.readline
# comb init
nmax = 10 ** 5 + 10 # change here
fac = [0] * nmax
finv = [0] * nmax
inv = [0] * nmax
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, nmax):
fac[i] = fac[i - 1] * i % mod
inv[i] = mod - inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
def comb(n, r):
if n < r:
return 0
else:
return (fac[n] * ((finv[r] * finv[n - r]) % mod)) % mod
for _ in range(int(input())):
N, K = map(int, input().split())
A = list(map(int, input().split()))
S = sum(A)
B = [0] * N
pq = []
for i in range(N):
heappush(pq, (-A[i], i))
for _ in range(K):
v, i = heappop(pq)
B[i] += 1
heappush(pq, (-A[i] * (1 / (B[i] + 1)), i))
S_inv = pow(S, mod-2, mod)
T = K
ans = 1
for i in range(N):
ans = (ans * pow((A[i] * S_inv)%mod, B[i], mod))%mod
ans = (ans * comb(T, B[i]))%mod
T -= B[i]
print(ans)
assert T == 0
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0