제출 #759819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
759819		sofija6	Knapsack (NOI18_knapsack)	C++14	73 / 100	709 ms	262144 KiB

knapsack

#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
#define MAXS 2010
using namespace std;
priority_queue<pair<ll,ll> > val[MAXS];
set<ll> cnt[MAXN];
ll dp[MAXS],v[MAXN],w[MAXN];
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll s,n,k,ans=0;
    cin >> s >> n;
    for (ll i=1;i<=n;i++)
    {
        cin >> v[i] >> w[i] >> k;
        for (ll j=1;j<=k && j*w[i]<=s;j++)
            val[j*w[i]].push({j*v[i],i});
    }
    for (ll i=1;i<=s;i++)
    {
        ll cur=0;
        while (!val[i].empty())
        {
            cur++;
            auto t=val[i].top();
            val[i].pop();
            if (cur*i<=s)
                cnt[t.second].insert(i/w[t.second]);
        }
    }
    for (ll i=1;i<=n;i++)
    {
        for (ll j=s;j>=0;j--)
        {
           for (ll l : cnt[i])
           {
               if (j+l*w[i]>s)
                   break;
               dp[j+l*w[i]]=max(dp[j+l*w[i]],dp[j]+l*v[i]);
           }
        }
    }
    for (ll i=0;i<=s;i++)
        ans=max(ans,dp[i]);
    cout << ans;
    return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27