結果
問題 | No.2364 Knapsack Problem |
ユーザー | Shirotsume |
提出日時 | 2023-06-30 22:12:34 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,290 bytes |
コンパイル時間 | 937 ms |
コンパイル使用メモリ | 82,084 KB |
実行使用メモリ | 78,208 KB |
最終ジャッジ日時 | 2024-07-07 10:01:18 |
合計ジャッジ時間 | 5,056 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
55,552 KB |
testcase_01 | AC | 42 ms
55,680 KB |
testcase_02 | AC | 54 ms
63,872 KB |
testcase_03 | AC | 43 ms
55,296 KB |
testcase_04 | AC | 71 ms
70,656 KB |
testcase_05 | AC | 91 ms
77,056 KB |
testcase_06 | AC | 78 ms
70,912 KB |
testcase_07 | AC | 125 ms
77,752 KB |
testcase_08 | AC | 45 ms
55,552 KB |
testcase_09 | AC | 157 ms
77,568 KB |
testcase_10 | AC | 547 ms
77,568 KB |
testcase_11 | AC | 97 ms
77,440 KB |
testcase_12 | AC | 284 ms
77,568 KB |
testcase_13 | AC | 254 ms
77,952 KB |
testcase_14 | WA | - |
testcase_15 | AC | 252 ms
77,696 KB |
testcase_16 | AC | 243 ms
77,696 KB |
testcase_17 | AC | 265 ms
77,696 KB |
testcase_18 | AC | 232 ms
77,696 KB |
testcase_19 | AC | 248 ms
77,696 KB |
testcase_20 | AC | 295 ms
78,208 KB |
testcase_21 | AC | 312 ms
78,080 KB |
ソースコード
import sys, time, random from collections import deque, Counter, defaultdict input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 import time t1 = time.time() n, m, w = mi() a = li() b = li() c = [v for v in li()] d = [v for v in li()] ans = 0 import itertools if n + m <= 12: for bit1 in range(1 << n): for bit2 in range(1 << m): WV = [] for i in range(n): if 1 & (bit1 >> i): WV.append((a[i], b[i])) WIS = [] for i in range(m): if 1 & (bit2 >> i): WIS.append((c[i], d[i])) for WV in itertools.permutations(WV): for WIS in itertools.permutations(WIS): j = 0 noww = 0 nowv = 0 for x, y in WV: noww += x nowv += y if noww > w: nowv = -inf break if j < len(WIS) and WIS[j][0] <= noww: noww -= WIS[j][0] nowv -= WIS[j][1] j += 1 ans = max(ans, nowv) else: for bit1 in range(1 << n): for bit2 in range(1 << m): WV = [] for i in range(n): if 1 & (bit1 >> i): WV.append((a[i], b[i])) WIS = [] for i in range(m): if 1 & (bit2 >> i): WIS.append((c[i], d[i])) WV.sort(key = lambda x: x[0], reverse=True) for WIS in itertools.permutations(WIS): j = 0 noww = 0 nowv = 0 for x, y in WV: noww += x nowv += y if noww > w: nowv = -inf break if j < len(WIS) and -WIS[j][0] <= noww: noww -= WIS[j][0] nowv -= WIS[j][1] j += 1 ans = max(ans, nowv) print(ans)