| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 447957 | kakayoshi | Knapsack (NOI18_knapsack) | C++14 | 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>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> data;
typedef pair<ll, pair<ll,ll> > super;
typedef vector <ll> vii;
#define forw(i,a,b) for (ll i=a;i<=b;i++)
#define forb(i,a,b) for (ll i=a;i>=b;i--)
#define fast {ios::sync_with_stdio(false); cin.tie(0); }
#define fi first
#define se second
#define pu push
#define puf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fr front
#define all(a) a.begin(),a.end()
const ll oo=1e18;
const ll mod=1e9+7;
const ll maxN=3e5+5;
const int tx[4]={0,0,1,-1};
const int ty[4]={1,-1,0,1};
const ll base=31;
int dp[2005],n,S,v,w,k;
vector <int > save[2005];
vector <int> pre[2005];
void solve()
{
cin>>S>>n;
forw(i,1,n)
{
cin>>v>>w>>k;
forw(j,1,min(S/w,k))
save[w].pb(v);
}
forw(i,1,S)
if (save[i].size())
{
sort(all(save[i]),greater<ll>());
ll length=save[i].size()-1;
pre[i].pb(0);
forw(j,0,min(length,S/i))
{
//cout<<save[i][j]<<" ";
pre[i].pb(pre[i][j]+save[i][j]);
}
//cout<<endl;
}
forw(i,1,S)
if (save[i].size())
{
forb(w,S,1)
forw(k,0,save[i].size()-1)
{
if (w-i*(k+1)<0) break;
dp[w]=max(dp[w],dp[w-i*(k+1)]+pre[i][k+1]);
}
}
ll ans=0;
forw(i,1,S)
ans=max(ans,dp[i]);
cout<<ans;
}
int main()
{
fast;
//freopen("test.inp","r",stdin);
//freopen("test.out","w",stdout);
int t=1; //cin>>t;
while (t--)
solve();
return 0;
}