Submission #1354766

#TimeUsernameProblemLanguageResultExecution timeMemory
1354766li1005345206Knapsack (NOI18_knapsack)Pypy 3
0 / 100
139 ms133824 KiB

input=lambda:sys.stdin.readline().strip()
minput=lambda:input().split()
S,N=minput()
dp = [[0]*(N+1) for _ in range(S+1)]
for i in range(N):
 V,W,K=minput()
 for j in range(min(K*W,S)+1):
  dp[i+1][j]=dp[i][j]
  if j>= W:
   dp[i+1][j]=max(dp[i][j], dp[i+1][j-W]+V)

print(max(dp[N]))

Compilation message (stdout)

Compiling 'knapsack.py'...

=======
  adding: __main__.pyc (deflated 43%)

=======
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...