結果
問題 |
No.1688 Veterinarian
|
ユーザー |
|
提出日時 | 2021-11-23 17:55:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,706 ms / 3,000 ms |
コード長 | 1,721 bytes |
コンパイル時間 | 216 ms |
コンパイル使用メモリ | 82,824 KB |
実行使用メモリ | 265,520 KB |
最終ジャッジ日時 | 2024-06-25 14:40:58 |
合計ジャッジ時間 | 6,178 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 14 |
ソースコード
a, b, c, n = map(int, input().split()) dpa = [[[[0.0 for _ in range(c)] for _ in range(b)] for _ in range(a)] for _ in range(n + 1)] dpb = [[[[0.0 for _ in range(c)] for _ in range(b)] for _ in range(a)] for _ in range(n + 1)] dpc = [[[[0.0 for _ in range(c)] for _ in range(b)] for _ in range(a)] for _ in range(n + 1)] for i in range(1, n + 1): for aa in range(a): for bb in range(b): for cc in range(c): all_num = aa + bb + cc + 3 prob_a = (aa + 1) * aa / all_num / (all_num - 1) prob_b = (bb + 1) * bb / all_num / (all_num - 1) prob_c = (cc + 1) * cc / all_num / (all_num - 1) prob_res = 1 - prob_a - prob_b - prob_c dpa[i][aa][bb][cc] = prob_res * dpa[i - 1][aa][bb][cc] + \ prob_a * (dpa[i - 1][aa - 1][bb][cc] + 1) + \ prob_b * dpa[i - 1][aa][bb - 1][cc] + \ prob_c * dpa[i - 1][aa][bb][cc - 1] dpb[i][aa][bb][cc] = prob_res * dpb[i - 1][aa][bb][cc] + \ prob_a * dpb[i - 1][aa - 1][bb][cc] + \ prob_b * (dpb[i - 1][aa][bb - 1][cc] + 1) + \ prob_c * dpb[i - 1][aa][bb][cc - 1] dpc[i][aa][bb][cc] = prob_res * dpc[i - 1][aa][bb][cc] + \ prob_a * dpc[i - 1][aa - 1][bb][cc] + \ prob_b * dpc[i - 1][aa][bb - 1][cc] + \ prob_c * (dpc[i - 1][aa][bb][cc - 1] + 1) print(dpa[-1][-1][-1][-1], dpb[-1][-1][-1][-1], dpc[-1][-1][-1][-1])