Submission #914408

#	Time	Username	Problem	Language	Result	Execution time	Memory
914408		Em1L	Knapsack (NOI18_knapsack)	C++17	17 / 100	1 ms	604 KiB

knapsack

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

using ll = long long;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;

int main() {
    ios::sync_with_stdio(0); cin.tie(0);

    int n, s; cin >> s >> n;

    vector < pii > val;

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

        for (int p = 0; p <= 30; p++)
            if ((1 << p) <= k) {
                val.push_back({ v * (1 << p), w * (1 << p) });

                k -= 1 << p;
            }
    }

    vector < int > dp(s + 1, -1);

    dp[0] = 0;

    for (auto [v, w] : val) {
        if (w > s)
            continue;

        for (int cur = s; cur >= w; cur--)
            if (dp[cur - w] >= 0)
                dp[cur] = max(dp[cur], dp[cur - w] + v);
    }

    cout << *max_element(dp.begin(), dp.end()) << "\n";
}

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