Submission #930263

#	Time	Username	Problem	Language	Result	Execution time	Memory
930263		naghs	Knapsack (NOI18_knapsack)	C++17	73 / 100	1094 ms	2908 KiB

knapsack

#include <iostream>
#include <vector>

using namespace std;

int main() {
    int s, n;
    cin >> s >> n;
    
    vector<int> v(n),
                w(n),
                q(n);
    
    for(int i = 0; i < n; i++)
        cin >> v[i]
            >> w[i]
            >> q[i];
    
    vector<int> dp(s + 1, 0);
    
    for(int i = 0; i < n; i++)
        for(int j = s; j >= w[i]; j--)
            for(int k = 0; k <= min(j / w[i], q[i]); k++)
                dp[j] = max(dp[j], dp[j - k * w[i]] + k * v[i]);
    
    cout << dp[s];
    return 0;
}

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