# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438609 | Haidara | Knapsack (NOI18_knapsack) | C++17 | 0 ms | 0 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>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define rep(i,x,n) for(int i=x;i<n;i++)
#define FOR(i,n) rep(i,0,n)
using namespace std;
int s,n,v[100001],w[100001],k[100001],dp[100001][2001];
int solve(int inx=0,int curr=0)
{
if(dp[inx][curr])
return dp[inx][curr];
if(inx==n)
return 0;
FOR(i,k[inx]+1)
{
if(curr+i*w[inx]<=s)
dp[inx][curr]=max(dp[inx][curr],solve(inx+1,curr+i*w[inx])+i*v[inx]);
else
break;
}
return dp[inx][curr];
}
signed main()
{
scanf("%d",&s);
scanf("%d",&n);
FOR(i,n)
{
scanf("%d",&(v+i));
scanf("%d",&(w+i));
scanf("%d",&(k+i));
k[i]=min(k[i],s/w[i]);
}
cout<<solve();
}