Submission #720442

#	Time	Username	Problem	Language	Result	Execution time	Memory
720442		mseebacher	Knapsack (NOI18_knapsack)	C++17	73 / 100	685 ms	262144 KiB

knapsack

#include <bits/stdc++.h> 
 
using namespace std;
typedef long long ll;
 
struct Produkt{
	ll v,w,k;
};
 
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    cout << fixed << setprecision(8);
 
    int s,n; cin >> s >> n;
	vector<Produkt> p;
	for(int i = 0;i<n;i++){
		Produkt pt;
		cin >> pt.v >> pt.w >> pt.k;
		ll passen = s/pt.w;
		for(int j = 0;j<min(passen,pt.k);j++){
			p.push_back(pt);
		}
	}
	vector<ll> dp(s+1,0);
	ll ans = 0;
	for(int i = 0;i<(int)p.size();i++){
		for(int j = p[i].w;j<=s;j++){
			dp[j-p[i].w] = max(dp[j-p[i].w],dp[j] + p[i].v);
			ans = max(ans,dp[j-p[i].w]);
		}
	}
	cout << ans;
}

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