結果
問題 | No.2686 商品券の使い道 |
ユーザー | Yakumo221 |
提出日時 | 2024-03-20 23:34:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,258 ms / 3,000 ms |
コード長 | 1,988 bytes |
コンパイル時間 | 301 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 188,076 KB |
最終ジャッジ日時 | 2024-03-20 23:35:42 |
合計ジャッジ時間 | 60,097 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,460 KB |
testcase_01 | AC | 38 ms
53,460 KB |
testcase_02 | AC | 504 ms
108,028 KB |
testcase_03 | AC | 507 ms
103,688 KB |
testcase_04 | AC | 523 ms
102,144 KB |
testcase_05 | AC | 538 ms
115,292 KB |
testcase_06 | AC | 527 ms
104,068 KB |
testcase_07 | AC | 494 ms
113,584 KB |
testcase_08 | AC | 474 ms
113,540 KB |
testcase_09 | AC | 543 ms
104,044 KB |
testcase_10 | AC | 512 ms
103,416 KB |
testcase_11 | AC | 534 ms
102,044 KB |
testcase_12 | AC | 587 ms
105,024 KB |
testcase_13 | AC | 458 ms
104,844 KB |
testcase_14 | AC | 620 ms
104,872 KB |
testcase_15 | AC | 551 ms
105,612 KB |
testcase_16 | AC | 561 ms
111,444 KB |
testcase_17 | AC | 571 ms
110,968 KB |
testcase_18 | AC | 534 ms
115,292 KB |
testcase_19 | AC | 535 ms
113,620 KB |
testcase_20 | AC | 436 ms
104,584 KB |
testcase_21 | AC | 517 ms
109,148 KB |
testcase_22 | AC | 546 ms
110,836 KB |
testcase_23 | AC | 564 ms
106,548 KB |
testcase_24 | AC | 543 ms
106,148 KB |
testcase_25 | AC | 587 ms
115,432 KB |
testcase_26 | AC | 553 ms
104,028 KB |
testcase_27 | AC | 554 ms
113,684 KB |
testcase_28 | AC | 451 ms
104,756 KB |
testcase_29 | AC | 2,106 ms
179,144 KB |
testcase_30 | AC | 1,882 ms
187,732 KB |
testcase_31 | AC | 2,258 ms
173,020 KB |
testcase_32 | AC | 1,932 ms
183,748 KB |
testcase_33 | AC | 1,973 ms
183,760 KB |
testcase_34 | AC | 1,968 ms
187,428 KB |
testcase_35 | AC | 2,136 ms
188,076 KB |
testcase_36 | AC | 1,943 ms
185,508 KB |
testcase_37 | AC | 1,998 ms
174,212 KB |
testcase_38 | AC | 1,876 ms
180,292 KB |
testcase_39 | AC | 1,956 ms
170,220 KB |
testcase_40 | AC | 2,016 ms
180,452 KB |
testcase_41 | AC | 1,815 ms
185,416 KB |
testcase_42 | AC | 2,006 ms
178,724 KB |
testcase_43 | AC | 1,981 ms
173,532 KB |
testcase_44 | AC | 2,016 ms
174,132 KB |
testcase_45 | AC | 2,103 ms
182,612 KB |
testcase_46 | AC | 1,998 ms
169,752 KB |
evil_random20_1.txt | AC | 1,912 ms
180,160 KB |
evil_random20_2.txt | AC | 2,135 ms
179,984 KB |
evil_random20_3.txt | AC | 2,160 ms
187,384 KB |
ソースコード
n, m, q = map(int, input().split()) # import sys # input = sys.stdin.readline # mp = map(int, sys.stdin.read().split()) # ab = list(zip(mp,mp)) ab = [] for i in range(n): a,b = map(int, input().split()) ab.append((a,b)) katidp = [[0 for i in range(1 << n)] for i in range(2)] resdp = [[0 for i in range(1 << n)] for i in range(2)] resdp[0][0] = m resdp[1][0] = q que = set([0]) for j in range(n): nq = set() while que: state = que.pop() mkati = katidp[0][state] qkati = katidp[1][state] mres = resdp[0][state] qres = resdp[1][state] for k in range(n): if state & (1 << k): continue else: nstate = state | (1 << k) nq.add(nstate) kati = ab[k][1] val = ab[k][0] if mres < val: nres = mres nkati = mkati else: nkati = mkati + kati nres = mres - val if katidp[0][nstate] < nkati: katidp[0][nstate] = nkati resdp[0][nstate] = nres elif katidp[0][nstate] == nkati: if resdp[0][nstate] < nres: resdp[0][nstate] = nres if qres < val: nres = qres nkati = qkati else: nkati = qkati + kati nres = qres - val if katidp[1][nstate] < nkati: katidp[1][nstate] = nkati resdp[1][nstate] = nres elif katidp[1][nstate] == nkati: if resdp[1][nstate] < nres: resdp[1][nstate] = nres que = nq # print(katidp) mask = (1 << n) - 1 ans = 0 for i in range(1 << n): j = mask ^ i ans = max(ans, katidp[0][i] + katidp[1][j]) print(ans)