結果
問題 | 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 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 153 ms
90,240 KB |
testcase_01 | AC | 158 ms
90,368 KB |
testcase_02 | AC | 167 ms
90,880 KB |
testcase_03 | AC | 163 ms
90,880 KB |
testcase_04 | AC | 166 ms
91,008 KB |
testcase_05 | AC | 158 ms
90,496 KB |
testcase_06 | AC | 155 ms
89,984 KB |
testcase_07 | AC | 166 ms
90,112 KB |
testcase_08 | AC | 163 ms
90,624 KB |
testcase_09 | AC | 155 ms
89,984 KB |
testcase_10 | AC | 159 ms
90,440 KB |
testcase_11 | AC | 160 ms
90,880 KB |
testcase_12 | AC | 157 ms
90,224 KB |
testcase_13 | AC | 159 ms
91,008 KB |
testcase_14 | AC | 157 ms
90,496 KB |
testcase_15 | AC | 155 ms
90,368 KB |
testcase_16 | AC | 160 ms
90,496 KB |
testcase_17 | AC | 158 ms
90,240 KB |
testcase_18 | AC | 159 ms
90,368 KB |
testcase_19 | AC | 154 ms
90,112 KB |
testcase_20 | AC | 156 ms
90,368 KB |
testcase_21 | AC | 164 ms
90,492 KB |
testcase_22 | AC | 157 ms
90,112 KB |
testcase_23 | AC | 157 ms
89,984 KB |
testcase_24 | AC | 154 ms
90,332 KB |
testcase_25 | AC | 158 ms
90,368 KB |
testcase_26 | AC | 160 ms
90,496 KB |
testcase_27 | AC | 158 ms
90,368 KB |
testcase_28 | AC | 160 ms
89,856 KB |
testcase_29 | AC | 163 ms
90,368 KB |
testcase_30 | AC | 160 ms
91,008 KB |
testcase_31 | AC | 157 ms
90,240 KB |
testcase_32 | AC | 155 ms
89,984 KB |
testcase_33 | AC | 157 ms
90,240 KB |
testcase_34 | AC | 157 ms
90,240 KB |
testcase_35 | AC | 158 ms
90,112 KB |
testcase_36 | AC | 161 ms
90,752 KB |
testcase_37 | AC | 160 ms
90,240 KB |
testcase_38 | AC | 162 ms
91,008 KB |
testcase_39 | AC | 173 ms
90,112 KB |
testcase_40 | AC | 162 ms
90,240 KB |
testcase_41 | AC | 158 ms
89,984 KB |
testcase_42 | AC | 159 ms
90,112 KB |
testcase_43 | AC | 156 ms
89,984 KB |
testcase_44 | AC | 160 ms
90,368 KB |
testcase_45 | AC | 159 ms
90,496 KB |
testcase_46 | AC | 160 ms
90,112 KB |
testcase_47 | AC | 163 ms
90,112 KB |
testcase_48 | AC | 167 ms
90,496 KB |
testcase_49 | AC | 163 ms
90,240 KB |
testcase_50 | AC | 162 ms
90,368 KB |
testcase_51 | AC | 162 ms
90,752 KB |
testcase_52 | AC | 156 ms
89,984 KB |
ソースコード
# 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()