I love sneakers!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4307 Accepted Submission(s): 1757
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.
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
2009 Multi-University Training Contest 13 - Host by HIT
/*
分组的01背包,题目很好,注意有0的情况需要将除0以外的 初始化为-1
加油!!!
Time:2015-4-26 15:33
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX=100000+10;
/*
需要将非0的初始化为-1,如果初始化为0,价格为0时无法判断是否凑够种类。
*/
int dp[12][MAX];
int main(){
int n,m,k;
int num[105],pri[105],weight[105];
while(scanf("%d%d%d",&n,&m,&k)!=EOF){
for(int i=1;i<=n;i++){
scanf("%d%d%d",&num[i],&pri[i],&weight[i]);
}
for(int i=0;i<=k;i++){
for(int j=0;j<=m;j++){
if(i==0)dp[i][j]=0;
else dp[i][j]=-1;
}
}
for(int i=1;i<=k;i++){//种类
for(int j=1;j<=n;j++){//总产品数目
if(num[j]==i){//种类从小到大,所以可以dp
for(int kk=m;kk>=pri[j];kk--){
dp[i][kk]=max(dp[i][kk],max(dp[i-1][kk-pri[j]]+weight[j],dp[i][kk-pri[j]]+weight[j]));
} /*原本的值 算上种类的价值 和不算种类的价值*/
}
}
}
if(dp[k][m]<0){
printf("Impossible\n");
}else{
printf("%d\n",dp[k][m]);
}
}
return 0;
}