Submission #491326

#	Time	Username	Problem	Language	Result	Execution time	Memory
491326		DDTerziev04	Knapsack (NOI18_knapsack)	C++14	73 / 100	1082 ms	2652 KiB

knapsack

#include<iostream>
using namespace std;

const int MAXN=1e5, MAXS=2000;

long long dp[MAXS+1];
long long p[MAXN], w[MAXN], h[MAXN];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    long long s, n;
    cin >> s >> n;

    for(int i=0; i<n; i++)
    {
        cin >> p[i] >> w[i] >> h[i];
    }

    for(int i=0; i<=s; i++)
    {
        dp[i]=-1;
    }
    dp[0]=0;

    long long ans=0;
    for(int i=0; i<n; i++)
    {
        for(int j=s; j>=0; j--)
        {
            for(int u=1; u<=h[i] && u*w[i]<=j; u++)
            {
                if(dp[j-u*w[i]]==-1)
                {
                    continue;
                }

                dp[j]=max(dp[j], dp[j-u*w[i]]+u*p[i]);
            }

            ans=max(ans, dp[j]);
        }
    }

    cout << ans << "\n";

    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27