Submission #726586

#	Time	Username	Problem	Language	Result	Execution time	Memory
726586		Azther0z	Knapsack (NOI18_knapsack)	C++11	37 / 100	1067 ms	212 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
struct ITEM
{
	int value,weight,copy;
};
int main()
{
	int s,n;
	cin >> s >> n;
	ITEM item[n];
	for(int i=0;i<n;i++)
		cin >> item[i].value >> item[i].weight >> item[i].copy;
	long long dp[s+1]={},result=0;
	for(int i=0;i<n;i++)
	{
		while(item[i].copy--)
		{
			for(int j=s;j>=item[i].weight;j--)
			{
				dp[j]=max(dp[j],dp[j-item[i].weight]+item[i].value);
				result=max(result,dp[j]);
			}
		}
	}
	cout << result;
}

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