Submission #1369071

#TimeUsernameProblemLanguageResultExecution timeMemory
1369071Ekber_EkberKnapsack (NOI18_knapsack)C++20
73 / 100
1095 ms1608 KiB
#include <bits/stdc++.h>
// #ifndef ONLINE_JUDGE
//     #include <debug.h>
// #else
//     #define debug(...)
// #endif
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// #define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;

constexpr int MAX = 2e+5 + 1, INF = 2e+9, MOD = 1e+9 + 7, K = 31;

void _() {
    int s, n;
    cin >> s >> n;
    vector <array <int, 3>> v(n);
    for (auto &i : v) cin >> i[0] >> i[1] >> i[2];
    vector <int> dp(s+1, -INF);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        vector <int> ndp = dp;
        for (int j = 0; j <= s; j++) {
            for (int z = 0; z <= v[i][2]; z++) {
                if (j + z * v[i][1] > s) break;
                ndp[j + z * v[i][1]] = max(ndp[j + z * v[i][1]], dp[j] + z * v[i][0]);
            }
        }
        dp.swap(ndp);
    }
    cout << *max_element(all(dp));
}

signed main() {

    GOOD_LUCK

    int tests=1;
    // cin >> tests;
    for (int i=1; i <= tests; i++) {
        _();
        cout << endl;
    }

    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...