Submission #1300253

#TimeUsernameProblemLanguageResultExecution timeMemory
1300253javahirbekKnapsack (NOI18_knapsack)Pypy 3
0 / 100
1098 ms52308 KiB
import sys input = sys.stdin.readline S,N = map(int,input().split()) Weights = [0]*N Values = [0]*N Cnt = [0]*N for i in range(N): Values[i], Weights[i],Cnt[i] = map(int,input().split()) dp = [[0]*(S+1) for _ in range(N+1)] dp[0][0] = 0 for i in range(1,N+1): for j in range(S,Weights[i-1]-1,-1): for k in range(Cnt[i-1]+1): if(j- k*Weights[i-1] >= 0): dp[i][j] = max(dp[i][j],dp[i-1][j-k*Weights[i-1]] + k*Values[i-1]) print(dp[N][S])

Compilation message (stdout)

Compiling 'knapsack.py'...

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

=======
#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...