제출 #723877

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
723877		ivaziva	Knapsack (NOI18_knapsack)	C++14	73 / 100	153 ms	262144 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define MAXN 100010
#define MAXM 2010

long long n;
long long s;
long long v[MAXN];
long long w[MAXN];
long long k[MAXN];
long long dp[MAXN][MAXM];

int main()
{
    ios_base::sync_with_stdio(false);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>s>>n;
    for (long long i=1;i<=n;i++) cin>>v[i]>>w[i]>>k[i];
    for (long long i=1;i<=n;i++)
    {
        for (long long ii=1;ii<=s;ii++)
        {
            dp[i][ii]=dp[i-1][ii];
            for (long long iii=1;iii<=k[i];iii++)
            {
                if (ii>=iii*w[i]) dp[i][ii]=max(dp[i][ii],dp[i-1][ii-iii*w[i]]+iii*v[i]);
                else break;
            }
        }
    }
    long long maks=0;
    for (long long i=1;i<=s;i++) maks=max(maks,dp[n][i]);
    cout<<maks<<endl;
}

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