제출 #1020952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020952		urejgi	Knapsack (NOI18_knapsack)	C++17	73 / 100	1065 ms	17436 KiB

knapsack

#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops", "Ofast")
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int s, n; cin >> s >> n;
    vector<int> values, weights;
    for(int i = 0; i < n; ++i){
        int v, w, k; cin >> v >> w >> k;
        int count = 1;
        while(k > 0){
            int curcnt = min(count, k);
            values.push_back(curcnt*v);
            weights.push_back(curcnt*w);
            k -= curcnt;
            count <<= 1;
        }
    }
    int items_cnt = values.size();
    vector<int> dp(s+1, 0);
    for(int i = 0; i < items_cnt; ++i){
        for(int j = s; j >= weights[i]; --j){
            dp[j] = max(dp[j], dp[j - weights[i]] + values[i]);
        }
    }
    cout << dp[s];
    return 0;
}

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