제출 #1294427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1294427		linuss	Knapsack (NOI18_knapsack)	C++20	73 / 100	1096 ms	588 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> res(32);
void solve(ll x){
    res.clear();
    for (ll p = 1; p <= x; p <<= 1){
        res.push_back(p);
        x -= p;
    }
    if (x > 0) res.push_back(x);
}

int main(){
    iostream::sync_with_stdio(false);
    cin.tie(nullptr);
    int s, n;
    cin >> s >> n;
    vector<ll> dp(s+1, 0);
    for (int i = 0; i<n; i++){

        int a, b, c;
        
        cin >> a >> b >> c;
        if (b>s){continue;}
        solve(c);
        for (ll x : res){
            ll n1 = b*x;
            ll a1 = a*x;
            if (n1 > s) continue;  // skip impossible chunk
            for (int j = s; j >= n1; --j) {
                dp[j] = max(dp[j], dp[j - n1] + a1);
            }
            
        }
    }
    // for (auto i : dp){
    //     cout << i << " ";
    // }
    // cout << "\n";
    ll m = 0;
    for (auto i : dp){
        m = max(m, i);
    }
    cout << m;


    return 0;
}

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