Submission #964403

#	Time	Username	Problem	Language	Result	Execution time	Memory
964403		KasymK	Knapsack (NOI18_knapsack)	C++17	73 / 100	1048 ms	2756 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

int main() {
    int S, n;
    scanf("%d%d", &S, &n);
    vector<int> v(n), w(n), k(n);
    for (int i = 0; i < n; ++i)
        scanf("%d%d%d", &v[i], &w[i], &k[i]);
    vector<long long> dp(S + 1);
    for (int i = 0; i < n; ++i)
        for (int j = S; j >= w[i]; --j){
            int mn = min(j / w[i], k[i]);
            for (int cnt = 1; cnt <= mn; cnt++)
                dp[j] = max(dp[j], dp[j - cnt * w[i]] + cnt * v[i]);
        }
    long long ans = *max_element(dp.begin(), dp.end());
    printf("%lld\n", ans);
    return 0;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:6:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |     scanf("%d%d", &S, &n);
      |     ~~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:9:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |         scanf("%d%d%d", &v[i], &w[i], &k[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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