Submission #1240461

#	Time	Username	Problem	Language	Result	Execution time	Memory
1240461		ayan	Knapsack (NOI18_knapsack)	C++20	37 / 100	1095 ms	1096 KiB

knapsack

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

const int MOD = 1e9 + 7;

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

    int s, n;
    cin >> s >> n;

    vector<int> v(n), w(n), c(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i] >> w[i] >> c[i];
    }

    vector<vector<int>> dp(n + 1, vector<int>(s + 1, 0));
    dp[0][0] = 0;

    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j <= s; j++)
        {
            for (int cnt = 0; cnt <= c[i - 1]; cnt++)
            {
                if (j - (cnt * w[i - 1]) >= 0)

                    dp[i][j] = max(dp[i][j], (cnt * v[i - 1]) + dp[i - 1][j - (cnt * w[i - 1])]);
            }
        }
    }

    cout << dp[n][s] << endl;

    return 0;
}

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