結果
問題 | No.1688 Veterinarian |
ユーザー | mymelochan |
提出日時 | 2021-09-25 00:25:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 797 ms / 3,000 ms |
コード長 | 1,505 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 86,780 KB |
実行使用メモリ | 116,836 KB |
最終ジャッジ日時 | 2023-09-18 22:32:54 |
合計ジャッジ時間 | 4,943 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 87 ms
76,092 KB |
testcase_01 | AC | 115 ms
86,136 KB |
testcase_02 | AC | 98 ms
79,840 KB |
testcase_03 | AC | 85 ms
76,080 KB |
testcase_04 | AC | 87 ms
75,868 KB |
testcase_05 | AC | 85 ms
76,192 KB |
testcase_06 | AC | 128 ms
88,836 KB |
testcase_07 | AC | 172 ms
84,304 KB |
testcase_08 | AC | 797 ms
116,836 KB |
testcase_09 | AC | 725 ms
113,776 KB |
testcase_10 | AC | 229 ms
90,160 KB |
testcase_11 | AC | 258 ms
89,904 KB |
testcase_12 | AC | 136 ms
82,452 KB |
testcase_13 | AC | 155 ms
87,584 KB |
testcase_14 | AC | 175 ms
85,440 KB |
testcase_15 | AC | 216 ms
91,732 KB |
testcase_16 | AC | 136 ms
82,856 KB |
ソースコード
A,B,C,N = map(int,input().split()) dp = [[[0]*51 for _ in range(51)] for _ in range(51)] dp[A][B][C] = 1 def precomb(N): pascal = [0]*(N+1) pascal[0] = [1] pascal[1] = [1,1] for i in range(2,N+1): res = [0]*(i+1) res[0] = res[-1] = 1 for j in range(len(pascal[i-1])-1): res[j+1] = (pascal[i-1][j]+pascal[i-1][j+1]) pascal[i] = res[:] return pascal pascal = precomb(200) for _ in range(N): ndp = [[[0]*51 for _ in range(51)] for _ in range(51)] for a in range(A+1): for b in range(B+1): for c in range(C+1): s = a+b+c if s < 2: continue div = pascal[s][2] tdp = dp[a][b][c] t = 0 if a >= 2: u = pascal[a][2] t += u ndp[a-1][b][c] += tdp*u/div if b >= 2: u = pascal[b][2] t += u ndp[a][b-1][c] += tdp*u/div if c >= 2: u = pascal[c][2] t += u ndp[a][b][c-1] += tdp*u/div ndp[a][b][c] += tdp*(div-t)/div dp = ndp ans_a = 0 ans_b = 0 ans_c = 0 for a in range(A+1): for b in range(B+1): for c in range(C+1): tdp = dp[a][b][c] ans_a += (A-a)*tdp ans_b += (B-b)*tdp ans_c += (C-c)*tdp print(ans_a,ans_b,ans_c)