Submission #1023790

#	Time	Username	Problem	Language	Result	Execution time	Memory
1023790		vjudge1	Knapsack (NOI18_knapsack)	C++17	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> V(N), W(N), K(N);
    for (int i = 0; i < N; ++i) {
        cin >> V[i] >> W[i] >> K[i];
    }
    vector<long long> dp(S + 1, 0); 
    for (int i = 0; i < N; ++i) {
        int value = V[i];
        int weight = W[i];
        int count = K[i];
        for (int k = 1; k <= count; k <<= 1) {
            for (int w = S; w >= weight * k; --w) {
                dp[w] = max(dp[w], dp[w - weight * k] + value * k);
            }
            count -= k; 
        }
        if (count > 0) {
            for (int w = S; w >= weight * count; --w) {
                dp[w] = max(dp[w], dp[w - weight * count] + value * count);
            }
        }
    }
    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