Submission #501819

#	Time	Username	Problem	Language	Result	Execution time	Memory
501819		alexdd	Knapsack (NOI18_knapsack)	C++17	0 / 100	1 ms	304 KiB

knapsack

#include<iostream>
using namespace std;
int dp[2001],dp2[2001];
int main()
{
    int s,n,v,w,k;
    cin>>s>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>v>>w>>k;
        for(int j=1;j<=s;j++)
        {
            for(int m=1;m<=k;m++)
            {
                if(j+m*w>s)
                    break;
                dp2[j+m*w]=max(dp2[j+m*w], dp[j]+m*v);
            }
        }
        for(int j=1;j<=s;j++)
        {
            dp[j]=dp2[j];
        }
    }
    int maxim=-1;
    for(int i=1;i<=s;i++)
    {
        if(dp[i]>maxim)
            maxim=dp[i];
    }
    cout<<maxim;
}

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