제출 #491168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491168		tarche	Knapsack (NOI18_knapsack)	C++17	12 / 100	2 ms	1740 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int main() {
    int S, N;
    cin >> S >> N;

    vector<int> value(N), weight(N), amount(N);
    for (int i = 0; i < N; i++)
        cin >> value[i] >> weight[i] >> amount[i];

    vector<vector<pair<int, int>>> dp(N, vector<pair<int, int>>(S + 1));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= S; j++) {
            int k = j + weight[i];
            if (dp[i][j].second < amount[i] && k <= S) {
                if (dp[i][k].first < dp[i][j].first + value[i]) {
                    dp[i][k].first = dp[i][j].first + value[i];
                    dp[i][k].second = dp[i][j].second + 1;
                }
            }

            if (i < N - 1 && dp[i + 1][j].first < dp[i][j].first) {
                dp[i + 1][j].first = dp[i][j].first;
            }
        }
    }

    int ans = 0;
    for (int i = 0; i < N; i++)
        for (int j = 0; j <= S; j++)
            ans = max(ans, dp[i][j].first);

    cout << ans << '\n';
}

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