結果
問題 | No.1029 JJOOII 3 |
ユーザー | tktk_snsn |
提出日時 | 2020-12-31 22:26:44 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,341 bytes |
コンパイル時間 | 373 ms |
コンパイル使用メモリ | 82,592 KB |
実行使用メモリ | 82,892 KB |
最終ジャッジ日時 | 2024-04-18 05:13:06 |
合計ジャッジ時間 | 7,550 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
53,012 KB |
testcase_01 | AC | 37 ms
52,204 KB |
testcase_02 | AC | 35 ms
52,960 KB |
testcase_03 | AC | 66 ms
68,068 KB |
testcase_04 | AC | 92 ms
70,624 KB |
testcase_05 | AC | 269 ms
81,152 KB |
testcase_06 | AC | 191 ms
79,100 KB |
testcase_07 | AC | 236 ms
80,628 KB |
testcase_08 | AC | 220 ms
80,876 KB |
testcase_09 | AC | 227 ms
80,284 KB |
testcase_10 | AC | 238 ms
80,940 KB |
testcase_11 | AC | 282 ms
81,764 KB |
testcase_12 | AC | 167 ms
79,364 KB |
testcase_13 | AC | 294 ms
82,892 KB |
testcase_14 | AC | 324 ms
81,468 KB |
testcase_15 | AC | 171 ms
73,512 KB |
testcase_16 | AC | 156 ms
73,232 KB |
testcase_17 | AC | 217 ms
77,432 KB |
testcase_18 | AC | 229 ms
77,956 KB |
testcase_19 | WA | - |
testcase_20 | AC | 68 ms
69,336 KB |
testcase_21 | AC | 64 ms
68,972 KB |
testcase_22 | AC | 64 ms
69,460 KB |
testcase_23 | AC | 63 ms
68,240 KB |
testcase_24 | AC | 64 ms
69,760 KB |
testcase_25 | AC | 67 ms
69,760 KB |
testcase_26 | AC | 70 ms
71,608 KB |
testcase_27 | AC | 68 ms
71,828 KB |
testcase_28 | AC | 75 ms
71,948 KB |
testcase_29 | AC | 64 ms
69,732 KB |
testcase_30 | AC | 68 ms
70,072 KB |
testcase_31 | AC | 65 ms
71,724 KB |
testcase_32 | AC | 296 ms
82,100 KB |
testcase_33 | AC | 271 ms
81,988 KB |
testcase_34 | AC | 296 ms
82,656 KB |
testcase_35 | AC | 267 ms
82,004 KB |
testcase_36 | AC | 263 ms
81,776 KB |
testcase_37 | WA | - |
testcase_38 | AC | 39 ms
52,928 KB |
testcase_39 | AC | 40 ms
52,948 KB |
testcase_40 | WA | - |
ソースコード
inf = 10 ** 18 N, K = map(int, input().split()) C = [-1] * N J = [-1] * N O = [-1] * N I = [-1] * N JO = [-1] * N OI = [-1] * N for i in range(N): si, ci = input().split() C[i] = int(ci) J[i] = si.count("J") O[i] = si.count("O") I[i] = si.count("I") jj = 0 oo = O[i] tmp = [(0, oo)] for s in si: if s == "J": jj += 1 tmp.append((jj, oo)) if s == "O": oo -= 1 JO[i] = tmp[:] oo = 0 ii = I[i] tmp = [(0, ii)] for s in si: if s == "O": oo += 1 tmp.append((oo, ii)) if s == "I": ii -= 1 OI[i] = tmp[:] size = max(80, K) dpJ = [inf] * (size + 1) dpO = [inf] * (size + 1) dpI = [inf] * (size + 1) dpJ[0] = 0 for j, c in zip(J, C): for i in range(K): n = min(i+j, K) dpJ[n] = min(dpJ[n], dpJ[i] + c) for jo, c in zip(JO, C): for a, b in jo: dpO[b] = min(dpO[b], dpJ[K-a] + c) for j, c in zip(O, C): for i in range(K): n = min(i+j, K) dpO[n] = min(dpO[n], dpO[i] + c) for oi, c in zip(OI, C): for a, b in oi: dpI[b] = min(dpI[b], dpO[K-a] + c) for j, c in zip(I, C): for i in range(K): n = min(i+j, K) dpI[n] = min(dpI[n], dpI[i] + c) if dpI[K] >= inf: print(-1) else: print(dpI[K])