結果
問題 | No.2026 Yet Another Knapsack Problem |
ユーザー | suisen |
提出日時 | 2022-04-22 02:45:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 7,665 ms / 10,000 ms |
コード長 | 1,629 bytes |
コンパイル時間 | 274 ms |
コンパイル使用メモリ | 86,444 KB |
実行使用メモリ | 137,204 KB |
最終ジャッジ日時 | 2023-09-26 18:49:47 |
合計ジャッジ時間 | 62,091 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 165 ms
80,500 KB |
testcase_01 | AC | 167 ms
80,636 KB |
testcase_02 | AC | 166 ms
80,464 KB |
testcase_03 | AC | 260 ms
83,812 KB |
testcase_04 | AC | 230 ms
83,652 KB |
testcase_05 | AC | 181 ms
82,716 KB |
testcase_06 | AC | 234 ms
83,848 KB |
testcase_07 | AC | 237 ms
83,640 KB |
testcase_08 | AC | 196 ms
83,352 KB |
testcase_09 | AC | 240 ms
83,400 KB |
testcase_10 | AC | 230 ms
83,556 KB |
testcase_11 | AC | 236 ms
83,856 KB |
testcase_12 | AC | 167 ms
80,564 KB |
testcase_13 | AC | 226 ms
83,572 KB |
testcase_14 | AC | 219 ms
83,756 KB |
testcase_15 | AC | 166 ms
80,712 KB |
testcase_16 | AC | 221 ms
83,472 KB |
testcase_17 | AC | 226 ms
83,968 KB |
testcase_18 | AC | 166 ms
80,780 KB |
testcase_19 | AC | 224 ms
84,016 KB |
testcase_20 | AC | 161 ms
80,496 KB |
testcase_21 | AC | 212 ms
83,844 KB |
testcase_22 | AC | 215 ms
83,448 KB |
testcase_23 | AC | 231 ms
83,508 KB |
testcase_24 | AC | 164 ms
80,552 KB |
testcase_25 | AC | 174 ms
82,440 KB |
testcase_26 | AC | 235 ms
83,760 KB |
testcase_27 | AC | 222 ms
83,628 KB |
testcase_28 | AC | 446 ms
85,516 KB |
testcase_29 | AC | 464 ms
85,436 KB |
testcase_30 | AC | 473 ms
85,496 KB |
testcase_31 | AC | 466 ms
85,168 KB |
testcase_32 | AC | 389 ms
85,004 KB |
testcase_33 | AC | 452 ms
85,968 KB |
testcase_34 | AC | 448 ms
84,888 KB |
testcase_35 | AC | 391 ms
84,624 KB |
testcase_36 | AC | 441 ms
85,048 KB |
testcase_37 | AC | 455 ms
85,652 KB |
testcase_38 | AC | 6,758 ms
135,664 KB |
testcase_39 | AC | 6,604 ms
137,204 KB |
testcase_40 | AC | 7,665 ms
135,932 KB |
testcase_41 | AC | 6,939 ms
136,744 KB |
testcase_42 | AC | 7,253 ms
135,676 KB |
testcase_43 | AC | 7,477 ms
136,060 KB |
testcase_44 | AC | 6,815 ms
136,796 KB |
ソースコード
from collections import deque from typing import Deque, Tuple class SlidingWindowMaximum: l : int r : int dq : Deque[Tuple[int, int]] def __init__(self) -> None: self.clear() def clear(self) -> None: self.l = 0 self.r = 0 self.dq = deque() def push_back(self, v : int) -> None: while self.dq and self.dq[-1][0] < v: self.dq.pop() self.dq.append((v, self.r)) self.r += 1 def pop_front(self) -> None: assert self.size() if self.dq[0][1] == self.l: self.dq.popleft() self.l += 1 def query(self) -> int: return self.dq[0][0] def size(self) -> int: return self.r - self.l N = int(input()) items = [(int(0), int(0))] for _ in range(N): c, v = map(int, input().split()) items.append((c, v)) INF = 1 << 60 dp = [[-INF] * (N + 1) for i in range(N + 1)] dp[0][0] = 0 sw = SlidingWindowMaximum() for i in reversed(range(1, N + 1)): max_num = min(N, N // i) max_sum = N c, v = items[i] # dp[num][sum] = max{ pd[num-p][sum-p*i]-(num-p)*v[i] | 0<=p<=c[i] } ⋃ {-∞} + num*v[i] for num in range(max_num + 1): for sum in range(i if num else max_sum + 1): max_p = min(max_num - num, (max_sum - sum) // i) sw.clear() for p in range(max_p + 1): sw.push_back(dp[num + p][sum + i * p] - (num + p) * v) if p > c: sw.pop_front() dp[num + p][sum + i * p] = sw.query() + (num + p) * v for k in range(1, N + 1): print(max(dp[k]))