#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
int v[2001], w[2001], k[2001];
for (int i = 1; i <= n; i++) {
cin >> v[i] >> w[i] >> k[i];
}
int dp[2001];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
for (int x = s; x >= 0; x--) {
for (int j = 0; j <= k[i]; j++) {
if (x >= j * w[i]) {
dp[x] = max(dp[x], dp[x - (j * w[i])] + (j * v[i]));
}
}
}
}
cout << dp[s] << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1081 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Incorrect |
2 ms |
204 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 |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1081 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1081 ms |
204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |