제출 #1185944

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185944		trunz111	Knapsack (NOI18_knapsack)	C++20	73 / 100	1097 ms	16796 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
#define int long long
int s, n;
vector<pair<int,int>> a;

void Solve()
{
    vector<int> dp(s+5, 0);
    for (int i = 0; i < a.size(); i++)
    {
        for (int m = s; m >= a[i].first; m--)
        {
            dp[m] = max(dp[m], dp[m-a[i].first] + a[i].second);
            //cout << dp[i] << " ";
        }
        //cout << "\n";
    }
    cout << dp[s];
}

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

    cin >> s >> n;
    for (int i = 1; i <= n; i++)
    {
        int v, w, k; cin >> v >> w >> k;

        int cnt = 1;
        while (k >= cnt)
        {
            a.push_back({cnt*w, cnt*v});
            k -= cnt;
            cnt *= 2;
        }

        if (k > 0) a.push_back({k*w, k*v});
    }
    //for (pair<int,int> cur : a) cout << cur.first << ", " << cur.second << "\n";
    Solve();
    return 0;
}

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