結果
| 問題 |
No.2026 Yet Another Knapsack Problem
|
| コンテスト | |
| ユーザー |
gew1fw
|
| 提出日時 | 2025-06-12 15:56:50 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 1,707 bytes |
| コンパイル時間 | 151 ms |
| コンパイル使用メモリ | 82,272 KB |
| 実行使用メモリ | 133,728 KB |
| 最終ジャッジ日時 | 2025-06-12 15:57:33 |
| 合計ジャッジ時間 | 38,794 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 35 TLE * 1 -- * 6 |
ソースコード
import sys
import math
def main():
input = sys.stdin.read().split()
ptr = 0
N = int(input[ptr])
ptr += 1
items = []
for i in range(N):
c_i = int(input[ptr])
v_i = int(input[ptr+1])
ptr +=2
items.append( (i+1, c_i, v_i) ) # Store as (type_i, c_i, v_i)
INF = -10**18
dp = [ [INF] * (N + 1) for _ in range(N + 1) ]
dp[0][0] = 0
for idx in range(N):
type_i, c_i, v_i = items[idx]
# Decompose c_i into powers of two
t_list = []
remaining = c_i
t = 1
while remaining > 0:
if remaining >= t:
t_list.append(t)
remaining -= t
else:
t_list.append(remaining)
remaining = 0
t *= 2
# Process each t in t_list
for t in t_list:
# Iterate k and w in reverse order
for k in range(N, -1, -1):
for w in range(N, -1, -1):
if dp[k][w] != INF:
new_k = k + t
new_w = w + t * type_i
if new_k > N or new_w > N:
continue
new_v = dp[k][w] + t * v_i
if new_v > dp[new_k][new_w]:
dp[new_k][new_w] = new_v
# Prepare the result
result = []
for k in range(1, N+1):
max_val = INF
for w in range(0, N+1):
if dp[k][w] > max_val:
max_val = dp[k][w]
result.append(max_val)
# Print the results
for val in result:
print(val)
if __name__ == '__main__':
main()
gew1fw