Submission #1178535

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178535		Hezov	Knapsack (NOI18_knapsack)	C++20	29 / 100	2 ms	1100 KiB

knapsack

#include <iostream>
using namespace std;
int dp[100001][2001], v[2001], w[2001], k[2001];
int main()
{
    int S, N;
    cin >> S >> N;
    for(int i = 1;i<=N;i++)
        cin >> v[i] >> w[i] >> k[i];
    for(int i = 0;i<=N;i++)
    {
        for(int j = 0;j<=S;j++)
        {
            if(i == 0 || j == 0) dp[i][j] = 0;
            else
            {
                dp[i][j] = dp[i-1][j];
                int nr = min(k[i], j / w[i]);
                int st = 0, dr = nr, mid;
                while(st<=dr)
                {
                    mid = (st + dr) / 2;
                    int val = dp[i-1][j - w[i] * mid] + v[i] * mid;
                    if(val >= dp[i][j])
                        dp[i][j] = val, st = mid+1;
                    else dr = mid-1;
                }
            }
        }
    }
    cout << dp[N][S];
    return 0;
}

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