# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524054 | shubham20_03 | Knapsack (NOI18_knapsack) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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, inf = 1e16;
const int D = 1e7;
int dp[D + 1][2001];
int knapsack(vector<pii>& a, int n, int S) {
if (S == 0 or n == 0) return 0;
if (dp[n][S] != -1)
return dp[n][S];
int ans = knapsack(a, n - 1, S);
if (a[n - 1].f <= S)
ans = max(ans, knapsack(a, n - 1, S - a[n - 1].f) + a[n - 1].s);
return dp[n][S] = ans;
}
signed main() {
fastio
// freopen("../input1.txt", "r", stdin);
// freopen("../output1.txt", "w", stdout);
memset(dp, -1, sizeof(dp));
int S, n; cin >> S >> n;
vector<pii> a;
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);
cout << knapsack(a, n, S) << '\n';
return 0;
}