Submission #1286266

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286266		Soju	Knapsack (NOI18_knapsack)	C++20	37 / 100	1029 ms	584 KiB

knapsack

#pragma GCC optimize("O3,inline,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).begin(), (v).end()
#define debug cerr << "[DEBUG] "

const char wp = ' ';
const char nl = '\n';

void kebin() {
    int s, n;
    cin >> s >> n;

    vector<tuple<int, int, int>> arr(n);
    for (auto &[a, b, c] : arr) {
        cin >> a >> b >> c;
        // {value, weight, number (or copies)}
    }

    vector<ll> dp(s+1);
    for (auto [val, wei, cnt] : arr) {
        for (int i = 1; i <= cnt; i++) {
            for (int w = s; w >= wei; w--) {
                dp[w] = max(dp[w], dp[w-wei] + val);
            }
        }
    }

    cout << *max_element(all(dp)) << nl;
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);

    int t = 1;
    // cin >> t;
    while (t--) kebin();
}

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