Submission #808812

#TimeUsernameProblemLanguageResultExecution timeMemory
808812GoldLightKnapsack (NOI18_knapsack)C++17
29 / 100
2 ms340 KiB
#include <bits/stdc++.h> using namespace std; void fast(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);} const int N=2e3; long long dp[N+1]; int main(){ fast(); int s, n, v, w, k; cin>>s>>n; for(int i=1; i<=n; i++){ cin>>v>>w>>k; for(int j=s; j>=1; j--){ int ki=1, ka=k, ans=0; while(ki<=ka){ int mid=(ki+ka)/2; if(1ll*w*mid<=1ll*j){ ans=mid; ki=mid+1; } else ka=mid-1; } dp[j]=max(dp[j], dp[j-w*ans]+v*ans); } } cout<<dp[s]; }
#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...