CodeForces 106C Buns (多重背包)

C. Buns

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 4integers. 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.

Examples

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.

题意：做一个面包，一共有m种调料，第i种调料一共有ai克，每次可以放bi克，会花费ci克，产生的价值为di，也可以不放调料，会花费c0克，产生的价值为d0，该面包一共有n克，求能出售的最大价值。

思路：每种调料最多可以放ai/bi次，最少0次，放一次产生的价值为di，然后多重背包求解即可。

#include <bits/stdc++.h>
using namespace std;

int dp[1005],n,m,c0,d0;;
struct node{
	int a,b,c,d;
	int num;
}p[1005];

void CompletePack(int cost, int weight){
	for(int i = cost; i <= n; i ++){
		dp[i] = max(dp[i],dp[i-cost] + weight);
	}
}

void ZeroOnePack(int cost, int weight){
	for(int i = n; i >= cost; i --){
		dp[i] = max(dp[i],dp[i-cost] + weight);
	}
}

int main(){
	while(~scanf("%d%d%d%d",&n,&m,&c0,&d0)){
		for(int i = 1; i <= m; i ++){
			scanf("%d%d%d%d",&p[i].a,&p[i].b,&p[i].c,&p[i].d);
			p[i].num = p[i].a / p[i].b;
		}
		memset(dp,0,sizeof(dp));
		for(int i = c0; i <= n; i ++){
			dp[i] = (i / c0) * d0;
		}
		for(int i = 1; i <= m; i ++){
			if(p[i].c * p[i].num >= n){
				CompletePack(p[i].c,p[i].d);
			}
			else{
				int k = 1,amount = p[i].num;
				while(k < amount){
					ZeroOnePack(p[i].c*k,p[i].d*k);
					amount -= k;
					k <<= 1;
				}
				ZeroOnePack(amount * p[i].c,amount* p[i].d);
			}
		}
		printf("%d\n",dp[n]);
	}
	return 0;
}