Submission #8522117


Source Code Expand

N,W=map(int,input().split())
wv=[list(map(int,input().split())) for _ in range(N)]
w1=wv[0][0]
wm=max([i[0] for i in wv])

Wlist=[0]+[j*(w1+i) for j in range(1,N+1) for i in range(4)]
dp=[[0]*(4*N+1) for _ in range(N+1)]
#dp[i][j]:N個の物に対して強度(Wlist[j])のバッグ

for i in range(1,N+1):
  w,v=wv[i-1]
  for j in range(4*N+1):
    if w<=Wlist[j]:
      
      ind=0
      d=float("inf")
      for k in range(4*N+1):
        if (Wlist[j]-w)>=Wlist[k] and (Wlist[j]-w)-Wlist[k]<d:
          d=(Wlist[j]-w)-Wlist[k]
          ind=k
      
      dp[i][j]=max(dp[i-1][j],dp[i-1][ind]+v)
    else:
      dp[i][j]=dp[i-1][j]

ind=0
d=float("inf")
for k in range(4*N+1):
  if W>=Wlist[k] and W-Wlist[k]<d:
    d=W-Wlist[k]
    ind=k
print(dp[N][ind])

Submission Info

Submission Time
Task D - Simple Knapsack
User Wattawa
Language PyPy3 (2.4.0)
Score 0
Code Size 791 Byte
Status WA
Exec Time 421 ms
Memory 45660 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 12
WA × 4
Set Name Test Cases
Sample example0, example1, example2, example3
All antigreedy0, antigreedy1, antigreedy2, example0, example1, example2, example3, quarter0, quarter1, quarter2, rand0, rand1, rand2, smallw0, smallw1, smallw2
Case Name Status Exec Time Memory
antigreedy0 AC 403 ms 44380 KB
antigreedy1 AC 403 ms 44380 KB
antigreedy2 AC 397 ms 44380 KB
example0 AC 163 ms 38256 KB
example1 AC 161 ms 38256 KB
example2 AC 169 ms 38640 KB
example3 AC 167 ms 38640 KB
quarter0 WA 415 ms 45404 KB
quarter1 WA 414 ms 45404 KB
quarter2 WA 421 ms 45660 KB
rand0 AC 167 ms 38768 KB
rand1 AC 228 ms 43116 KB
rand2 AC 198 ms 41456 KB
smallw0 AC 413 ms 43116 KB
smallw1 AC 412 ms 43116 KB
smallw2 WA 410 ms 44652 KB