Submission #1023737

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

knapsack

#include <iostream>
#include <vector>
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<int> dp(S + 1, 0);
    for (int i = 0; i < N; ++i) {
        for (int k = 1; K[i] > 0; k <<= 1) {
            int count = min(k, K[i]); 
            K[i] -= count;  
            for (int s = S; s >= W[i] * count; --s) {
                dp[s] = max(dp[s], dp[s - W[i] * count] + V[i] * 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