結果
問題 | No.1547 [Cherry 2nd Tune *] 偶然の勝利の確率 |
ユーザー | mkawa2 |
提出日時 | 2021-06-11 23:33:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,556 ms / 2,000 ms |
コード長 | 1,959 bytes |
コンパイル時間 | 646 ms |
コンパイル使用メモリ | 86,792 KB |
実行使用メモリ | 84,256 KB |
最終ジャッジ日時 | 2023-08-21 14:37:02 |
合計ジャッジ時間 | 23,928 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,092 KB |
testcase_01 | AC | 85 ms
75,560 KB |
testcase_02 | AC | 165 ms
77,920 KB |
testcase_03 | AC | 83 ms
75,808 KB |
testcase_04 | AC | 96 ms
76,888 KB |
testcase_05 | AC | 84 ms
75,928 KB |
testcase_06 | AC | 84 ms
76,004 KB |
testcase_07 | AC | 94 ms
75,744 KB |
testcase_08 | AC | 78 ms
75,576 KB |
testcase_09 | AC | 92 ms
76,284 KB |
testcase_10 | AC | 86 ms
76,004 KB |
testcase_11 | AC | 97 ms
77,020 KB |
testcase_12 | AC | 79 ms
75,824 KB |
testcase_13 | AC | 390 ms
79,380 KB |
testcase_14 | AC | 309 ms
80,120 KB |
testcase_15 | AC | 204 ms
78,300 KB |
testcase_16 | AC | 252 ms
78,444 KB |
testcase_17 | AC | 239 ms
78,280 KB |
testcase_18 | AC | 241 ms
78,572 KB |
testcase_19 | AC | 156 ms
78,068 KB |
testcase_20 | AC | 932 ms
83,404 KB |
testcase_21 | AC | 210 ms
78,400 KB |
testcase_22 | AC | 84 ms
76,372 KB |
testcase_23 | AC | 1,556 ms
84,108 KB |
testcase_24 | AC | 1,543 ms
83,988 KB |
testcase_25 | AC | 1,544 ms
83,960 KB |
testcase_26 | AC | 1,521 ms
84,240 KB |
testcase_27 | AC | 1,531 ms
83,968 KB |
testcase_28 | AC | 1,547 ms
84,256 KB |
testcase_29 | AC | 1,549 ms
84,220 KB |
testcase_30 | AC | 1,544 ms
84,024 KB |
testcase_31 | AC | 1,534 ms
83,984 KB |
testcase_32 | AC | 1,528 ms
84,104 KB |
testcase_33 | AC | 1,536 ms
84,100 KB |
testcase_34 | AC | 182 ms
78,232 KB |
testcase_35 | AC | 181 ms
78,280 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 while K: if K&1:cc=dot(cc,base) base=dot(base,base) K>>=1 # print(s,t) # p2D(cc) print(cc[t][s]) print(cc[0][s])