POJ 3260 - The Fewest Coins(完全背包+多重背包)

Description

Farmer John has gone to town to buy some farm supplies. Being a very efficient man, he always pays for his goods in such a way that the smallest number of coins changes hands, i.e., the number of coins he uses to pay plus the number of coins he receives in change is minimized. Help him to determine what this minimum number is.

FJ wants to buy T (1 ≤ T ≤ 10,000) cents of supplies. The currency system has N (1 ≤ N ≤ 100) different coins, with values V₁, V₂, ..., V_N (1 ≤ V_i ≤ 120). Farmer John is carrying C₁ coins of value V₁, C₂ coins of value V₂, ...., and C_N coins of value V_N (0 ≤ C_i ≤ 10,000). The shopkeeper has an unlimited supply of all the coins, and always makes change in the most efficient manner (although Farmer John must be sure to pay in a way that makes it possible to make the correct change).

Input

Line 1: Two space-separated integers: N and T.
Line 2: N space-separated integers, respectively V ₁, V ₂, ..., V_N coins ( V ₁, ... V_N)
Line 3: N space-separated integers, respectively C ₁, C ₂, ..., C_N

Output

Line 1: A line containing a single integer, the minimum number of coins involved in a payment and change-making. If it is impossible for Farmer John to pay and receive exact change, output -1.

Sample Input

3 70
5 25 50
5 2 1

Sample Output

3

Hint

Farmer John pays 75 cents using a 50 cents and a 25 cents coin, and receives a 5 cents coin in change, for a total of 3 coins used in the transaction.

                                                      

思路： 支付的时候对硬币数量没有限制，所以用多重背包求解，dp2【】表示支付i 元时需要的最少硬币数。找零时对硬币数量没有限制，所以用完全背包求解，dp1【】表示找i 元时需要的硬币数。给钱的上界是t + maxn * maxn。

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int inf = 0xfffffff;
const int Mn = 105;
const int Mt = 10005 + 105 * 105;
int a[Mn], b[Mn], u[10005];
int dp1[Mt], dp2[Mt];

int main()
{
    //freopen("in", "r", stdin);
    int n, m;
    while(~scanf("%d %d", &n, &m)){
        int maxn = 0;
        for(int i = 0; i < n; ++i){
            scanf("%d", &a[i]);
            maxn = max(maxn, a[i]);
        }
        maxn = maxn * maxn;
        int maxt = maxn + m;
        for(int i = 0; i < n; ++i){
            scanf("%d", &b[i]);
        }
        for(int i = 0; i <= maxt; ++i) dp1[i] = dp2[i] = inf;
        dp1[0] = dp2[0] = 0;

        for(int i = 0; i < n; ++i){
            for(int j = a[i]; j < maxn; ++j){
                dp1[j] = min(dp1[j - a[i]] + 1, dp1[j]);
            }
        }

        for(int i = 0; i < n; ++i){
            int k = 1;
            int s = 0;
            while(s < b[i]){
                for(int j = maxt; j >= a[i]*k; --j){
                    dp2[j] = min(dp2[j], dp2[j - a[i]*k] + k);
                }
                s += k;
                if(s + k*2 > b[i]) k = b[i] - s;
                else k *= 2;
            }
        }

        int minn = inf;
        for(int i = m; i <= maxt; ++i){
            minn = min(minn, dp2[i] + dp1[i - m]);
        }
        if(minn == inf) printf("-1\n");
        else printf("%d\n", minn);
    }
    return 0;
}