結果

問題 No.2389 Cheating Code Golf
ユーザー cleanttedcleantted
提出日時 2023-07-19 20:39:22
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,278 bytes
コンパイル時間 384 ms
コンパイル使用メモリ 82,688 KB
実行使用メモリ 91,484 KB
最終ジャッジ日時 2024-09-19 19:06:11
合計ジャッジ時間 11,870 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

# import bisect
import copy
import heapq
import itertools
import math
import operator
import random
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
from typing import Iterable, Iterator, List, Tuple, TypeVar, Union

# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import string
# import networkx as nx
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
    names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
    dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))


def cmp(l, r):
    a1, b1, p1 = l
    a2, b2, p2 = r

    t1 = (a1 - b1) * a2 * b2 * (p2 - 1)
    t2 = (a2 - b2) * a1 * b1 * (p1 - 1)
    if t1 > t2:
        return -1
    elif t1 < t2:
        return 1
    return 0


def main():
    N, M = read_values()

    L = read_lists(N)
    L.sort(key=cmp_to_key(cmp))
    for i in range(N):
        L[i][1] = min(L[i][0], L[i][1])

    print(L)
    res = Fraction(0, 1)

    A = [Fraction(0, 1)]
    for a, _, _ in reversed(L):
        A.append(Fraction(1, a) + A[-1])

    B = [Fraction(0, 1)]
    for _, b, _ in L:
        B.append(Fraction(1, b) + B[-1])

    dp = [[0] * (M + 1) for _ in range(N + 1)] 

    for i in reversed(range(N)):
        a, b, p = L[i]
        for m in range(M + 1):
            r = 0
            t = 1
            for k in range(m):
                r += 1 / p * t * (1 / b + dp[i + 1][m - k])
                t *= (p - 1) / p
            r += t * (1 / a + dp[i + 1][0])
            dp[i][m] = r

    print(dp[0][M])


if __name__ == "__main__":
    main()
0