HDU 5410 CRB and His Birthday

CRB and His Birthday

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

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

 

[plain]  view plain  copy

1. #include <iostream>  
2. #include <iomanip>  
3. #include<stdio.h>  
4. #include<string.h>  
5. #include<stack>  
6. #include<stdlib.h>  
7. #include<queue>  
8. #include<math.h>  
9. #include<algorithm>  
10. #include<vector>  
11. #define mem(a,b) memset(a,b,sizeof(a))  
12. using namespace std;  
13. int w[2005],a[2005],b[2005],sum[2005];  
14. int main()  
15. {  
16.    int s;  
17.    scanf("%d",&s);  
18.    while(s--)  
19.    {  
20.        int m,n;  
21.        scanf("%d%d",&m,&n);  
22.        for(int i=1;i<=n;i++)  
23.        {  
24.            scanf("%d%d%d",&w[i],&a[i],&b[i]);  
25.        }  
26.        mem(sum,0);  
27.        for(int i=1;i<=n;i++)  
28.        {  
29.            for(int j=m;j>=w[i];j--)  
30.            {  
31.                sum[j]=max(sum[j],sum[j-w[i]]+a[i]+b[i]);  
32.            }  
33.            for(int j=w[i];j<=m;j++)  
34.            {  
35.                sum[j]=max(sum[j],sum[j-w[i]]+a[i]);  
36.            }  
37.        }  
38.   
39.        printf("%d\n",sum[m]);  
40.   
41.   
42.    }  
43. }