제출 #759823

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

knapsack

#include <bits/stdc++.h>
#define ll long long
#define MAXN 100010
#define MAXS 2010
using namespace std;
vector<ll> cnt[MAXN];
ll dp[MAXS],v[MAXN],w[MAXN],k[MAXN];
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll s,n,ans=0;
    cin >> s >> n;
    for (ll i=1;i<=n;i++)
        cin >> v[i] >> w[i] >> k[i];
    for (ll i=1;i<=s;i++)
    {
        priority_queue<pair<ll,ll> > q;
        for (ll j=1;j<=n;j++)
        {
            if (i%w[j]!=0 || i/w[j]>k[j])
                continue;
            q.push({(i/w[j])*v[j],j});
        }
        ll cur=0;
        while (!q.empty())
        {
            cur++;
            if (cur*i>s)
                break;
            auto t=q.top();
            q.pop();
            cnt[t.second].push_back(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