제출 #1289617

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289617		amirallisson	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	2788 KiB

knapsack

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

const uint64_t len = 3000;
uint64_t dp[len] = {0};

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

    int n, s;
    cin >> s >> n;

    vector<uint64_t> price(n), weight(n), count(n);
    for (int i = 0; i < n; ++i) {
        cin >> price[i] >> weight[i] >> count[i];
    }

    uint64_t ans = 0;
    for (int idx = 0; idx < n; ++idx) {
        for (int cnt = 1; cnt <= min(count[idx], s / weight[idx]); ++cnt) {
            for (int total_w = s; total_w >= weight[idx]; --total_w) {
                dp[total_w] = max(dp[total_w], dp[total_w - weight[idx]] + price[idx]);
                ans = max(ans, dp[total_w]);
            }
        }
    }

    cout << ans;
}

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