0pts 求调

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

struct mainthing
{
	int v1, p1;
} a[61];

struct second
{
	int v2, p2;
} b[61][3];

int pp[61];

int f[61][32001];

int pos2[61];

int main()
{
	int n, m;
	cin >> n >> m;
	int pos1 = 0, zz = 0, mmj = 0, mmi = 0;
	for(int i = 1; i <= m; i++)
	{
		int x, y, z;
		cin >> x >> y >> z;
		if(z == 0)
		{
			pos1++;
			a[pos1].v1 = x;
			a[pos1].p1 = y;
			pos2[i] = pos1;
		}
		else 
		{
			pp[pos2[z]]++;
			b[z][pp[pos2[z]]].v2 = x;
			b[z][pp[pos2[z]]].p2 = y;
		}
	}
	for(int j = 0; j <= n; j++)
	{
		for(int i = 1; i <= pos1; i++)
		{
			int maxn = max(f[i - 1][j], f[i - 1][j - a[i].v1] + a[i].v1 * a[i].p1);
			if(pp[i] == 2)
			{
				maxn = max(maxn, f[i][j - a[i].v1 - b[i][1].v2] + a[i].v1 * a[i].p1  + b[i][1].v2 * b[i][1].p2);
				maxn = max(maxn, f[i][j - a[i].v1 - b[i][1].v2 - b[i][2].v2] + a[i].v1 * a[i].p1  + b[i][1].v2 * b[i][1].p2 + b[i][2].v2 * b[i][2].p2);
				maxn = max(maxn, f[i][j - a[i].v1 - b[i][2].v2] + a[i].v1 * a[i].p1  + b[i][2].v2 * b[i][2].p2);
			}
			if(pp[i] == 1)
			{
				maxn = max(maxn, f[i][j - a[i].v1 - b[i][1].v2] + a[i].v1 * a[i].p1  + b[i][1].v2 * b[i][1].p2);
			}
			
			f[i][j] = maxn;
		}
	}
	cout << f[pos1][n];
	return 0;
}