TYVJ-1057 DP

/*
 * tyvj-1057
 * mike-w
 * 2012-10-30
 * ********************************
 * 又是惨痛的教训：注意细节&递推的依赖关系
 */
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define MAXN 33333
#define MAXM 66

int opt[MAXM][MAXN];
int v[MAXM], im[MAXM], c[MAXM][4], m[MAXM];
int N, M; /* N: total money; M: number of items */

int max(int e1, int e2)
{
	return e1>e2?e1:e2;
}

int main(void)
{
	int i, j, k, t3, ans;
	int i1, i2;

	scanf("%d%d", &N, &M);
	for(i=1; i<=M; i++)
	{
		scanf("%d%d%d", v+i, im+i, &t3);
		if(t3==0)
			m[i]=1; /* is main */
		else
			c[t3][++c[t3][0]]=i;
	}

	for(i=1; i<=M; i++)
	{
		for(j=1; j<=N; j++)
			opt[i][j]=opt[i-1][j];
		if(m[i])
		{

			for(j=v[i]; j<=N; j++) /* select main */
				opt[i][j]=max(opt[i][j], opt[i-1][j-v[i]]+v[i]*im[i]);
			for(k=1; k<=c[i][0]; k++) /* one main and one attachment */
			{
				i2=c[i][k];
				for(j=v[i]+v[i2]; j<=N; j++)
					opt[i][j]=max(opt[i][j], opt[i-1][j-v[i]-v[i2]]+v[i]*im[i]+v[i2]*im[i2]);
			}
			if(c[i][0]==2) /* one main and two attachments */
			{
				i1=c[i][1];
				i2=c[i][2];
				for(j=v[i]+v[i1]+v[i2]; j<=N; j++)
					opt[i][j]=max(opt[i][j], opt[i-1][j-v[i]-v[i1]-v[i2]]+v[i]*im[i]+v[i1]*im[i1]+v[i2]*im[i2]);
			}
		}
	}
	ans=0;
	for(i=1; i<=M; i++)
		ans=max(opt[i][N], ans);
	printf("%d\n", ans);
	return 0;
}