제출 #1131234

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131234		physictype	Knapsack (NOI18_knapsack)	C++20	37 / 100	247 ms	327680 KiB

knapsack

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

int main() {
    int s,n;
    cin >> s >> n;
    vector<int> weights;
    vector<int> values;
    for (int i = 0; i < n; i++) {
        int vi, wi, ki;
        cin >> vi >> wi >> ki;
        for (int j = 0; j < ki; j++) {
            weights.push_back(wi);
            values.push_back(vi);
        }
    }
    vector<vector<int> > dp(weights.size()+1,vector<int>(s+1,0));
    for (int i = 0; i <= s; i++) {
        dp[0][i]=0;
    }
    for (int i = 1; i <= weights.size(); i++) {
        for (int j = 1; j <= s; j++) {
            dp[i][j]=dp[i-1][j];
            if (j>=weights[weights.size()-i]) {
                dp[i][j]=max(dp[i][j],dp[i-1][j-weights[weights.size()-i]]+values[weights.size()-i]);
            }
        }
    }
    cout << dp[weights.size()][s];
}

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