結果

問題 No.1688 Veterinarian
コンテスト
ユーザー cozy_sauna
提出日時 2021-10-11 14:06:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 518 ms / 3,000 ms
コード長 2,746 bytes
コンパイル時間 408 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 81,536 KB
最終ジャッジ日時 2024-09-15 11:57:12
合計ジャッジ時間 4,127 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 14
権限があれば一括ダウンロードができます

ソースコード

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)

####################################################################

def main():
    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 = (a+b+c)*(a+b+c-1)//2
                    if bot == 0: continue

                    t = a*(a-1)// 2 / bot
                    dp[a-1][b][c] += dabc * t 
                    k -= t
                    
                    t = b*(b-1)//2 / bot
                    dp[a][b-1][c] += dabc * t
                    k -= t

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

    print(aa, ab, ac)
                
                
main()
0