제출 #756362

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
756362		asdasdqwer	Knapsack (NOI18_knapsack)	C++17	73 / 100	262 ms	262144 KiB

knapsack

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

int main() {
    int s, n;

    cin >> s >> n;
    vector<int64_t> dp(s+1, 0);
    vector<pair<int64_t, int64_t>> items;

    if (n == 1) {
        int64_t v, w, k;
        cin >> v >> w >> k;

        int times = min(s / w, k);
        cout << v * times << "\n";
        return 0;
    }

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

        k = min((s / w) + 1, k);
        for (int j = 0; j < k; j++) {
            items.push_back(make_pair(w, v));
        }
    }

    int size = items.size();
    for (int i = 0; i < size; i++) {
        for (int j = s; j > 0; j--) {
            if ((j - items[i].first > -1)) {
                dp[j] = max(dp[j - items[i].first] + items[i].second, dp[j]);
            }
        }
    }

    cout << dp[s] << "\n";
}

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