結果
問題 | No.1688 Veterinarian |
ユーザー |
![]() |
提出日時 | 2021-09-24 21:42:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 777 ms / 3,000 ms |
コード長 | 1,393 bytes |
コンパイル時間 | 142 ms |
コンパイル使用メモリ | 82,384 KB |
実行使用メモリ | 163,976 KB |
最終ジャッジ日時 | 2024-07-05 10:18:12 |
合計ジャッジ時間 | 3,560 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 14 |
ソースコード
mod = 1000000007 eps = 10**-9 def main(): import sys input = sys.stdin.readline A, B, C, N = map(int, input().split()) dp = [[[0] * (C+1) for _ in range(B+1)] for _ in range(A+1)] dp[A][B][C] = 1 for _ in range(N): dp_new = [[[0] * (C+1) for _ in range(B+1)] for _ in range(A+1)] for a in range(A+1): for b in range(B+1): for c in range(C+1): abc = a + b + c if abc <= 2: continue lower = abc * (abc - 1) pp = dp[a][b][c] pa = a * (a-1) / lower dp_new[a-1][b][c] = dp_new[a-1][b][c] + pp * pa pb = b * (b-1) / lower dp_new[a][b-1][c] = dp_new[a][b-1][c] + pp * pb pc = c * (c-1) / lower dp_new[a][b][c-1] = dp_new[a][b][c-1] + pp * pc dp_new[a][b][c] = dp_new[a][b][c] + pp * (1 - pa - pb - pc) dp = dp_new 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): ans_a = ans_a + dp[a][b][c] * (A - a) ans_b = ans_b + dp[a][b][c] * (B - b) ans_c = ans_c + dp[a][b][c] * (C - c) print(ans_a, ans_b, ans_c) if __name__ == '__main__': main()