###### hdu3033I love sneakers!【分组背包】每组至少取一个

Total Submission(s): 4877    Accepted Submission(s): 2001

Problem Description
After months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sneaker store.

There are several brands of sneakers that Iserlohn wants to collect, such as Air Jordan and Nike Pro. And each brand has released various products. For the reason that Iserlohn is definitely a sneaker-mania, he desires to buy at least one product for each brand.
Although the fixed price of each product has been labeled, Iserlohn sets values for each of them based on his own tendency. With handsome but limited money, he wants to maximize the total value of the shoes he is going to buy. Obviously, as a collector, he won’t buy the same product twice.
Now, Iserlohn needs you to help him find the best solution of his problem, which means to maximize the total value of the products he can buy.

Input
Input contains multiple test cases. Each test case begins with three integers 1<=N<=100 representing the total number of products, 1 <= M<= 10000 the money Iserlohn gets, and 1<=K<=10 representing the sneaker brands. The following N lines each represents a product with three positive integers 1<=a<=k, b and c, 0<=b,c<100000, meaning the brand’s number it belongs, the labeled price, and the value of this product. Process to End Of File.

Output
For each test case, print an integer which is the maximum total value of the sneakers that Iserlohn purchases. Print "Impossible" if Iserlohn's demands can’t be satisfied.

Sample Input
5 10000 3 1 4 6 2 5 7 3 4 99 1 55 77 2 44 66

Sample Output
255

Source

Recommend
gaojie   |   We have carefully selected several similar problems for you:  2955 2602 1561 1203 3449

/***********
hdu3033
2016.3.13
109MS	5888K	1185 B	G++
***********/
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct node
{
int u,v;
}g[15][110];
int num[15],dp[110][10005];
int n,m,k,a,b,c;
int max(int a,int b){if(a>b)return a;return b;}
int main()
{
while(~scanf("%d%d%d",&n,&m,&k))
{
memset(num,0,sizeof(num));
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&a,&b,&c);
num[a]++;
g[a][num[a]].u=b;
g[a][num[a]].v=c;
}
memset(dp,-1,sizeof(dp));
memset(dp[0],0,sizeof(dp[0]));
for(int i=1;i<=k;i++)
{
for(int j=1;j<=num[i];j++)
{
for(int v=m;v>=g[i][j].u;v--)
{
if(dp[i][v-g[i][j].u]!=-1)
dp[i][v]=max(dp[i][v],dp[i][v-g[i][j].u]+g[i][j].v);
if(dp[i-1][v-g[i][j].u]!=-1)
dp[i][v]=max(dp[i][v],dp[i-1][v-g[i][j].u]+g[i][j].v);
}
}
}
if(dp[k][m]==-1)printf("Impossible\n");
else printf("%d\n",dp[k][m]);
}
return 0;
}


/***********
hdu3033
2016.3.13
93MS	5888K	1238B	G++
***********/
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct node
{
int u,v;
}g[15][110];
int num[15],dp[110][10005];
int n,m,k,a,b,c;
int max(int a,int b){if(a>b)return a;return b;}
#define inf  0x3f3f3f3f
int main()
{
while(~scanf("%d%d%d",&n,&m,&k))
{
memset(num,0,sizeof(num));
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&a,&b,&c);
num[a]++;
g[a][num[a]].u=b;
g[a][num[a]].v=c;
}
memset(dp,-inf,sizeof(dp));
memset(dp[0],0,sizeof(dp[0]));
for(int i=1;i<=k;i++)
{
for(int j=1;j<=num[i];j++)
{
for(int v=m;v>=g[i][j].u;v--)
{
//if(dp[i][v-g[i][j].u]!=-1)
dp[i][v]=max(dp[i][v],dp[i][v-g[i][j].u]+g[i][j].v);
//if(dp[i-1][v-g[i][j].u]!=-1)
dp[i][v]=max(dp[i][v],dp[i-1][v-g[i][j].u]+g[i][j].v);
}
}
}
if(dp[k][m]<0)printf("Impossible\n");
else printf("%d\n",dp[k][m]);
}
return 0;
}


#### hdu3033I love sneakers! 分组背包

2014-03-07 18:45:42

#### hdu 3033 I love sneakers! 分组背包之每组至少取一个

2012-08-09 16:18:23

#### HDU3033I love sneakers!（分组背包变形）

2018-03-08 19:36:43

#### HDU 3033 I love sneakers!（分组背包->每组至少取一个）

2016-09-25 17:13:55

#### hdu 3033 I love sneakers!(分组背包，每组至少取1个)

2011-10-12 15:56:59

#### hdu 3033 I love sneakers!(分组背包，每组至少取一件)

2014-05-04 20:34:18

#### I love sneakers! (分组背包)

2013-03-04 11:04:07

#### hdu3033I love sneakers! (分组背包，错了很多次)

2013-12-19 23:17:09

#### I love sneakers!（多重背包）

2017-06-14 00:15:51

#### 动态规划--至少取一个的分组背包--hdu3033 I love sneakers!

2017-07-21 10:46:38

## 不良信息举报

hdu3033I love sneakers!【分组背包】每组至少取一个