Submission #1173340

#TimeUsernameProblemLanguageResultExecution timeMemory
1173340tsengangKnapsack (NOI18_knapsack)C++20
73 / 100
1095 ms428 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
#define ertunt return 0;
int main() {
    ll s, n;
    cin >> s >> n;
    vector<ll> dp(s+1);
    for (ll i = 0; i < n; i++) {
        ll v, w, k;
        cin >> v >> w >> k;
        for (ll j = s; j >= 0; j--) {
            for (ll l = 1; l <= k && j >= l*w; l++) {
                dp[j] = max(dp[j], dp[j-l*w] + l*v);
            }
        }
    }
    cout << dp[s] << '\n';
    ertunt
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...