来源:http://poj.org/problem?id=1170
题意:给定一个订单的n种商品,每种商品都有一个价格、数量,在给定m种组合,这些组合会得到便宜的价钱。问怎么分配使总价值最小。
分析:先将每种物品用一个六进制表示,一个物品为1,第2个为6...,这样总状态为num1*1+num2*6+...然后对n+m种物品进行一个完全背包。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <cstring>
using namespace std;
#define MAX 110000
#define INF (1<<29)
#define min(a,b) ((a)<(b)?(a):(b))
struct product
{
int code,digit,num,price;
} arr[MAX],special[MAX];
int dp[MAX],hash[1000],n,m,nn,ans;
int digit[10] = {1,6,36,216,1296,7776,46656,279936};
int main()
{
int tp,num,code,k;
while (scanf("%d",&n) != EOF)
{
ans = nn = 0;
memset(hash,-1,sizeof(hash));
for (int i = 0; i < digit[6]; ++i)
dp[i] = INF;
for (int i = 0; i < n; ++i)
{
scanf("%d%d%d",&arr[i].code,&arr[i].num,&arr[i].price);
arr[i].digit = digit[i];
hash[arr[i].code] = i;
nn += arr[i].num * arr[i].digit;
ans += arr[i].num * arr[i].price;
}
scanf("%d",&m);
for (int i = 0; i < m; ++i)
{
scanf("%d",&k);
arr[i+n].digit = 0;
for(int j = 0; j < k; ++j)
{
scanf("%d%d",&code,&num);
if (hash[code] == -1)
continue;
arr[i+n].digit += arr[hash[code]].digit * num;
}
scanf("%d",&arr[i+n].price);
}
dp[0] = 0;
for(int i = 0; i <= nn; ++i)
for(int j = 0; j < n + m; ++j)
dp[i+arr[j].digit] = min(dp[i+arr[j].digit],dp[i]+arr[j].price);
ans = min(ans,dp[nn]);
printf("%d\n",ans);
}
return 0;
}