HDU3591 混合背包

The trouble of Xiaoqian

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2277    Accepted Submission(s): 805

Problem Description

In the country of ALPC , Xiaoqian is a very famous mathematician. She is immersed in calculate, and she want to use the minimum number of coins in every shopping. (The numbers of the shopping include the coins she gave the store and the store backed to her.)
And now , Xiaoqian wants to buy T (1 ≤ T ≤ 10,000) cents of supplies. The currency system has N (1 ≤ N ≤ 100) different coins, with values V1, V2, ..., VN (1 ≤ Vi ≤ 120). Xiaoqian is carrying C1 coins of value V1, C2 coins of value V2, ...., and CN coins of value VN (0 ≤ Ci ≤ 10,000). The shopkeeper has an unlimited supply of all the coins, and always makes change in the most efficient manner .But Xiaoqian is a low-pitched girl , she wouldn’t like giving out more than 20000 once.

Input

There are several test cases in the input.
Line 1: Two space-separated integers: N and T.
Line 2: N space-separated integers, respectively V1, V2, ..., VN coins (V1, ...VN)
Line 3: N space-separated integers, respectively C1, C2, ..., CN
The end of the input is a double 0.

Output

Output one line for each test case like this ”Case X: Y” : X presents the Xth test case and Y presents the minimum number of coins . If it is impossible to pay and receive exact change, output -1.

Sample Input

3 70

5 25 50

5 2 1

0 0

Sample Output

Case 1: 3

题目大意就是小倩付多少钱才会有交换的硬币次数最少。

这是一道混合背包题目，小倩的硬币是多重背包，售货员的是完全背包。因为不会超过20000元；那么遍历就好了

AC代码：

 

 

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<string>
#define INF  9999999
#include<algorithm>
using namespace std;
int dp1[20005],dp2[20005];
int val[150],num[150];
int min(int x,int y)
{
    return x>y? y:x;
}
int main()
{
    int n,m;
    int T=1;
    while(cin>>n>>m)
    {
        if(n==0&&m==0)  break;
        for(int i=1;i<=n;i++)
            cin>>val[i];
        for(int i=1;i<=n;i++)
            cin>>num[i];
        for(int i=1;i<=20000;i++)
            dp1[i]=dp2[i]=INF;
        dp1[0]=dp2[0]=0;
        for(int i=1;i<=n;i++)//多重背包
        {
            for(int k=1,flag=0;;k*=2)
            {
                if(k*2>num[i])
                {
                    k=num[i]-k+1;
                    flag=1;
                }
                for(int j=20000;j>=k*val[i];j--)
                {
                    dp1[j]=min(dp1[j],dp1[j-k*val[i]]+k);
                }
                if(flag)
                    break;
            }
        }
        for(int i=1;i<=n;i++)//完全背包,这里有两种写法，一种是这种常规的优化了的，还有一种适合新手，虽然复杂度会高些，但是新手理解起来会更容易。
        {
            for(int j=val[i];j<=20000;j++)49                 dp2[j]=min(dp2[j],dp2[j-val[i]]+1);
        }
　　　　　　　/*
　　　　　　　 for(int i=1;i<=n;i++)
　　　　　　　{

　　　　　　　　　　for(int k=1;k*val[i]<20000;k*=2)//类比于多重背包
            　　　{
               　　　　 for(int j=20000;j>=k*val[i];j--)
               　　 　　{
                    　　　　dp2[j]=min(dp2[j],dp2[j-k*val[i]]+k);
                　　　　}　　
           　　 　　}
      　　　　 }

　　　　　　　　　　*/

        int lss=INF;
        for(int i=m;i<=20000;i++)
        {
            lss=min(lss,dp1[i]+dp2[i-m]);
        }
        if(lss>20000)
            cout<<"Case "<<T++<<": "<<-1<<endl;
        else
            cout<<"Case "<<T++<<": "<<lss<<endl;
    }
    return 0;
}