Submission #1289518

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289518		kubinsgk8	Knapsack (NOI18_knapsack)	C++20	37 / 100	1096 ms	1868 KiB

knapsack

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

long long dp[102][2001];

long long value[101], w[101], cop[101];

long long n, s;


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

    cin>>s>>n;

    for(int i=1; i<=n; i++)
    {
      cin>>value[i]>>w[i]>>cop[i];
    }

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

            for(int k=1; k<=cop[i]; k++)
            {
                if(k*w[i]<=sum)
                    dp[i][sum]=max(dp[i][sum], dp[i-1][sum-w[i]*k]+value[i]*k);
            }
        }
    }

    cout<<dp[n][s];

    return 0;
}

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