Submission #1364662

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364662		shreyas_arun	Knapsack (NOI18_knapsack)	C++20	0 / 100	0 ms	344 KiB

knapsack

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

struct hw
{
    ll val, w, k;
};

void solve()
{
    ll s, n;
    cin >> s >> n;
    vector<hw> v(n);
    bool f = true;
    for (auto &i : v)
    {
        cin >> i.val >> i.w >> i.k;
        if (i.k != 1)
        {
            f = false;
        }
    }
    if (n == 1)
    {
        if (s > v[0].w)
        {
            cout << 0 << '\n';
            return;
        }
        ll cal = s / v[0].w;
        if (cal >= v[0].k)
        {
            cout << v[0].val * v[0].k << '\n';
        }
        else if (cal < v[0].k)
        {
            cout << v[0].val * cal << '\n';
        }
    }
    else if (f)
    {
        vector<ll> dp(s + 1, 0);
        for (auto &i : v)
        {
            for (int j = 1; j <= s; j++)
            {
                if (i.w > s)
                {
                    continue;
                }
                else if (j - i.w >= 0)
                {

                    dp[j] = max(dp[j - 1], i.val + dp[j - i.w]);
                }
            }
        }
        cout << dp[s] << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

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