Buns CodeForces - 106C 多重背包

Lavrenty, a baker, is going to make several buns with stuffings and sell them.

Lavrenty has n grams of dough as well as m different stuffing types. The stuffing types are numerated from 1 to m. Lavrenty knows that he has ai grams left of the i-th stuffing. It takes exactly bi grams of stuffing i and ci grams of dough to cook a bun with the i-th stuffing. Such bun can be sold for di tugriks.

Also he can make buns without stuffings. Each of such buns requires c0 grams of dough and it can be sold for d0 tugriks. So Lavrenty can cook any number of buns with different stuffings or without it unless he runs out of dough and the stuffings. Lavrenty throws away all excess material left after baking.

Find the maximum number of tugriks Lavrenty can earn.

Input
The first line contains 4 integers n, m, c0 and d0 (1 ≤ n ≤ 1000, 1 ≤ m ≤ 10, 1 ≤ c0, d0 ≤ 100). Each of the following m lines contains 4 integers. The i-th line contains numbers ai, bi, ci and di (1 ≤ ai, bi, ci, di ≤ 100).

Output
Print the only number — the maximum number of tugriks Lavrenty can earn.

Example
Input
10 2 2 1
7 3 2 100
12 3 1 10
Output
241
Input
100 1 25 50
15 5 20 10
Output
200
Note
To get the maximum number of tugriks in the first sample, you need to cook 2 buns with stuffing 1, 4 buns with stuffing 2 and a bun without any stuffing.

In the second sample Lavrenty should cook 4 buns without stuffings.

裸的多重转01背包

#include <bits/stdc++.h>

using namespace std;
const int maxn = 20;
int a[20],b[20],c[20],d[20];
int k[20];
int w[202000],v[202000];
int dp[1010];
int main()
{
    int n,m,co,dd;
    scanf("%d%d%d%d",&n,&m,&co,&dd);
    for(int i=1;i<=m;i++)
        scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
    for(int i=1;i<=m;i++)
    k[i]=a[i]/b[i];
    k[0]=n/co;
    c[0]=co;
    d[0]=dd;
    int cnt=0;

    for(int i=0;i<=m;i++)
    {
        while(k[i])
        {
            w[++cnt]=c[i];
            v[cnt]=d[i];
            k[i]--;
        }
    }

    for(int i=1;i<=cnt;i++)
    {
        for(int j=n;j>=w[i];j--)
            dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
    }
    printf("%d\n",dp[n] );  
}