제출 #1023586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1023586		vjudge1	Knapsack (NOI18_knapsack)	C++17	0 / 100	1 ms	348 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
int main() {
    int N, S;
    cin >> N >> S;
    vector<int> dp(S + 1, 0);
    for (int i = 0; i < N; ++i) {
        int V, W, K;
        cin >> V >> W >> K;
        for (int j = 1; K > 0; j <<= 1) {
            int qty = min(j, K);
            K -= qty;
            int weight = W * qty;
            int value = V * qty;
            for (int w = S; w >= weight; --w) {
                dp[w] = max(dp[w], dp[w - weight] + value);
            }
        }
    }
    int max_value = *max_element(dp.begin(), dp.end());
    cout << max_value << endl;
    return 0;
}

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