#893082 (PyPy3) No.2389 Cheating Code Golf

• 問題: No.2389 Cheating Code Golf
• ユーザー: cleantted
• 提出日時: 2023-07-19 20:40:05
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 173 ms / 2,000 ms
• コード長: 2,051 bytes
• コンパイル時間: 155 ms
• コンパイル使用メモリ: 82,432 KB
• 実行使用メモリ: 91,008 KB
• 最終ジャッジ日時: 2024-09-19 19:06:40
• 合計ジャッジ時間: 10,224 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 3
other	AC * 50

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
# 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])
    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()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX