Submission #1154685

#TimeUsernameProblemLanguageResultExecution timeMemory
1154685vicvicKnapsack (NOI18_knapsack)C++20
17 / 100
1 ms328 KiB
#include <iostream> #include <fstream> #include <vector> #include <algorithm> using namespace std; const int NMAX=1e5, WMAX=2e3, KMAX=1e9; int n, gmax, dp[100005]; int main () { ios :: sync_with_stdio (0); cin.tie (nullptr); cin >> gmax >> n; int t=0; for (int i=1;i<=n;i++) { int v, w, k; cin >> v >> w >> k; int pw=1, cnt=1; while (pw<=k) { for (int i=gmax;i>=w*pw;i--) { dp[i]=max (dp[i], dp[i-w*pw]+v*pw); } pw*=2; cnt++; } } cout << dp[gmax]; 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...