제출 #1170227

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170227		nguyenkhangninh99	Knapsack (NOI18_knapsack)	C++20	100 / 100	35 ms	10828 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int maxn = 2e3 + 7;

int f[maxn][maxn], dp[maxn];
vector<pair<int, int>> item[maxn];

void solve(){
    int s, n; cin >> s >> n;
    for(int i = 1; i <= n; i++){
        int v, w, k; cin >> v >> w >> k;
        item[w].push_back({v, k});
    }
    
    for(int i = 1; i <= s; i++){
        sort(item[i].begin(), item[i].end(), greater<>());

        int totw = 0, j = 0, sz = item[i].size();
        while(totw <= s && j < sz){
            auto [v, k] = item[i][j];
            j++;
            while(totw <= s && k > 0){
                totw += i;
                k--;
                f[i][totw / i] = f[i][(totw / i) - 1] + v;
            }
        }
    }
    for(int w = 1; w <= 2000; w++){
        for(int i = s; i >= 1; i--){
            for(int j = 1; i >= w * j; j++) dp[i] = max(dp[i - w * j] + f[w][j], dp[i]);
        }
   }

    cout << *max_element(dp, dp+s+1);
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    solve();
}

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