結果
問題 | No.1554 array_and_me |
ユーザー | tamato |
提出日時 | 2021-06-18 22:49:32 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,328 bytes |
コンパイル時間 | 781 ms |
コンパイル使用メモリ | 87,496 KB |
実行使用メモリ | 93,668 KB |
最終ジャッジ日時 | 2023-09-04 23:56:10 |
合計ジャッジ時間 | 16,513 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 84 ms
78,432 KB |
testcase_01 | AC | 315 ms
83,624 KB |
testcase_02 | AC | 302 ms
82,464 KB |
testcase_03 | AC | 308 ms
83,308 KB |
testcase_04 | AC | 297 ms
83,028 KB |
testcase_05 | AC | 320 ms
83,528 KB |
testcase_06 | AC | 415 ms
93,340 KB |
testcase_07 | AC | 423 ms
93,448 KB |
testcase_08 | AC | 405 ms
93,340 KB |
testcase_09 | AC | 434 ms
93,248 KB |
testcase_10 | AC | 403 ms
93,668 KB |
testcase_11 | AC | 143 ms
93,604 KB |
testcase_12 | AC | 146 ms
93,416 KB |
testcase_13 | AC | 144 ms
93,472 KB |
testcase_14 | AC | 149 ms
93,460 KB |
testcase_15 | AC | 146 ms
93,528 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 398 ms
89,712 KB |
testcase_27 | AC | 408 ms
90,232 KB |
testcase_28 | AC | 411 ms
91,492 KB |
testcase_29 | AC | 402 ms
91,856 KB |
testcase_30 | AC | 412 ms
91,104 KB |
testcase_31 | AC | 408 ms
90,796 KB |
testcase_32 | AC | 413 ms
91,948 KB |
testcase_33 | AC | 419 ms
90,696 KB |
testcase_34 | AC | 405 ms
90,072 KB |
testcase_35 | AC | 423 ms
92,616 KB |
testcase_36 | AC | 313 ms
89,076 KB |
testcase_37 | AC | 310 ms
91,236 KB |
testcase_38 | AC | 306 ms
88,544 KB |
testcase_39 | AC | 312 ms
89,136 KB |
testcase_40 | AC | 316 ms
89,804 KB |
testcase_41 | AC | 311 ms
82,504 KB |
ソースコード
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] * K, i)) for _ in range(K): v, i = heappop(pq) B[i] += 1 heappush(pq, (-A[i] * ((K - B[i]) / (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()