Submission #209523

#	Time	Username	Problem	Language	Result	Execution time	Memory
209523		model_code	Knapsack (NOI18_knapsack)	Cpython 2	37 / 100	1103 ms	81272 KiB

knapsack

S, N = map(int, raw_input().split())
dp = [0]*(S+1)

for _ in range(N):
	V, W, K = map(int, raw_input().split())
	for k in range(K):
		for s in range(S, W-1, -1):
			dp[s] = max(dp[s], dp[s-W] + V)

print (max(dp))

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