Submission #1261634

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261634		kaloyan	Knapsack (NOI18_knapsack)	C++20	37 / 100	1 ms	328 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int S, N;
vector<pair<int, int>> items;

void solve()
{
    cin >> S >> N;

    int price, award, cnt;

    vector<int> dp(S + 1, 0);

    for(int i = 0 ; i < N ; ++i)
    {
        cin >> award >> price >> cnt;

        int p = 1;

        while(p <= cnt)
        {
            cnt -= p;

            for(int j = S ; j >= price * p ; --j)
            {
                dp[j] = max(dp[j], dp[j - price * p] + award * p);
            }

            p *= 2;
        }

        if(cnt)
        {
            for(int j = S ; j >= price * cnt ; --j)
            {
                dp[j] = max(dp[j], dp[j - price * cnt] + award * cnt);
            }
        }

        
    }


    cout << dp[S] << "\n";
}

void fastIO()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

int main()
{
    fastIO();
    solve();
}

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