Submission #1112028

#	Time	Username	Problem	Language	Result	Execution time	Memory
1112028		shfvbhwbrvj	Knapsack (NOI18_knapsack)	C++17	0 / 100	1043 ms	35260 KiB

knapsack

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

int s, n, maxv;
struct item_type {
    int v, w;
};
vector<item_type> item;
vector<int> dp(2001), cnt(2001);
vector<bool> vis(2001);

int main () {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> s >> n;
    for (int i = 1; i <= n; i++) {
        int v, w, k;
        cin >> v >> w >> k;
        item_type temp;
        temp.v = v, temp.w = w;
        for (int j = 1; j <= k; j++) {
            item.push_back(temp);
        }   
    }

    vis[0] = true;
    for (auto i : item) {
        for (int j = s; j >= i.w; j--) {
            if (vis[j - i.w]) {
                dp[j] = max(dp[j], dp[j - i.w] + i.v);
                vis[j] = true;
                maxv = max(maxv, dp[j + i.w]);
            }  
        }
    }

    cout << maxv << endl;

    return 0;
}

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