HDU 3449 Consumer 详细题解（依赖背包）

最新推荐文章于 2019-09-13 14:46:00 发布

键盘里的青春

最新推荐文章于 2019-09-13 14:46:00 发布

阅读量1.1k

点赞数 1

分类专栏：背包 ACM

本文链接：https://blog.youkuaiyun.com/qq_34374664/article/details/56017671

版权

本文介绍了HDU 3449 Consumer问题的解题思路，这是一个简单的依赖背包问题。在有限资金内，需购买包含物品的箱子以最大化价值。每个箱子有自己的价格，但不提供额外价值，且箱内物品独立。解决方法是对每个箱子进行01背包，然后对所有箱子再次进行01背包，以确定最合适的组合。注意，对于费用相同的物品，只需保留价值最大的，这样可以减少冗余策略，并通过一次01背包优化问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Consumer

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)
Total Submission(s): 2125 Accepted Submission(s): 1143

Problem Description

FJ is going to do some shopping, and before that, he needs some boxes to carry the different kinds of stuff he is going to buy. Each box is assigned to carry some specific kinds of stuff (that is to say, if he is going to buy one of these stuff, he has to buy the box beforehand). Each kind of stuff has its own value. Now FJ only has an amount of W dollars for shopping, he intends to get the highest value with the money.

Input

The first line will contain two integers, n (the number of boxes 1 <= n <= 50), w (the amount of money FJ has, 1 <= w <= 100000) Then n lines follow. Each line contains the following number pi (the price of the ith box 1<=pi<=1000), mi (1<=mi<=10 the number goods ith box can carry), and mi pairs of numbers, the price cj (1<=cj<=100), the value vj(1<=vj<=1000000)

Output

For each test case, output the maximum value FJ can get

Sample Input