Submission #1178567

#TimeUsernameProblemLanguageResultExecution timeMemory
1178567HezovKnapsack (NOI18_knapsack)C++20
73 / 100
274 ms327680 KiB
#include <iostream> using namespace std; const int mxN = 1e5; int dp[mxN+1][2001], v[mxN+1], w[mxN+1], k[mxN+1]; int main() { int S, N; cin >> S >> N; for(int i = 1;i<=N;i++) cin >> v[i] >> w[i] >> k[i]; for(int i = 0;i<=N;i++) { for(int j = 0;j<=S;j++) { if(i == 0 || j == 0) dp[i][j] = 0; else { dp[i][j] = dp[i-1][j]; for(int nr = 1; nr * w[i] <= j && nr <= k[i];nr++) { dp[i][j] = max(dp[i][j], dp[i - 1][j - nr * w[i]] + v[i] * nr); } } } } cout << dp[N][S]; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...