tyvj 1057 金明的预算方案 背包dp

#include<bits/stdc++.h>
using namespace std;
#define ll __int64
#define esp 1e-13
const int N=1e3+10,M=1e6+1000,inf=1e9+10,mod=1000000007;
int a[N],b[N];
int son1u[N],son1v[N];
int son2u[N],son2v[N];
int dp[M];
int main()
{
    int x,y,z,i,t;
    scanf("%d%d",&x,&y);
    for(i=1; i<=y; i++)
    {
        int p;
        scanf("%d%d%d",&a[i],&b[i],&p);
        if(p)
        {
            if(son1v[p])
            {
                son2u[p]=a[i];
                son2v[p]=b[i];
            }
            else
            {
                son1u[p]=a[i];
                son1v[p]=b[i];
            }
            a[i]=0;
            b[i]=0;
        }
    }
    for(i=1; i<=y; i++)
    {
        for(t=x; t>=0; t--)
        {
            if(t>=a[i]+son1u[i]+son2u[i])
                dp[t]=max(dp[t],dp[t-(a[i]+son1u[i]+son2u[i])]+a[i]*b[i]+son1u[i]*son1v[i]+son2u[i]*son2v[i]);
            if(t>=a[i]+son1u[i])
                dp[t]=max(dp[t],dp[t-(a[i]+son1u[i])]+a[i]*b[i]+son1u[i]*son1v[i]);
            if(t>=a[i]+son2u[i])
                dp[t]=max(dp[t],dp[t-(a[i]+son2u[i])]+a[i]*b[i]+son2u[i]*son2v[i]);
            if(t>=a[i])
                dp[t]=max(dp[t],dp[t-a[i]]+a[i]*b[i]);
        }
    }
    printf("%d\n",dp[x]);
    return 0;
}