제출 #1236545

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1236545		PokemonMaster	Knapsack (NOI18_knapsack)	C++20	100 / 100	77 ms	5448 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define int long long   
const int N=2e4+1;
vector <pair <int,int> > vec[2001];
signed main()
{
    int s,n;
    cin>>s>>n;
    vector <int> v(n+1);
    vector <int> w(n+1);
    vector <int> k(n+1);
    vector <int> c;
    vector <int> h;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i]>>w[i]>>k[i];
        vec[w[i]].push_back({v[i],k[i]});
    }
    for(int i=1;i<=s;i++)
    {
        sort(vec[i].rbegin(),vec[i].rend());
        int cnt=s/i;
        for(auto [vi,ka] : vec[i])
        {
            for(int j=0;j<min(ka,cnt);j++)
            {
                c.push_back(vi);
                h.push_back(i);
            }
            cnt-=ka;
        }
    }
    vector <int> dp(s+1);
    for(int i=0;i<h.size();i++)
    {
        for(int j=s;j>=h[i];j--)
        {
            dp[j]=max(dp[j],dp[j-h[i]]+c[i]);
        }
    }
    cout<<dp[s];
}

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