#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5, MAX_S = 2e3;
int v[MAX_N + 1], wi[MAX_N + 1], k[MAX_N + 1];
int dp[MAX_S + 1];
signed main () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int s, n, i, j, w, new_w, min_k;
cin >> s >> n;
min_k = INT_MAX;
for (i = 1; i <= n; i++) {
cin >> v[i] >> wi[i] >> k[i];
min_k = min(min_k, k[i]);
}
if (min_k > s) {
// unbounded
for (w = 0; w <= s; w++) {
for (i = 1; i <= n; i++) {
new_w = w + wi[i];
if (new_w <= s) {
dp[new_w] = max(dp[new_w], dp[w] + v[i]);
}
}
}
} else {
for (i = 1; i <= n; i++) {
for (j = 1; j <= k[i]; j++) {
for (w = s; w >= 0; w--) {
new_w = w + wi[i];
if (new_w <= s) {
dp[new_w] = max(dp[new_w], dp[w] + v[i]);
}
}
}
}
}
cout << dp[s];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |