結果

問題 No.1688 Veterinarian
ユーザー cozy_saunacozy_sauna
提出日時 2021-10-11 13:37:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,074 ms / 3,000 ms
コード長 2,892 bytes
コンパイル時間 1,512 ms
コンパイル使用メモリ 87,076 KB
実行使用メモリ 87,104 KB
最終ジャッジ日時 2023-10-13 14:38:32
合計ジャッジ時間 8,309 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 130 ms
79,268 KB
testcase_01 AC 127 ms
79,432 KB
testcase_02 AC 130 ms
79,412 KB
testcase_03 AC 126 ms
79,440 KB
testcase_04 AC 129 ms
79,624 KB
testcase_05 AC 135 ms
79,564 KB
testcase_06 AC 164 ms
81,892 KB
testcase_07 AC 260 ms
85,508 KB
testcase_08 AC 2,074 ms
86,276 KB
testcase_09 AC 1,803 ms
87,104 KB
testcase_10 AC 396 ms
83,308 KB
testcase_11 AC 442 ms
83,600 KB
testcase_12 AC 204 ms
82,964 KB
testcase_13 AC 214 ms
83,452 KB
testcase_14 AC 239 ms
83,344 KB
testcase_15 AC 331 ms
83,668 KB
testcase_16 AC 198 ms
82,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from heapq import heappush, heappop
from math import factorial, gcd, exp
from copy import copy, deepcopy
from time import time
setrecursionlimit(500000)
readline = stdin.readline
# @lru_cache(maxsize=None)
INF = 10 ** 18
MOD = 1000000007
MOD2 = 998244353
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
def I(): return int(readline())
def S(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x)-1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(x): return [[] for _ in [0] * x]
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx]
def imax(A, idx=-1, m=-(1<<18)):
    for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a]
    return idx
def imin(A, idx=-1, m=1<<18):
    for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a]
    return idx
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    puts(E)

from operator import mul
from functools import reduce

def nCr(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom
####################################################################

A, B, C, N = SPI()
dp = gen(0, A+1, B+1, C+1)
dp[A][B][C] = 1

for _ in range(N):
    for a in range(A+1):
        for b in range(B+1):
            for c in range(C+1):
                k = 1
                dabc = dp[a][b][c]
                bot = nCr(a+b+c, 2)
                if a >= 2:
                    t = a*(a-1)// 2 / bot
                    dp[a-1][b][c] += dabc * t 
                    k -= t
                
                if b >= 2:
                    t = b*(b-1)//2 / bot
                    dp[a][b-1][c] += dabc * t
                    k -= t

                if c >= 2:
                    t = c*(c-1)//2 / bot
                    dp[a][b][c-1] += dabc * t
                    k -= t 
                dp[a][b][c] *= max(0, k)
                
# ans = gen(0, 3)
aa, ab, ac = 0, 0, 0
for a in range(A+1):
    for b in range(B+1):
        for c in range(C+1):
            aa += dp[a][b][c] * (A-a)
            ab += dp[a][b][c] * (B-b)
            ac += dp[a][b][c] * (C-c)

print(aa, ab, ac)
0