poj 3260 The Fewest Coins 多重背包+完全背包

#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <stack>
#include <set>
#include <queue>
#include <vector>

using namespace std;

typedef long long ll;

const int maxn = 110;
const int maxm = 10200;
const int INF = 100000;

int a[maxn], c[maxn];
int dp[maxm + 15000];
int dp2[15000];
int V;

void ZeroOnePack(int cost, int weight)
{
    for(int i = V; i >= cost; i--)
    {
        dp[i] = min(dp[i], dp[i-cost] + weight);
    }
}

void CompletePack(int cost, int weight)
{
    for(int i = cost; i <= V; i++)
    {
        dp[i] = min(dp[i], dp[i-cost] + weight);
    }
}

void MultiplePack(int cost, int weight, int amount)
{
    if(cost*amount >= V)
    {
        CompletePack(cost, weight);
        return;
    }
    int k = 1;
    while(k < amount)
    {
        ZeroOnePack(k*cost, k*weight);
        amount = amount - k;
        k *= 2;
    }
    ZeroOnePack(amount*cost, amount*weight);
}

void CompletePack2(int cost, int weight)
{
    for(int i = cost; i < V; i++)
    {
        dp2[i] = min(dp2[i], dp2[i-cost] + weight);
    }
}

int main()
{
    //freopen("in.txt", "r", stdin);

    int n, m;

    while(scanf("%d%d", &n, &m) == 2)
    {
        memset(dp, 0x3f, sizeof(dp));
        memset(dp2, 0x3f, sizeof(dp2));
        dp[0] = dp2[0] = 0;

        for(int i = 0; i < n; i++)
            scanf("%d", &a[i]);

        for(int i = 0; i < n; i++)
            scanf("%d", &c[i]);

        V = m + 14400;
        for(int i = 0; i < n; i++)
            MultiplePack(a[i], 1, c[i]);

        V = 14400;
        for(int i = 0; i < n; i++)
        {
            CompletePack2(a[i], 1);
        }

        int ans = INF;
        for(int i = 0; i < 14400; i++)
        {
            ans = min(ans, dp[m+i] + dp2[i]);
        }

        if(ans == INF)
            printf("-1\n");
        else
            printf("%d\n", ans);
    }

    return 0;
}