Submission #1185416

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185416		GoBananas69	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	16248 KiB

knapsack

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

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

    for (int i = 0; i < n; ++i) {
        int price, weight, count;
        cin >> price >> weight >> count;
        int y = s / weight;
        count = min(y, count);
        int k = 1;
        while (k <= count) {
            w.push_back(weight * k);
            v.push_back(price * k);
            count -= k;
            k *= 2;
        }
        if (count > 0) {
            w.push_back(weight * count);
            v.push_back(price * count);
        }
    }
    n = v.size() - 1;
    if (n == 0) {
        cout << 0 << '\n';
        return 0;
    }
    vector<vector<ll>> dp(2, vector<ll>(s + 1, 0));
    for (int i = 1; i <= n; ++i) {
        for (int 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: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27