poj1170 Shopping Offers【状压+背包】

传送门：http://poj.org/problem?id=1170

Description

In a shop each kind of product has a price. For example, the price of a flower is 2 ICU (Informatics Currency Units) and the price of a vase is 5 ICU. In order to attract more customers, the shop introduces some special offers.
A special offer consists of one or more product items for a reduced price. Examples: three flowers for 5 ICU instead of 6, or two vases together with one flower for 10 ICU instead of 12.
Write a program that calculates the price a customer has to pay for certain items, making optimal use of the special offers. That is, the price should be as low as possible. You are not allowed to add items, even if that would lower the price.
For the prices and offers given above, the (lowest) price for three flowers and two vases is 14 ICU: two vases and one flower for the reduced price of 10 ICU and two flowers for the regular price of 4 ICU.

Input

Your program is to read from standard input. The first line contains the number b of different kinds of products in the basket (0 <= b <= 5). Each of the next b lines contains three values c, k, and p. The value c is the (unique) product code (1 <= c <= 999). The value k indicates how many items of this product are in the basket (1 <= k <= 5). The value p is the regular price per item (1 <= p <= 999). Notice that all together at most 5*5=25 items can be in the basket. The b+2nd line contains the number s of special offers (0 <= s <= 99). Each of the next s lines describes one offer by giving its structure and its reduced price. The first number n on such a line is the number of different kinds of products that are part of the offer (1 <= n <= 5). The next n pairs of numbers (c,k) indicate that k items (1 <= k <= 5) with product code c (1 <= c <= 999) are involved in the offer. The last number p on the line stands for the reduced price (1 <= p <= 9999). The reduced price of an offer is less than the sum of the regular prices.

Output

Your program is to write to standard output. Output one line with the lowest possible price to be paid.

Sample Input

2
7 3 2
8 2 5
2
1 7 3 5
2 7 1 8 2 10

Sample Output

14

大体题意就是给出一个含有多个物品的折扣组合，求一个订单的最小消费是多少。
状压就是每个物品的个数最多只有六种状态，可以使用六进制的方式表示每一个物品的数目。两个状态相减只有当第一种状态的每一个物品数目不小于第二种状态的数目的时候才可以相减，否则减完没有意义。
代码：

#include <cstring>
#include <iostream>
#include <map>
using namespace std;
map<int, int> mp;
int b, target, tot;
int power[7], cost[200], w[200], dp[10000];
inline void init() {
    target = 0;
    mp.clear();
    memset(dp,0x3f,sizeof dp);dp[0]=0;
    memset(cost,0,sizeof cost);
    memset(w,0,sizeof w);
    power[0] = 1;
    for (int i = 1; i < 6; i++) power[i] = power[i - 1] * 6;
}
inline bool ok(int x, int y) {
    for (int i = 0; i < 6; i++) {
        if (x % 6 < y % 6) return false;
        x /= 6;
        y /= 6;
    }
    return true;
}
int main() {
    ios::sync_with_stdio(false);
    while (cin >> b) {
        init();
        for (int i = 0; i < b; i++) {
            int c, k, p;
            cin >> c >> k >> p;
            mp[c] = i;
            target += power[i] * k;
            cost[tot] = power[i];//单个物品也是一种组合
            w[tot++] = p;
        }
        int s;
        cin >> s;
        for (int i = 1; i <= s; i++) {
            int n, p;
            cin >> n;
            for (int j = 1; j <= n; j++) {
                int c, k;
                cin >> c >> k;
                cost[tot] += power[mp[c]] * k;
            }
            cin>>p;
            w[tot++] = p;
        }
        for (int i = 0; i < tot; i++) {
            for (int j = cost[i]; j <= target; j++) {//完全背包
                if (ok(j, cost[i])) {//当前的每一个物品都不少于c[i]中的物品时才转移
                    dp[j] = min(dp[j], dp[j - cost[i]] + w[i]);
                }
            }
        }
        cout<<dp[target]<<endl;
    }
    return 0;
}