Submission #524063

#	Time	Username	Problem	Language	Result	Execution time	Memory
524063		shubham20_03	Knapsack (NOI18_knapsack)	C++17	73 / 100	332 ms	262148 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define deb(x) cout<<#x<<'='<<x<<'\n';
#define deb2(x,y) cout<<#x<<'='<<x<<", "<<#y<<'='<<y<<'\n';
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
const long double PI = acos(-1);
const int mod = 1e9 + 7;

vector<pii> a;

signed main() {
    fastio

    // freopen("../input1.txt", "r", stdin);
    // freopen("../output1.txt", "w", stdout);

    int S, n; cin >> S >> n;
    for (int i = 0; i < n; i++) {
        int v, w, k; cin >> v >> w >> k;
        int cur = 0;
        while (cur + w <= S and k > 0) {
            a.pb({w, v});
            k--, cur += w;
        }
    }

    n = sz(a);

    int dp[S + 1] = {0};

    for (int i = 1; i <= n; i++)
        for (int j = S; j >= a[i - 1].f; j--)
            dp[j] = max(dp[j], a[i - 1].s + dp[j - a[i - 1].f]);

    cout << dp[S] << '\n';

    return 0;
}

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