Submission #1222339

#TimeUsernameProblemLanguageResultExecution timeMemory
1222339marcusufabcKnapsack (NOI18_knapsack)Pypy 3
37 / 100
1097 ms51872 KiB
max_weight, num_items = map(int, input().split()) # d[i] is the maximum value we can achieve with a basket of weight i dp = [0] * (max_weight + 1) for _ in range(num_items): value, weight, quantity = map(int, input().split()) # process each item for each available unit of it for q in range(1, quantity + 1): for w in range(max_weight, weight - 1, -1): dp[w] = max(dp[w], dp[w - weight] + value) print(dp[max_weight])

Compilation message (stdout)

Compiling 'knapsack.py'...

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

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