hdu 5410

CRB and His Birthday

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 625    Accepted Submission(s): 325

Problem Description

Today is CRB's birthday. His mom decided to buy many presents for her lovely son.
She went to the nearest shop with  M  Won(currency unit).
At the shop, there are  N  kinds of presents.
It costs  Wi  Won to buy one present of  i -th kind. (So it costs  k  ×  Wi  Won to buy  k  of them.)
But as the counter of the shop is her friend, the counter will give  Ai × x + Bi  candies if she buys  x ( x >0) presents of  i -th kind.
She wants to receive maximum candies. Your task is to help her.
1 ≤  T  ≤ 20
1 ≤  M  ≤ 2000
1 ≤  N  ≤ 1000
0 ≤  Ai, Bi  ≤ 2000
1 ≤  Wi  ≤ 2000

 

Input

There are multiple test cases. The first line of input contains an integer  T , indicating the number of test cases. For each test case:
The first line contains two integers  M  and  N .
Then  N  lines follow,  i -th line contains three space separated integers  Wi ,  Ai  and  Bi .

 

Output

For each test case, output the maximum candies she can gain.

 

Sample Input

  
  

   
   1
100 2
10 2 1
20 1 1
  
  

 

Sample Output

  
  

   
   21

   
   

    
    

     
     Hint
    
    
CRB's mom buys 10 presents of first kind, and receives 2 × 10 + 1 = 21 candies.
   
   
   
    
  
  

 

Author

KUT（DPRK）

 

Source

2015 Multi-University Training Contest 10

 

Recommend

wange2014

 

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;
#define N 1005
#define INF 0x3f3f3f3f

int n, M, a[N], b[N], w[N];
int d[2 * N];

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d", &M, &n);
        for(int i = 1; i <= n; i++)
            scanf("%d%d%d", &w[i], &a[i], &b[i]);
            
        memset(d, 0, sizeof d);
        int ans = -INF;
        for(int i = 1; i <= n; i++)
            for(int j = M; j >= w[i]; j--)
                d[j] = max(d[j], d[j - w[i]] + a[i] + b[i]);

        for(int i = 1; i <= n; i++)
            for(int j = w[i]; j <= M; j++)
                d[j] = max(d[j], d[j - w[i]] + a[i]);
        printf("%d\n", d[M]);
    }
}

/*

1
100 2
10 2 1
20 1 1


*/