Shopping Offers POJ - 1170

多重背包

组合物品，将其视为一个。应为总共最多五个物品，将每一种的组合转化为6进制。就可以用一维替代，多维的物品，剩下的就是多重背包了

#include<iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
#define fst first
#define sec second
#define sci(num) scanf("%d",&num)
#define scl(num) scanf("%lld",&num)
#define mem(a,b) memset(a,b,sizeof a)
#define cpy(a,b) memcopy(a,b,sizeof b)
typedef long long LL;
typedef pair<int,int> P;
const int MAX_N = 1010;
const int MAX_M = 10000;
int SIX[10] = {1,6,6*6,6*6*6,6*6*6*6};
int HASH[MAX_N];
struct Pr{
    int num,prc;
    int bs;
} ps[MAX_N];
int dp[10010];
int main()
{
    mem(dp,0x3f3f3f3f);
    dp[0] = 0;
    mem(HASH,-1);
    int sum = 0;
    int B;
    sci(B);
    for (int i =0;i < B;i++) {
        int id;
        sci(id); HASH[id] = i;
        sci(ps[i].num); sci(ps[i].prc);
        ps[i].bs = SIX[HASH[id]];
        sum += SIX[HASH[id]] * ps[i].num;
    }
    int N;
    sci(N);
    for (int i =0;i < N;i++) {
        int k = 0;
        sci(k);
        int code = 0;
        //int 
   
   
    
    sump
   
    = 0;
        while (k--) {
            int id,num;
            sci(id); sci(num);
            code += SIX[HASH[id]] * num;
            //sump += ps[HASH[id]].prc * num;
        }
        ps[i+B].bs = code;
        sci(ps[i+B].prc);

    }
    for (int i = 0; i < B + N;i++) {
        for (int now = ps[i].bs;now <= sum;now++) {
            dp[now] = min(dp[now - ps[i].bs] + ps[i].prc,dp[now]);
        }
    }
    printf("%d\n",dp[sum]);
    return 0;
}