HDU3236 01背包增强版

Gift Hunting

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 349    Accepted Submission(s): 120

Problem Description

After winning two coupons for the largest shopping mart in your city, you can't wait inviting your girlfriend for gift hunting. Having inspected hundreds of kinds of souvenirs, toys and cosmetics, you finally narrowed down the candidate list to only n gifts, numbered 1 to n . Each gift has a happiness value that measures how happy your girlfriend would be, if you get this gift for her. Some of them are special - you must get it for your girlfriend (note that whether a gift is special has nothing to do with its happiness value).

Coupon 1 can be used to buy gifts with total price not greater than V 1 (RMB). Like most other coupons, you can’t get any money back if the total price is strictly smaller than V 1. Coupon 2 is almost the same, except that it’s worth V 2. Coupons should be used separately. That means you cannot combine them into a super-coupon that’s worth V 1+V 2. You have to divide the gifts you choose into two part, one uses coupon 1, the other uses coupon 2.

It is your girlfriend's birthday today. According to the rules of the mart, she can take one (only one) gift for FREE! Here comes your challenge: how to make your girlfriend as happy as possible?

 

 

Input

There will be at most 20 test cases. Each case begins with 3 integers V 1, V 2 and n (1 <= V 1 <= 500, 1 <= V 2 <= 50, 1 <= n <= 300), the values of coupon 1 and coupon 2 respectively, and the number of candidate gifts. Each of the following n lines describes a gift with 3 integers: P , H and S , where P is the price, H is the happiness (1 <= P,H <= 1000), S =1 if and only if this is a special gift - you must buy it (or get it for free). Otherwise S =0. The last test case is followed by V 1 = V 2 = n = 0, which should not be processed.

 

 

Output

For each test case, print the case number and the maximal total happiness of your girlfriend. If you can't finish the task, i.e. you are not able to buy all special gifts even with the 1-FREE bonus, the happiness is -1 (negative happiness means she's unhappy). Print a blank line after the output of each test case.

 

 

Sample Input

3 2 4

3 10 1

2 10 0

5 100 0

5 80 0

3 2 4

3 10 1

2 10 0

5 100 0

5 80 1

0 0 0

 

 

Sample Output

Case 1: 120

 

Case 2: 100

 

 

动态规划 ,01 背包的进化版 , 变成了 2 个背包 , 同时还增加了必拿的物品 .

设 res[k][i][j][x], 在前 k 个物品当中 , 当 x=0 时 , 表示在第一张购物卷为 i 元 , 第二张购物卷为 j 元 , 并且还没有免费拿一个物品的时候能获得的最大 happy 值 , 当 x=1 时表示免费拿了一个物品时的最大 happy 值 .

则转移方程就是 :

res[k][i][j][1]=max(res[k-1][i][j][0]+v[k],res[k-1][i-p[k]][j][1]+v[k],res[k-1][i][j-p[k]][1]+v[k])

res[k][i][j][0]=max(res[k-1][i][j][0],res[k-1][i-p[k]][j][0]+v[k],res[k-1][i][j-p[k]][0]+v[k])

当然 , 在这里必须优先考虑拿必拿的物品 , 而且在状态转移的时候也要注意 ,res[k][i][j][0] 的子状态 res[k-1][i-p[k]][j][1]+v[k], res[k-1][i][j-p[k]][1] 和 res[k][i][j][1] 的子状态 ,res[k-1][i-p[k]][j][0],res[k-1][i][j-p[k]][0] 都要满足已经拿到所有必拿的物品的情况下才能纳入状态转移的范围 .

 

代码如下 :

#include<stdio.h> #include<string.h> #include<algorithm> using std::sort; #define inf -2100000000 #define MAXV1 501 #define MAXV2 51 #define MAXN 301 struct T { int p,v,f; bool operator < (const T a) const { return f>a.f; } } gift[MAXN]; int res[MAXV1][MAXV2][2]; inline int max (int a,int b,int c=0,int d=0) { return (a>b?a:b)>(c>d?c:d)?(a>b?a:b):(c>d?c:d); } int main() { int v1,v2,n,i,j,k,m,ts; int cas=1; while (scanf("%d%d%d",&v1,&v2,&n)) { if (v1==0&&v2==0&&n==0) break; memset(res,0,sizeof(res)); ts=0; for (i=1; i<=n; ++i) { scanf("%d%d%d",&gift[i].p,&gift[i].v,&gift[i].f); if (gift[i].f==1) ts+=gift[i].v; } sort(gift+1,gift+n+1); for (k=1; k<=n; ++k) { if (gift[k].f==0) break; for (i=v1; i>=0; --i) { for (j=v2; j>=0; --j) { if (i>=gift[k].p&&j>=gift[k].p) { res[i][j][1]=max(res[i][j][0]+gift[k].v,res[i][j-gift[k].p][1]+gift[k].v,res[i-gift[k].p][j][1]+gift[k].v); res[i][j][0]=max(res[i][j-gift[k].p][0]+gift[k].v,res[i-gift[k].p][j][0]+gift[k].v); } else if (i>=gift[k].p) { res[i][j][1]=max(res[i][j][0]+gift[k].v,res[i-gift[k].p][j][1]+gift[k].v); res[i][j][0]=res[i-gift[k].p][j][0]+gift[k].v; } else if (j>=gift[k].p) { res[i][j][1]=max(res[i][j][0]+gift[k].v,res[i][j-gift[k].p][1]+gift[k].v); res[i][j][0]=res[i][j-gift[k].p][0]+gift[k].v; } else { res[i][j][1]=res[i][j][0]+gift[k].v; } } } } m=0; if (res[v1][v2][1]<ts&&res[v1][v2][0]<ts) m=-1; if (m==0) { for (; k<=n; ++k) { for (i=v1; i>=0; --i) { for (j=v2; j>=0; --j) { if (res[i][j][0]>=ts) res[i][j][1]=max(res[i][j][1],res[i][j][0]+gift[k].v); if (j>=gift[k].p&&res[i][j-gift[k].p][0]>=ts) res[i][j][0]=max(res[i][j-gift[k].p][0]+gift[k].v,res[i][j][0]); if (i>=gift[k].p&&res[i-gift[k].p][j][0]>=ts) res[i][j][0]=max(res[i-gift[k].p][j][0]+gift[k].v,res[i][j][0]); if (j>=gift[k].p&&res[i][j-gift[k].p][1]>=ts) res[i][j][1]=max(res[i][j-gift[k].p][1]+gift[k].v,res[i][j][1]); if (i>=gift[k].p&&res[i-gift[k].p][j][1]>=ts) res[i][j][1]=max(res[i-gift[k].p][j][1]+gift[k].v,res[i][j][1]); } } } for (i=1; i<=v1; ++i) { for (j=1; j<=v2; ++j) { m=max(m,res[i][j][0],res[i][j][1]); } } } printf("Case %d: %d/n/n",cas++,m); } return 0; }