| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1354766 | li1005345206 | Knapsack (NOI18_knapsack) | Pypy 3 | 139 ms | 133824 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)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
