제출 #1216554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216554		dragon28102008	Knapsack (NOI18_knapsack)	C++17	12 / 100	0 ms	332 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define AC ios_base::sync_with_stdio(false);cin.tie(nullptr); cout.tie(nullptr);

const ll mod = 998244353;

ll s , n;
vector<ll> v , w , k;

ll sub1()
{
    ll res = min(k[0] ,(s/w[0] ) ) * v[0];
    return res;
}

ll sub23()
{
    vector<pair<ll,ll>> a;
    for(ll i = 0 ; i<n ; i++)
    {
        for(ll j = 0 ; j<k[i] ; j++)
        {
            a.push_back({v[i] , k[i]});
        }
    }
    vector<ll> dp(s+1 , 0);
    for(pair<ll,ll> p: a)
    {
        for(ll i = s ; i>=p.second ; i--)
        {
            dp[i] = dp[i-1];
            dp[i] = max(dp[i] , dp[i-p.second] + p.first);
        }
    }
    return dp[s];
}

int main()
{
    AC
    cin>>s>>n;
    v.resize(n);
    w.resize(n);
    k.resize(n);
    for(ll i = 0 ; i<n ; i++)
    {
        cin>>v[i]>>w[i]>>k[i];
    }
    if(n == 1) cout<<sub1();
    else cout<<sub23();
    return 0;
}

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