Submission #674636

#	Time	Username	Problem	Language	Result	Execution time	Memory
674636		Zura	Knapsack (NOI18_knapsack)	C++14	12 / 100	1 ms	296 KiB

knapsack

#include <bits/stdc++.h>
#define int long long int
#define mod 1000000007
using namespace std;
signed main()
{
    // ios_base::sync_with_stdio(NULL);
    // cin.tie(NULL);
    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);
    int s, n;
    cin >> s >> n;
    int v[n], w[n], k[n];
    for (int i = 0; i < n; i++)
    {
        cin >> v[i] >> w[i] >> k[i];
    }
    vector<pair<int, int>> dp(s + 1, {0, 0});
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= s; j++)
            dp[j].second = 0;
        for (int j = w[i]; j <= s; j++)
        {
            if (dp[j - w[i]].second < k[i] && (v[i] + dp[j - w[i]].first) > dp[j].first)
                dp[j] = {v[i] + dp[j - w[i]].first, dp[j - w[i]].second + 1};
        }
    }
    cout << (*max_element(dp.begin(), dp.end())).first << "\n";
}

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