soj 2749 The Fewest Coins(多重背包 + 完全背包)

---

题意:
你要买一个价值为t的东西.现在有n种货币,你有每种货币$C_i$张,而商店有每种物品无数张(豪….).,你支付过多的话,商店就会找你钱.问你在整个交易过程中,你能使用的货币数量最少为多少?
分析:
首先,我们需要观察到一个性质:最多只需要支付$t+120$的钱,也就是最多多支付一张钱.因为如果你再多支付第二张,到时候商店再给你找回来,压根没用.
然而就用多重背包,定义$dp[i]$为你支付i的钱数,需要的最小的钱张数.然后对于每个在(t ,t + 120)之间你可以支付的钱数x,都对$(x - t)$做完全背包,求出店家要找你这么多钱,所需要的最小的钱的张数k.这样交易过程中钱的张数就是$dp[i] + k$,求所有的$dp[i] + k$中最小的值即可.

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <set>
using namespace std;
const int mod = 1e9 + 9, maxn = 1e6 +9, INF = 0x3fffffff;
typedef long long  ll;
int v[1290], num[1290], n, price;
int dp[11000];

void multibag(int x, int y) {
    if (x * y >= price + 129) {
        for (int i = 0; i <= price; i++) {
            dp[i + x] = min(dp[i + x], dp[i] + 1);
        }
    } else {
        int k = 1;
        while (k < y) {
            for (int j = price + 122; j >= k * x; j--) {
                dp[j] = min(dp[j], dp[j - k * x] + k);
            }
            y -= k;
            k += k;
        }
        k = y;
        for (int j = price + 122; j >= k * x; j--) {
            dp[j] = min(dp[j], dp[j - k * x] + k);
        }
    }
}

int main(void) {
    while (~scanf("%d%d", &n, &price)) {
        for (int i = 0; i < n; i++)
            scanf("%d", &v[i]);
        for (int i = 0; i < n; i++)
            scanf("%d", &num[i]);

        fill(dp, dp + price + 200, INF);
        dp[0] = 0;
        for (int i = 0; i < n; i++) {
            multibag(v[i], num[i]);
        }
//       for (int i = 0 ; i <= 200; i++) if (dp[i] != INF)cout << i << ":" << dp[i] << " ";
//        cout << endl;
//        exit(0);
        int mins = INF;
        for (int k = price; k <= price + 122; k++) {
            if (dp[k] != INF) {
                int f[130];
                fill(f, f + 130, INF);
                f[0] = 0;
                for (int i = 0; i < n; i++) {
                    for (int j = v[i]; j <= k - price; j++) {
                        f[j] = min(f[j], f[j - v[i]] + 1);
                    }
                }
//                cout << k - price<< ":" << f[k - price] << endl;
                mins = min(mins, f[k - price] + dp[k]);
            }
        }
        if (mins != INF) printf("%d\n", mins);
        else puts("-1");
    }
    return 0;
}