제출 #1185413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1185413		GoBananas69	Knapsack (NOI18_knapsack)	C++20	17 / 100	1 ms	328 KiB

knapsack

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll s, n;
    cin >> s >> n;
    if (s < 0 || n <= 0) {
        cout << 0 << '\n';
        return 0;
    }
    vector<ll> v(1, 0), w(1, 0);

    for (ll i = 0; i < n; ++i) {
        ll price, weight, count;
        //v, w, k
        cin >> price >> weight >> count;
        // count = min(s, count);
        ll k = 1;
        for (ll k = 1; k * weight <= s && k <= count; k *= 2) {
            w.push_back(k * weight);
            v.push_back(k * price);
        }
    }
    n = v.size() - 1;
    if (n == 0) {
        cout << 0 << '\n';
        return 0;
    }
    vector<vector<ll>> dp(2, vector<ll>(s + 1, 0));
    for (ll i = 1; i <= n; ++i) {
        for (ll j = 0; j <= s; ++j) {
            if (w[i] > j) {
                dp[1][j] = dp[0][j];
            } else {
                dp[1][j] = max(dp[0][j], v[i] + dp[0][j - w[i]]);
            }
        }
        swap(dp[1], dp[0]);
    }
    cout << dp[0][s] << '\n';
}

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