結果
問題 | No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率 |
ユーザー | mkawa2 |
提出日時 | 2021-06-11 23:40:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,480 ms / 2,000 ms |
コード長 | 2,043 bytes |
コンパイル時間 | 778 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 83,200 KB |
最終ジャッジ日時 | 2024-05-08 20:13:42 |
合計ジャッジ時間 | 22,433 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
52,480 KB |
testcase_01 | AC | 57 ms
64,128 KB |
testcase_02 | AC | 149 ms
77,056 KB |
testcase_03 | AC | 54 ms
63,488 KB |
testcase_04 | AC | 75 ms
71,424 KB |
testcase_05 | AC | 54 ms
63,616 KB |
testcase_06 | AC | 57 ms
64,640 KB |
testcase_07 | AC | 58 ms
65,792 KB |
testcase_08 | AC | 49 ms
60,544 KB |
testcase_09 | AC | 66 ms
68,608 KB |
testcase_10 | AC | 60 ms
65,920 KB |
testcase_11 | AC | 71 ms
71,168 KB |
testcase_12 | AC | 53 ms
62,464 KB |
testcase_13 | AC | 358 ms
78,448 KB |
testcase_14 | AC | 280 ms
78,464 KB |
testcase_15 | AC | 183 ms
77,312 KB |
testcase_16 | AC | 226 ms
77,468 KB |
testcase_17 | AC | 220 ms
77,696 KB |
testcase_18 | AC | 218 ms
77,720 KB |
testcase_19 | AC | 133 ms
76,800 KB |
testcase_20 | AC | 881 ms
80,512 KB |
testcase_21 | AC | 186 ms
77,488 KB |
testcase_22 | AC | 56 ms
65,536 KB |
testcase_23 | AC | 1,455 ms
82,816 KB |
testcase_24 | AC | 1,471 ms
82,816 KB |
testcase_25 | AC | 1,442 ms
82,816 KB |
testcase_26 | AC | 1,480 ms
82,816 KB |
testcase_27 | AC | 1,450 ms
83,072 KB |
testcase_28 | AC | 1,440 ms
82,816 KB |
testcase_29 | AC | 1,471 ms
83,024 KB |
testcase_30 | AC | 1,469 ms
82,816 KB |
testcase_31 | AC | 1,465 ms
83,200 KB |
testcase_32 | AC | 1,468 ms
82,816 KB |
testcase_33 | AC | 1,457 ms
82,816 KB |
testcase_34 | AC | 157 ms
77,184 KB |
testcase_35 | AC | 159 ms
77,312 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 md = 998244353 # md = 10**9+7 def dot(aa, bb): return [[sum(a*b%md for a, b in zip(row, col))%md for col in zip(*bb)] for row in aa] ma, na, s = LI() mb, nb, t = LI() K = II() s += t s, t = t, s pa = ma*pow(na, md-2, md) pb = mb*pow(nb, md-2, md) # print(pa,pb) dtop = [0]*(t+1) now = (1-pa)%md for i in range(t+1): dtop[i] = now now = now*pa%md pp0 = [[0]*(t+1) for _ in range(t+1)] for i in range(1, t): p = 1 d = 0 for j in range(i, t): pp0[i][j] = dtop[d] p -= dtop[d] d += 1 pp0[i][t] = p%md # p2D(pp0) dtop = [0]*(t+1) now = (1-pb)%md for i in range(t+1): dtop[i] = now now = now*pb%md pp1 = [[0]*(t+1) for _ in range(t+1)] for i in range(t-1, 0, -1): p = 1 d = 0 for j in range(i, 0, -1): pp1[i][j] = dtop[d] p -= dtop[d] d += 1 pp1[i][0] = p%md base = [[0]*(t+1) for _ in range(t+1)] for i in range(1, t): for j in range(i, t): for k in range(j+1): base[k][i] += pp0[i][j]*pp1[j][k] base[k][i] %= md for i in range(1, t): base[t][i] = pp0[i][t] base[0][0] = 1 base[t][t] = 1 # p2D(base) cc = [[0]*(t+1) for _ in range(t+1)] for i in range(t+1): cc[i][i] = 1 for i in range(K.bit_length()): if K >> i & 1: cc = dot(cc, base) base = dot(base, base) # print(s,t) # p2D(cc) print(cc[t][s]) print(cc[0][s])