Submission #1023618

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023618		vjudge1	Knapsack (NOI18_knapsack)	C++98	0 / 100	1 ms	348 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>
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 count = min(j, K);
            K -= count;
            int weight = W * count;
            int value = V * count;
            for (int w = S; w >= weight; --w) {
                dp[w] = max(dp[w], dp[w - weight] + value);
            }
        }
    }
    cout << dp[S] << endl;
    return 0;
}

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