Submission #1355547

#	Time	Username	Problem	Language	Result	Execution time	Memory
1355547		h.oussama	Knapsack (NOI18_knapsack)	C++20	37 / 100	1094 ms	344 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const int mod = 1e9 + 7; // 998244353

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int S, N;
    cin >> S >> N;
    vector<int> V(N), W(N), K(N);
    for (int i = 0; i < N; i++)
    {
        cin >> V[i] >> W[i] >> K[i];
    }
    vector<int> dp(S + 1);
    dp[0] = 0;
    for (int i = 0; i < N; i++)
    {
        for (int k = 0; k < K[i]; k++)
        {
            for (int j = S; j >= W[i]; j--)
            {
                dp[j] = max(dp[j], dp[j - W[i]] + V[i]);
            }
        }
    }
    cout << dp[S] << endl;

    return 0;
}

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