Problem p03164 (python)

Fixed submission:
N, W = map(int, input().split())
MAX_V = 10**5+1
dp = [float('inf')] * MAX_V
dp[0] = 0
for _ in range(N):
    w, v = map(int, input().split())
    for sum_v in range(MAX_V)[::-1]:
        if sum_v >= v:
            dp[sum_v] = min(dp[sum_v - v] + w, dp[sum_v])
        else:
            dp[sum_v] = min(dp[sum_v], w)
ans = 0
for v in range(MAX_V)[:: -1]:
    if dp[v] <= W:
        ans = v
        break
print(ans)

Buggy submission (verdict: Runtime Error):
N, W = map(int, input().split())
MAX_V = 10**5+1
dp = [float('inf')] * MAX_V
dp[0] = 0
for _ in range(N):
    w, v = map(int, input().split())
    for sum_v in range(MAX_V)[::-1]:
        if sum_v >= v:
            dp[sum_v] = min(dp[sum_v - v] + w, dp[sum_v])
        else:
            dp[sum_v] = min(dp[sum_v], w)
ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 10**5
dp = [[10**18]*(MAX_V+1) for _ in range(n+1)]
dp[0][0] = 0

for i in range(1,n+1):
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            dp[i][sum_v] = min(dp[i-1][sum_v], dp[i-1][sum_v - v] + w)
        else:
            dp[i][sum_v] = min(dp[i-1][sum_v], w)

ans = 0
last_dp = dp[n]
while last_dp[ans+1] <= W:
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 10**5
dp = [10**18]*(MAX_V+1)
dp[0] = 0
tmp_dp = [0]*(MAX_V+1)
for _ in range(n):
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp
    tmp_dp = [0]*(MAX_V+1)

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 100000
dp = [0] + [10**18]*MAX_V
tmp_dp = [0]*(MAX_V+1)
for _ in range(n):
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp
    tmp_dp = [0]*(MAX_V+1)

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 100100
dp = [0] + [10**18]*MAX_V
for _ in range(n):
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp
    tmp_dp = [0]*(MAX_V+1)

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 100000
dp = [0] + [float('INF')]*MAX_V
for _ in range(n):
    tmp_dp = [0]*(MAX_V+1)
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 100000
dp = [0] + [10**(18)]*MAX_V
for _ in range(n):
    tmp_dp = [0]*(MAX_V+1)
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 10000
dp = [0] + [10**(18)]*MAX_V
for _ in range(n):
    tmp_dp = [0]*(MAX_V+1)
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 1000
dp = [0] + [10**(18)]*MAX_V
for _ in range(n):
    tmp_dp = [0]*(MAX_V+1)
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 1000
dp = [0] + [float('INF')]*MAX_V
for _ in range(n):
    tmp_dp = [0]*(MAX_V+1)
    w, v = map(int, input().split())
    for sum_v in range(MAX_V+1):
        if sum_v >= v:
            tmp_dp[sum_v] = min(dp[sum_v], dp[sum_v - v] + w)
        else:
            tmp_dp[sum_v] = min(dp[sum_v], w)
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 1000
dp = [0] + [float('INF')]*MAX_V
for _ in range(n):
    w, v = map(int, input().split())
    tmp_dp = [min(dp[sum_v], dp[sum_v - v] + w) if sum_v >= v else min(dp[sum_v], w) for sum_v in range(MAX_V) ]
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)

Buggy submission (verdict: Runtime Error):
n, W = map(int, input().split())
MAX_V = 1000
dp = [0] + [float('INF')]*MAX_V
for _ in range(n):
    w, v = map(int, input().split())
    tmp_dp = [min(dp[sum_v], dp[sum_v - v] + w) if sum_v >= v else min(dp[sum_v], w) for sum_v in range(MAX_V) ]
    dp = tmp_dp

ans = 0
while dp[ans+1] <= W:
    ans +=1
print(ans)