关闭

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

标签: dp杭电
479人阅读 评论(0) 收藏 举报
分类:

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 
 

就比之前的题变形了这么一点点就不会啦~总记得貌似之前限制“1”的题在这里 hdu3535

既然重点是如何限制每组取的至少一个,我们需要想一下背包转移的原理:每次遍历背包大小,容量减去此物品的体积,价值加上此物品的价值。而相对于现在状态的前一转移状态下标是“体积”。而事实上,我们只是由于第一重循环的遍历省去了第一维表示组别的下标。拿这道题来说,我们不能只考虑体积作为下标,由于dp的状态可以由本组的状态转移,也可以由上一组的状态转移,所以加了一维表示组别。最开始赋值为-1,第0组是0,sizeof注意是dp[0]。上一状态是-1的不选

/***********
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;
}

所以说,根据3535的思想,最开始直接赋值成-inf就可以了也用不着判断之前那个点是否能取到,反正就算加进去到了最后也是小于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;
}



0
0
查看评论

hdu3033I love sneakers! 分组背包

#include #include #include using namespace std; /* 本题是很好的分组背包题目;难点在于如何知道每种牌子的鞋, 都买了至少一双, 自己没有思路, 看别人的代码, 关键在于对dp[][]的初始化, 这样做 memset(dp, -1, size...
  • qqchenjunwei
  • qqchenjunwei
  • 2014-03-07 18:45
  • 457

HDU 3033 I love sneakers!(分组背包->每组至少取一个)

I love sneakers! Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Su...
  • yjf3151731373
  • yjf3151731373
  • 2016-09-25 17:13
  • 39

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

http://acm.hdu.edu.cn/showproblem.php?pid=3033 大致题意:某人要买鞋子,有k种鞋,要求每种鞋至少买一双,给出每双鞋子的花费和价值,问m元钱可以买到的鞋子的最大价值是多少。 思路:分组背包问题。与传统的分组背包不同:每组物品至少取一件;且每组中物品任意...
  • u013081425
  • u013081425
  • 2014-05-04 20:34
  • 1110

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

I love sneakers! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1094&#...
  • fp_hzq
  • fp_hzq
  • 2011-10-12 15:56
  • 1477

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

Problem Description After months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to sp...
  • u010372095
  • u010372095
  • 2013-12-19 23:17
  • 890

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

n个物品,m元钱,k种种类。 求每个种类至少取一个物品,所能得到的最大价值。 分类里互斥的分组背包,每种类别最多取一个。 for all 组k for u = V to 0 for i 属于k dp[ k ][ u ] = max( dp[ k - 1 ][ u ], dp[ k ][ u - ...
  • SM_545
  • SM_545
  • 2017-07-21 10:46
  • 104

I love sneakers! (分组背包)

1、http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1012&ojid=0&cid=3900&hide=0 密码:xx316 2、题目大意:Iserlohn有很多钱,想要买很多双运动鞋,鞋有很多品牌...
  • sdjzping
  • sdjzping
  • 2013-03-04 11:04
  • 540

HDU 3033 I love sneakers! 每组最至少取一个的分组背包

转载请注明出处,谢谢 http://blog.csdn.net/ACM_cxlove?viewmode=contents           by---cxlove 这是一个每组最少要取一个的分组背...
  • ACM_cxlove
  • ACM_cxlove
  • 2012-07-07 20:01
  • 1251

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

I love sneakers! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1895&#...
  • hnust_xiehonghao
  • hnust_xiehonghao
  • 2012-08-09 16:18
  • 1119

HDU 3033 I love sneakers! 分组背包+约束限制(每组至少取一个)。

注意至少取一个,仔细分析一下,此时光靠一个一维数组是不可以完成状态转移的,必须用二维数组或两个一维数组(滚动数组)。 建议多用二维数组,二维数组比较好理解,不容易出错,除非数据量太大,二维开不下。当然,如果对状态转移理解的比较深刻可以尝试着写成滚动数组。 先讲一讲二维数组的做法: dp[i][...
  • c3568
  • c3568
  • 2013-08-29 10:33
  • 498
    碎碎念
    周小姐,你还想毕业找不到工作吗????
    个人资料
    • 访问:279742次
    • 积分:8807
    • 等级:
    • 排名:第2603名
    • 原创:608篇
    • 转载:25篇
    • 译文:0篇
    • 评论:38条
    友情链接