1 // Problem#: 1346
 2 // Submission#: 1457193
 3 // The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
 4 // URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
 5 // All Copyright reserved by Informatic Lab of Sun Yat-sen University
 6 #include<iostream>
 7 #include<memory.h>
 8 using namespace std;
 9 int main()
10 {
11     int n,m;
12     while(cin>>n>>m)
13     {
14             int vv[61],pp[61],qq[61];
15             memset(vv,0,sizeof(vv));
16             memset(pp,0,sizeof(pp));
17             memset(qq,0,sizeof(qq));
18
19
20             int p[61][4],v[61][4];
21             int a[61][2];         //一个主件最多有两个附件，没有的话就记为0
22             memset(v,0,sizeof(v));
23             memset(p,0,sizeof(p));
24             memset(a,0,sizeof(a));
25
26             for(int i=1;i<=m;i++)
27             {
28                cin>>vv[i]>>pp[i]>>qq[i];
29                if(qq[i])             //标记附件
30                {
31                         if(!a[qq[i]][0])
32                         a[qq[i]][0] = i;
33                         else
34                         a[qq[i]][1] = i;
35                }
36             }
37             int f[61][4];     //存放每种情况的价值v*p；
38             memset(f,0,sizeof(0));
39             for(int i=1;i<=m;i++)     //变成分组背包
40             {
41                 if(!qq[i])
42                 {
43                   f[i][0] = vv[i] * pp[i];
44                   f[i][1] = vv[ a[i][0] ]*pp[ a[i][0] ] + vv[i] * pp[i];
45                   f[i][2] = vv[ a[i][1] ]*pp[ a[i][1] ] + vv[i] * pp[i];
46                   f[i][3] = vv[ a[i][0] ]*pp[ a[i][0] ] + vv[ a[i][1] ]*pp[ a[i][1] ] + vv[i] * pp[i];
47
48                   v[i][0] = vv[i];
49                   v[i][1] = vv[ a[i][0] ] + vv[i];
50                   v[i][2] = vv[ a[i][1] ] + vv[i];
51                   v[i][3] = vv[ a[i][0] ] + vv[ a[i][1] ] + vv[i];
52                 }
53             }
54
55
56             int dp[n+1];
57             memset(dp,0,sizeof(dp));
58             for(int i=1;i<=m;i++)       //分组背包
59             {
60               if(!qq[i])
61                   for(int j=n;j>=0;j--)
62                      for(int k=0;k<4;k++)
63                      {
64                              if(j-v[i][k]>=0)
65                              dp[j]=max(dp[j],dp[j-v[i][k]] + f[i][k]);
66                      }
67             }
68             cout<<dp[n]<<endl;
69     }
70     return 0;
71 }