Submission #1279944

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279944		tawwie	Knapsack (NOI18_knapsack)	C++20	12 / 100	3 ms	1860 KiB

knapsack

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

int main(){
    cin.tie(NULL)->ios_base::sync_with_stdio(false);
    int s, n; cin >> s >> n;
    vector<vector<ll>> dp(n+1, vector<ll>(s+1, 0LL));
    for(int i=1; i<=n; i++){
        ll v, w, k; cin >> v >> w >> k;
        // value, weight, copies
        for(int j=s; j>=w; j--){
            for(int d=w; d<=min(ll(j), k*w); d+=w){
                // d is cost of some k_i copies of an item
                dp[i][j] = max(max(dp[i][j], dp[i-1][j]), dp[i-1][j-d] + v * d / w);
            }
        }
    }
    //for(auto i : dp){for(auto j : i) cout << j << ' '; cout << '\n';}
    cout << dp[n][s];
    return 0;
}
/*
15 3
1000000000 5 1000000000
100 3 100
1 5 2
*/

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