제출 #1304975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304975		2120minhdt	Knapsack (NOI18_knapsack)	C++20	73 / 100	1095 ms	584 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int S, N;
    if (!(cin >> S >> N)) return 0;

    vector<ll> dp(S + 1, 0);
    for (int i = 0; i < N; ++i) {
        ll v, w, k;
        cin >> v >> w >> k;

        k = min(k, (ll)S / w);
        for (ll m = 1; k > 0; m <<= 1) {
            ll num = min(m, k); 
            ll total_v = num * v;
            ll total_w = num * w;
            for (int j = S; j >= total_w; --j) {
                dp[j] = max(dp[j], dp[j - (int)total_w] + total_v);
            }
            k -= num;
        }
    }
    ll result = 0;
    for (int j = 0; j <= S; ++j) {
        result = max(result, dp[j]);
    }
    cout << result << endl;
    return 0;
}

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