Shopping Offers
IOI'95

In a certain shop, each kind of product has an integer price. For example, the price of a flower is 2 zorkmids (z) and the price of a vase is 5z. In order to attract more customers, the shop introduces some special offers.

A special offer consists of one or more product items together for a reduced price, also an integer. Examples:

• three flowers for 5z instead of 6z, or
• two vases together with one flower for 10z instead of 12z.

Write a program that calculates the price a customer has to pay for a purchase, making optimal use of the special offers to make the price 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 14z: two vases and one flower for the reduced price of 10z and two flowers for the regular price of 4z.

### INPUT FORMAT

The input file has a set of offers followed by a purchase.
 Line 1: s, the number of special offers, (0 <= s <= 99). Line 2..s+1: Each line describes an offer using several integers. The first integer is n (1 <= n <= 5), the number of products that are offered. The subsequent n pairs of integers c and k indicate that k items (1 <= k <= 5) with product code c (1 <= c <= 999) are part of 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. Line s+2: The first line contains the number b (0 <= b <= 5) of different kinds of products to be purchased. Line s+3..s+b+2: Each of the subsequent 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 to be purchased (1 <= k <= 5). The value p is the regular price per item (1 <= p <= 999). At most 5*5=25 items can be in the basket.

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

### OUTPUT FORMAT

A single line with one integer: the lowest possible price to be paid for the purchases.

### SAMPLE OUTPUT (file shopping.out)

`14`
```解答:0 <= b <= 5,1 <= k <= 5,可用5*5*5*5*5的DP 每种买0~5个，可以用6进制表示，然后5维DP~OK!

/*ID: kuramaw1PROG: shoppingLANG: C++*/#include <fstream>#include <cstring>using std::ifstream;using std::ofstream;using std::endl;#define  MAX_T(a,b) ((a)>(b)?(a):(b))#define  MAX 5#define  MAX_S 100int f[MAX+1][MAX+1][MAX+1][MAX+1][MAX+1];//min priceshort s,b;short s_p[MAX_S],component[MAX_S][MAX],p_num[MAX],p[MAX],p_t(0),order[MAX];inline short product_code_to_order(short code){    for(int i=0;i<p_t;i++)     if(p_num[i]==code)         return i;    p_num[p_t++]=code;    return (p_t-1);}int main(){    ifstream in("shopping.in");    in>>s;    memset(component,0,sizeof(component));    for(int i=0;i<s;i++)    {        short n;        in>>n;        for(int j=0;j<n;j++)        {            short c,k;            in>>c>>k;            component[i][product_code_to_order(c)]=k;        }        in>>s_p[i];                }    memset(order,0,sizeof(order));    memset(p,0,sizeof(p));    in>>b;    for(int i=0;i<b;i++)    {        short c,k,p1;        in>>c>>k>>p1;        short n=product_code_to_order(c);        order[n]=k;        p[n]=p1;    }    in.close();    //do dp    short ii[MAX];#define loop(i)  for(ii[i]=0;ii[i]<=order[i];ii[i]++)#define  F(a) f[a[0]][a[1]][a[2]][a[3]][a[4]]        loop(0) loop(1) loop(2) loop(3) loop(4)    {        F(ii)=ii[0]*p[0]+ii[1]*p[1]+ii[2]*p[2]+ii[3]*p[3]+ii[4]*p[4];        for(short j=0;j<s;j++)        {            short t[MAX];            for(short k=0;k<5;k++)                t[k]=MAX_T(0,ii[k]-component[j][k]);            if(F(t)+s_p[j]<F(ii))                F(ii)=F(t)+s_p[j];        }    }    //out    ofstream out("shopping.out");    out<<F(order)<<endl;    out.close();}

```
posted on 2009-08-13 11:46 kuramawzw 阅读(270) 评论(0)  编辑 收藏 引用 所属分类: USACO

 < 2009年8月 >
2627282930311
2345678
9101112131415
16171819202122
23242526272829
303112345

•