제출 #1259854

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1259854		tareq	Knapsack (NOI18_knapsack)	C++20	73 / 100	1093 ms	8624 KiB

knapsack

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

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

    int S, N;
    cin >> S >> N;

    vector<pair<int,int>> items; 
    for (int i = 0; i < N; i++) {
        long long V, W, K;
        cin >> V >> W >> K;

        long long maxCopies = min(K, (long long)S / W);

        long long power = 1;
        while (maxCopies > 0) {
            long long take = min(power, maxCopies);
            items.push_back({(int)(W * take), (int)(V * take)});
            maxCopies -= take;
            power <<= 1;
        }
    }

    vector<int> dp(S+1, 0);

    for (auto [w, v] : items) {
        for (int cap = S; cap >= w; cap--) {
            dp[cap] = max(dp[cap], dp[cap - w] + v);
        }
    }

    cout << dp[S] << "\n";
    return 0;
}

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