結果
問題 | No.766 金魚すくい |
ユーザー | maspy |
提出日時 | 2020-02-04 09:45:46 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 517 ms / 1,500 ms |
コード長 | 1,555 bytes |
コンパイル時間 | 207 ms |
コンパイル使用メモリ | 12,196 KB |
実行使用メモリ | 55,800 KB |
最終ジャッジ日時 | 2023-10-20 00:41:26 |
合計ジャッジ時間 | 23,566 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 455 ms
42,776 KB |
testcase_01 | AC | 452 ms
42,776 KB |
testcase_02 | AC | 448 ms
42,776 KB |
testcase_03 | AC | 451 ms
42,776 KB |
testcase_04 | AC | 453 ms
42,776 KB |
testcase_05 | AC | 455 ms
42,776 KB |
testcase_06 | AC | 455 ms
42,776 KB |
testcase_07 | AC | 453 ms
42,776 KB |
testcase_08 | AC | 452 ms
42,776 KB |
testcase_09 | AC | 454 ms
42,776 KB |
testcase_10 | AC | 460 ms
42,776 KB |
testcase_11 | AC | 461 ms
42,776 KB |
testcase_12 | AC | 461 ms
42,776 KB |
testcase_13 | AC | 466 ms
42,776 KB |
testcase_14 | AC | 460 ms
42,776 KB |
testcase_15 | AC | 460 ms
42,776 KB |
testcase_16 | AC | 463 ms
42,776 KB |
testcase_17 | AC | 464 ms
42,776 KB |
testcase_18 | AC | 464 ms
42,776 KB |
testcase_19 | AC | 461 ms
42,776 KB |
testcase_20 | AC | 461 ms
42,776 KB |
testcase_21 | AC | 464 ms
42,776 KB |
testcase_22 | AC | 458 ms
42,776 KB |
testcase_23 | AC | 507 ms
54,624 KB |
testcase_24 | AC | 507 ms
54,824 KB |
testcase_25 | AC | 506 ms
55,800 KB |
testcase_26 | AC | 508 ms
54,488 KB |
testcase_27 | AC | 499 ms
55,736 KB |
testcase_28 | AC | 498 ms
54,424 KB |
testcase_29 | AC | 499 ms
54,392 KB |
testcase_30 | AC | 503 ms
54,512 KB |
testcase_31 | AC | 499 ms
55,752 KB |
testcase_32 | AC | 502 ms
54,448 KB |
testcase_33 | AC | 489 ms
50,648 KB |
testcase_34 | AC | 495 ms
50,648 KB |
testcase_35 | AC | 474 ms
47,220 KB |
testcase_36 | AC | 466 ms
46,912 KB |
testcase_37 | AC | 507 ms
54,776 KB |
testcase_38 | AC | 504 ms
54,848 KB |
testcase_39 | AC | 517 ms
55,576 KB |
testcase_40 | AC | 501 ms
54,456 KB |
testcase_41 | AC | 485 ms
55,672 KB |
testcase_42 | AC | 488 ms
54,760 KB |
testcase_43 | AC | 439 ms
42,776 KB |
testcase_44 | AC | 428 ms
42,776 KB |
ソースコード
import sys read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines import numpy as np MOD = 10**9 + 7 def cumprod(A, MOD = MOD): L = len(A); Lsq = int(L**.5+1) A = np.resize(A, Lsq**2).reshape(Lsq,Lsq) for n in range(1,Lsq): A[:,n] *= A[:,n-1]; A[:,n] %= MOD for n in range(1,Lsq): A[n] *= A[n-1,-1]; A[n] %= MOD return A.ravel()[:L] def make_fact(U, MOD = MOD): x = np.arange(U, dtype = np.int64); x[0] = 1 fact = cumprod(x, MOD) x = np.arange(U, 0, -1, dtype=np.int64); x[0] = pow(int(fact[-1]), MOD-2, MOD) fact_inv = cumprod(x, MOD)[::-1] fact.flags.writeable = False fact_inv.flags.writeable = False return fact,fact_inv def make_power(a, L, MOD=MOD): B = L.bit_length() x = np.empty((1<<B), np.int64) x[0] = 1 for n in range(B): x[1<<n:1<<(n+1)] = x[:1<<n] * a % MOD a *= a; a %= MOD x = x[:L] x.flags.writeable = False return x N, M, P = map(int, readline().split()) V = np.fromstring(read(), np.int64, sep=' ') fact, fact_inv = make_fact(N + M) P *= pow(100, MOD-2, MOD) Q = 1 - P P %= MOD Q %= MOD power_Q = make_power(Q, N+M) comb = fact[M-1:N+M-1] * fact_inv[0:N] % MOD * fact_inv[M-1] % MOD prob = np.empty(N+1, dtype=np.int64) prob[:N] = comb * power_Q[:N] % MOD * pow(P, M, MOD) % MOD prob[-1] = (1 - prob[:-1].sum()) % MOD V.sort() V = V[::-1] Vcum = np.empty(N+1, np.int64) Vcum[0] = 0 Vcum[1:] = V.cumsum() % MOD answer = (Vcum * prob % MOD).sum() % MOD print(answer)