結果

問題 No.1554 array_and_me
ユーザー shotoyoo
提出日時 2021-05-03 07:43:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 582 ms / 2,000 ms
コード長 1,270 bytes
コンパイル時間 336 ms
コンパイル使用メモリ 82,472 KB
実行使用メモリ 103,928 KB
最終ジャッジ日時 2024-06-22 19:31:23
合計ジャッジ時間 17,468 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 41
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
t = int(input())
items = []
N = 100
M = 998244353
for _ in range(t):
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
N = max(N, n+k+10)
items.append((n,k,a))
g1 = [0] * (N+1) #
g2 = [0] * (N+1) #
inverse = [0] * (N+1) #
g1[0] = g1[1] = g2[0] = g2[1] = 1
inverse[0], inverse[1] = [0, 1]
for i in range( 2, N + 1 ):
g1[i] = ( g1[i-1] * i ) % M
inverse[i] = ( -inverse[M % i] * (M//i) ) % M # ai+b==0 mod M <=> i==-b*a^(-1) <=> i^(-1)==-b^(-1)*a
g2[i] = (g2[i-1] * inverse[i]) % M
ans = []
for n,k,a in items:
from heapq import heappop as hpp, heappush as hp, heapify
h = [(-v,i) for i,v in enumerate(a)]
heapify(h)
x = [0]*n
for _ in range(k):
v,i = hpp(h)
v *= -1
x[i] += 1
hp(h, (-a[i]/(x[i]+1), i))
val = g1[k]
for i in range(n):
val *= (pow(a[i], x[i], M) * g2[x[i]] % M)
val %= M
val *= pow(pow(sum(a), k, M), M-2, M)
ans.append(val%M)
write("\n".join(map(str, ans)))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0