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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, w, a, b, c;
cin>>w>>n;
vector<vector<long long int>>dp(n+1, vector<long long int>(w+1));
for (int i=1; i<=n; i++){
dp[i]=dp[i-1];
cin>>a>>b>>c;
for (int j=0; j<=w; j++){
for (int k=1; k<=c; k++){
if (b*k<=j) dp[i][j]=max(dp[i][j], dp[i-1][j-b*k]+a*k);
else break;
}
}
}cout<<dp[n][w];
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... |