#include <bits/stdc++.h>
using namespace std;
int main() {
int S, N;
cin >> S >> N;
vector<int> value(N), weight(N), amount(N);
for (int i = 0; i < N; i++)
cin >> value[i] >> weight[i] >> amount[i];
vector<vector<pair<int, int>>> dp(N, vector<pair<int, int>>(S + 1));
for (int i = 0; i < N; i++) {
for (int j = 0; j <= S; j++) {
int k = j + weight[i];
if (dp[i][j].second < amount[i] && k <= S) {
if (dp[i][k].first < dp[i][j].first + value[i]) {
dp[i][k].first = dp[i][j].first + value[i];
dp[i][k].second = dp[i][j].second + 1;
}
}
if (i < N - 1 && dp[i + 1][j].first < dp[i][j].first) {
dp[i + 1][j].first = dp[i][j].first;
}
}
}
int ans = 0;
for (int i = 0; i < N; i++)
for (int j = 0; j <= S; j++)
ans = max(ans, dp[i][j].first);
cout << ans << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
2 ms |
1740 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
2 ms |
1740 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Incorrect |
2 ms |
1740 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Incorrect |
2 ms |
1740 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |