結果
問題 | No.2364 Knapsack Problem |
ユーザー |
|
提出日時 | 2023-06-30 22:13:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 268 ms / 3,000 ms |
コード長 | 1,927 bytes |
コンパイル時間 | 715 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 90,112 KB |
最終ジャッジ日時 | 2024-07-07 10:02:02 |
合計ジャッジ時間 | 5,330 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
import sysfrom sys import stdinfrom fractions import Fractionimport mathfrom math import ceil, floor, sqrt, pi, factorial, gcdfrom copy import deepcopyfrom collections import Counter, deque, defaultdictfrom heapq import heapify, heappop, heappushfrom itertools import accumulate, product, combinations, combinations_with_replacement, permutationsfrom bisect import bisect, bisect_left, bisect_rightfrom functools import reduce, lru_cachefrom decimal import Decimal, getcontext, ROUND_HALF_UPdef i_input(): return int(stdin.readline())def i_map(): return map(int, stdin.readline().split())def i_list(): return list(i_map())def s_input(): return stdin.readline()[:-1]def s_map(): return s_input().split()def s_list(): return list(s_map())def lcm(a, b): return a * b // gcd(a, b)def get_distance(x1, y1, x2, y2):d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)return ddef rotate(table):n_fild = []for x in zip(*table[::-1]):n_fild.append(x)return n_fildsys.setrecursionlimit(10 ** 7)INF = float('inf')MOD = 10 ** 9 + 7MOD2 = 998244353alpa = 'abcdefghijklmnopqrstuvwxyz'ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'def main():N, M, W = i_map()A = i_list()B = i_list()C = i_list()D = i_list()for i in range(M):C[i] *= -1D[i] *= -1w = A + Cv = B + Ddp = [-INF] * (2 ** (N+M))dp[0] = 0for i in range(2**(N+M)):for j in range(N+M):a, b = w[j], v[j]p = 2 ** jif i | p != i:nxt = i | pflag = format(nxt, 'b').zfill(N+M)[::-1]cou = 0for k in range(N+M):if flag[k] == '1':cou += w[k]if 0 <= cou <= W:dp[nxt] = max(dp[nxt], dp[i] + b)print(max(dp))if __name__ == '__main__':main()