結果
問題 | No.2389 Cheating Code Golf |
ユーザー | shobonvip |
提出日時 | 2023-07-21 23:19:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,646 ms / 2,000 ms |
コード長 | 1,437 bytes |
コンパイル時間 | 170 ms |
コンパイル使用メモリ | 81,604 KB |
実行使用メモリ | 77,516 KB |
最終ジャッジ日時 | 2023-10-21 23:22:38 |
合計ジャッジ時間 | 82,467 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,643 ms
77,224 KB |
testcase_01 | AC | 1,644 ms
76,956 KB |
testcase_02 | AC | 1,645 ms
77,096 KB |
testcase_03 | AC | 1,644 ms
77,096 KB |
testcase_04 | AC | 1,644 ms
77,132 KB |
testcase_05 | AC | 1,644 ms
77,120 KB |
testcase_06 | AC | 43 ms
56,072 KB |
testcase_07 | AC | 1,645 ms
77,140 KB |
testcase_08 | AC | 1,642 ms
77,084 KB |
testcase_09 | AC | 44 ms
56,072 KB |
testcase_10 | AC | 1,644 ms
77,020 KB |
testcase_11 | AC | 1,644 ms
77,080 KB |
testcase_12 | AC | 43 ms
56,072 KB |
testcase_13 | AC | 1,643 ms
77,072 KB |
testcase_14 | AC | 1,644 ms
77,084 KB |
testcase_15 | AC | 1,645 ms
77,144 KB |
testcase_16 | AC | 1,645 ms
77,084 KB |
testcase_17 | AC | 43 ms
56,072 KB |
testcase_18 | AC | 1,645 ms
77,268 KB |
testcase_19 | AC | 1,644 ms
77,028 KB |
testcase_20 | AC | 1,643 ms
77,020 KB |
testcase_21 | AC | 1,643 ms
77,116 KB |
testcase_22 | AC | 1,643 ms
77,124 KB |
testcase_23 | AC | 1,644 ms
77,356 KB |
testcase_24 | AC | 1,643 ms
77,152 KB |
testcase_25 | AC | 1,644 ms
76,992 KB |
testcase_26 | AC | 1,643 ms
77,516 KB |
testcase_27 | AC | 1,644 ms
77,108 KB |
testcase_28 | AC | 1,643 ms
77,400 KB |
testcase_29 | AC | 1,644 ms
77,084 KB |
testcase_30 | AC | 1,644 ms
77,104 KB |
testcase_31 | AC | 1,646 ms
77,364 KB |
testcase_32 | AC | 1,644 ms
77,036 KB |
testcase_33 | AC | 1,643 ms
77,092 KB |
testcase_34 | AC | 1,644 ms
77,320 KB |
testcase_35 | AC | 1,644 ms
77,296 KB |
testcase_36 | AC | 1,644 ms
77,092 KB |
testcase_37 | AC | 1,644 ms
77,076 KB |
testcase_38 | AC | 1,644 ms
77,092 KB |
testcase_39 | AC | 43 ms
56,072 KB |
testcase_40 | AC | 1,644 ms
77,072 KB |
testcase_41 | AC | 1,644 ms
76,956 KB |
testcase_42 | AC | 1,644 ms
77,104 KB |
testcase_43 | AC | 1,643 ms
77,132 KB |
testcase_44 | AC | 1,643 ms
77,160 KB |
testcase_45 | AC | 1,643 ms
77,300 KB |
testcase_46 | AC | 1,643 ms
77,176 KB |
testcase_47 | AC | 1,644 ms
77,056 KB |
testcase_48 | AC | 1,644 ms
77,084 KB |
testcase_49 | AC | 1,643 ms
77,180 KB |
testcase_50 | AC | 1,644 ms
77,160 KB |
testcase_51 | AC | 1,643 ms
77,212 KB |
testcase_52 | AC | 1,644 ms
77,116 KB |
ソースコード
import random import time nn, m = map(int,input().split()) d = [] st = time.time() n = 0 ans = 0 nans = 0 for i in range(nn): a, b, p = map(int,input().split()) if a <= b: ans += 1 / a nans += 1 / a elif p == 1: ans += 1 / b nans += 1 / b else: d.append((a, b, p)) n += 1 if n == 0: print(ans) exit() d.sort(key= lambda x:(-(x[0]-x[1])/(x[1]*x[0]*x[2]), x[0])) dp = [0.0] * (n+1) dp[0] = 1.0 for i in range(m): ndp = [0.0] * (n+1) for j in range(n+1): tar = 1.0 for k in range(j, n): ndp[k] += dp[j] * tar * (1 - 1/d[k][2]) tar *= 1/d[k][2] ndp[n] += dp[j] * tar dp = ndp tmp = 0.0 for i in range(n): tmp += 1 / d[i][0] #print(tmp) for i in range(n+1): ans += tmp * dp[i] if i < n: tmp -= 1 / d[i][0] tmp += 1 / d[i][1] #print(tmp, dp[i]) nnans = nans dd = d[::] while time.time() - st < 1.6: d = dd[::] for _ in range(2): a, b = random.randrange(n), random.randrange(n) r = d[a] d[a] = d[b] d[b] = r nans = nnans dp = [0.0] * (n+1) dp[0] = 1.0 for i in range(m): ndp = [0.0] * (n+1) for j in range(n+1): tar = 1.0 for k in range(j, n): ndp[k] += dp[j] * tar * (1 - 1/d[k][2]) tar *= 1/d[k][2] ndp[n] += dp[j] * tar dp = ndp tmp = 0.0 for i in range(n): tmp += 1 / d[i][0] #print(tmp) for i in range(n+1): nans += tmp * dp[i] if i < n: tmp -= 1 / d[i][0] tmp += 1 / d[i][1] #print(tmp, dp[i]) ans = max(ans, nans) print(ans)