Submission #1061444

#	Time	Username	Problem	Language	Result	Execution time	Memory
1061444		voi	Knapsack (NOI18_knapsack)	C++17	73 / 100	96 ms	3160 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int n, m, w[105], a[105], v[105], dp[105][10005];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> m >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> v[i] >> w[i] >> a[i];
    }
    for(int i = 1; i <= n; ++i)
    for(int j = 1; j <= m; ++j) {
        dp[i][j] = dp[i - 1][j];
        for(int k = 1, lim = min(a[i], j / w[i]); k <= lim; ++k)
        dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i] * k] + v[i] * k);
    }
    cout << (*max_element(dp[n] + 1, dp[n] + m + 1));
    
    return 0;
}

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