제출 #1256376

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1256376		devikareddi	Knapsack (NOI18_knapsack)	C++20	37 / 100	1093 ms	328 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll weight_limit,n;
    cin >> weight_limit >> n;
    vector<tuple<ll,ll,ll>> item(n);
    for(auto &[a,b,c]: item) cin>> a >> b >> c;
    vector<ll>dp(weight_limit+1,0);
    for(ll i=0;i<n;i++){
        ll weight=get<1>(item[i]),value=get<0>(item[i]);
        for(ll j=weight_limit;j>0;j--){
            ll count=get<2>(item[i]);
            while(count>0){
                if(weight*count<=j){
                    dp[j] = max(dp[j-(weight*count)]+(count*value),dp[j]);
                    dp[j] = max(dp[j],dp[j-1]);
                }
                count--;
            }
        }
    }
    cout << dp[weight_limit]<<endl;
    return 0;
}

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