제출 #1304109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304109		Zone_zonee	Knapsack (NOI18_knapsack)	C++20	73 / 100	1097 ms	15912 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5+10, S = 2e4+10;

ll dp[S];
pair<ll, ll> a[N*32];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int s, n;
    cin >> s >> n;
    int sz = 0;
    for(int i = 1; i <= n; ++i){
        ll v, w, k;
        cin >> v >> w >> k;
        ll took = 1;
        while(k > 0){
            a[sz++] = {w*min(k, took), v*min(k, took)};
            k -= min(k, took);
            took <<= 1;
        }
    }
    for(int j = 0; j < sz; ++j){
        for(int i = s; i >= a[j].first; --i){
            dp[i] = max(dp[i], dp[i-a[j].first] + a[j].second);
        }
    }
    cout << dp[s] << '\n';
}

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