# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868566 | Pbezz | Knapsack (NOI18_knapsack) | C++14 | 0 ms | 348 KiB |
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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
const ll MAXN = 1e6+5;
const ll INF = 1e5+5;
const ll MOD = 1e9+7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll s,n;
cin>>s>>n;
ll v,w,k;
ll obj[n+1][3];
for(int i=1;i<=n;i++){
//cin>>v>>w>>k;
scanf("%lld %lld %lld",&v, &w, &k);
obj[i][0]=v;
obj[i][1]=w;
obj[i][2]=k;
}
ll dp[s+1];
for(int j=0;j<=s;j++)dp[j]=0;
for(int i=1;i<=n;i++){
for(int j=s;j>=0;j--){
for(ll freq=1;freq<=obj[i][2];freq++){
if(j-freq*obj[i][1]<0)break;
dp[j] = max(dp[j] , dp[j-freq*obj[i][1]]+freq*obj[i][0]);
}
}
}
printf("%lld",dp[s]);
//cout<<dp[s]<<'\n';
return 0;
}
Compilation message (stderr)
# | 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... |