Submission #1333175

#	Time	Username	Problem	Language	Result	Execution time	Memory
1333175		rubypowerscroll	Knapsack (NOI18_knapsack)	C++20	73 / 100	1095 ms	1584 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int s,n;
	cin>>s>>n;
	constexpr static int N=100000;
	int val[N],weight[N],cnt[N];
	for(int i=0;i<n;++i){
		cin>>val[i]>>weight[i]>>cnt[i];
	}
	int dp[2001]{};
	for(int i=0;i<n;++i){
		for(int x=1;x<=cnt[i]&&x*weight[i]<=s;++x){
			for(int j=s;j>=weight[i];--j){
				dp[j]=max(dp[j],dp[j-weight[i]]+val[i]);
			}
		}
	}
	cout<<dp[s]<<'\n';
}

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