Submission #1339084

#TimeUsernameProblemLanguageResultExecution timeMemory
1339084Rokas159Knapsack (NOI18_knapsack)C++20
37 / 100
195 ms327680 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'

signed main() {
    cin.tie(nullptr); cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    int s, n;
    cin >> s >> n;

    // int v[n], w[n], k[n];
    vector<int> v, w;

    for (int i = 0; i < n; i++) {
        int V, W, K;
        cin >> V >> W >> K;
        for (int j = 0; j < K; j++) {
            v.push_back(V);
            w.push_back(W);
        }
        // cin >> v[i] >> w[i] >> k[i];
    }

    n = v.size();

    int dp[n+1][s+1];
    for (int i = 1; i <= s; i++) {
        dp[0][i] = 0;
    }
    for (int i = 0; i <= n; i++) {
        dp[i][0] = 0;
    }

    int ans = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= s; j++) {
            dp[i][j] = dp[i-1][j];
            int imti = min(j/w[i-1], (int)1);
            // imti = min(imti, (int)1);
            dp[i][j] = max(dp[i][j], dp[i-1][j-(imti*w[i-1])]+(imti*v[i-1]));

            ans = max(dp[i][j], ans);
        }
    }

    cout << ans << endl;

    cout.flush();
    return 0;
}
#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...