input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# atcoder DPまとめ
# D_Knapsack1
# def get_inputs():
# [n, w] = [int(x) for x in input().split()]
# g = []
# for _ in range(n):
# g.append([int(x) for x in input().split()])
#
# return n, w, g
if __name__ == "__main__":
n, w = list(map(int, input().split()))
###... | def calc(num,capacity):
dp = [0]*(capacity+1)
for _ in range(num):
weight, value = list(map(int, input().split()))
for w in range(capacity,weight - 1,-1):
tmp = dp[w - weight] + value
if dp[w] < tmp:
dp[w] = tmp
return dp[capacity]
num, capac... | p03163 |
def knapsack(weight,value,N,W,i,cache):
if i == N or W <= 0:
return 0
if cache[i][W] != 0:
return cache[i][W]
op1,op2 = 0,0
if weight[i] <= W:
op1 = value[i] + knapsack(weight,value,N,W-weight[i],i+1,cache)
op2 = knapsack(weight,value,N,W,i+1,cache)
cache[i][W] =... | N,W = list(map(int,input().split()))
weight = []
value = []
for i in range(N):
w,v = list(map(int,input().split()))
weight.append(w)
value.append(v)
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in range(1,N+1):
for j in range(1,W+1):
op1,op2 = 0,0
if weight[i-1] <=... | p03163 |
def solve():
max_weight, list_of_weight_and_value = read()
result = think(max_weight, list_of_weight_and_value)
write(result)
def read():
n, max_weight = read_int(2)
list_of_weight_and_value = []
for i in range(n):
list_of_weight_and_value.append(read_int(2))
return max_... | def solve():
max_weight, list_of_weight_and_value = read()
result = think(max_weight, list_of_weight_and_value)
write(result)
def read():
n, max_weight = read_int(2)
list_of_weight_and_value = []
for i in range(n):
list_of_weight_and_value.append(read_int(2))
return max_... | p03163 |
n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*(w+1) for _ in range(n+1)]
#dpテーブル
def rec(i,j):#再帰 i:何個目の商品を見てるか j:残りのナップサックの容量
if dp[i][j] != 0:#メモされてればそれを返す
return dp[i][j]
res = 0
if i == n:#すべての商品を調べ終えた
return res
else:
... | n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*(w+1) for _ in range(n+1)]
#dp:=i番目以降の商品から重さの総和がj以下となるように選んだ時の価値の総和の最大
#初期条件 dpｗｐ0で作ってるのでいらない
for j in range(w):dp[n][j] = 0
#漸化式
#dp[i][j] = dp[i+1][j] (j < w[i])
# max(dp[i+1][j] , dp[i+1][j-w[i]]+v... | p03163 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
# dp[i][j](j=0,1,...,W)の値が求まっている状態で、dp[i+1][j]を更新することを考える
for i in range(N):
for j in range(W+1):#重さ0からWまでチェック
if j-w[i]>=0:#... | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
DP = [[0] * (W + 2) for i in range(N + 2)]
"""
DP[0][W]
DP[i][j]
i:荷物の個数
j:残り容量
"""
for i in range(N):
for j in range(W+1):
if j>=w[i]:#残り容量に余裕があるとき
DP[... | p03163 |
N,W = [int(i) for i in input().split()]
w = [] # limit weight to knapsack capacity
v = [] # maximize value
for i in range(N):
line = input().split()
w.append(int(line[0]))
v.append(int(line[1]))
mem = [[0]*(W+1) for i in range(N)]
for i in range(w[0], W+1):
mem[0][i] = v[0]
for i in range(1, N):
fo... | N,W = [int(i) for i in input().split()]
dp = [0 for i in range(W+1)] # dp[i] is the the max value you have achieve with weight i
for i in range(N):
w,value = [int(i) for i in input().split()]
for weight in range(W-w, -1, -1): # range of kanpsack weight in which i can push the current item
dp[weight + w] = ... | p03163 |
def p_d():
N, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(v + dp[i - 1][j - w], dp[i][j], dp[i - 1]... | def p_d():
N, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(v + dp[i - 1][j - w], dp[i - 1][j])
... | p03163 |
def p_d():
N, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(v + dp[i - 1][j - w], dp[i - 1][j])
... | def p_e():
"""
ナップサック問題（制約厳しい版）
"""
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
NEXT = [0] * (W + 1)
for j in range(1, W + 1):
if j - w >= 0:
NEXT[j] = m... | p03163 |
import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
#x = [tuple(map(int, input().split())) for _ in range(N)]
x = [None] * N
for i in range(N):
x[i] = tuple(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i, (w, v) in enumerate(x, 1):
d... | #!/usr/bin/env python3
#import
#import math
#import numpy as np
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
dp = [0] * (W + 1)
for w, v in wv:
for i in range(W, 0, -1):
if i - w < 0:
break
dp[i] = max(dp[i], dp[i - w]... | p03163 |
def main():
N, W = list(map(int, input().split()))
dp = [-1] * (W + 1)
dp[0] = 0
ws = []
ps = []
for _ in range(N):
w, v = list(map(int, input().split()))
ws.append(w)
ps.append(v)
for i in range(len(ws)):
for j in range(W - ws[i], -1, -1):
dpi = dp[j]
if dpi != ... | def dynamicprogramming():
N, W = list(map(int, input().split()))
dp = [-1] * (W + 1)
dp[0] = 0
for _ in range(N):
w, v = list(map(int, input().split()))
for i in range(W - w, -1, -1):
dpi = dp[i]
if dpi != -1:
if dp[i + w] < dpi + v:
dp[i + w] = dpi + v
... | p03163 |
# -*- coding: utf-8 -*-
"""
D - Knapsack 1
https://atcoder.jp/contests/dp/tasks/dp_d
"""
import sys
def solve(N, W, items):
ans = {0: 0}
for w, v in items:
u = dict()
for x, y in list(ans.items()):
if x+w <= W and ans.get(x+w, 0) < y+v:
u[x+w] = y+v
... | # -*- coding: utf-8 -*-
"""
D - Knapsack 1
https://atcoder.jp/contests/dp/tasks/dp_d
"""
import sys
def solve(N, W, items):
dp = [0-1] * (W+1)
dp[0] = 0
for w, v in items:
for i in range(W, w-1, -1):
if dp[i-w] != -1:
dp[i] = max(dp[i], dp[i-w]+v)
r... | p03163 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(W + 1):
if j - w[i] >= 0:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i])
dp[i + 1][j... | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(W + 1):
if j - w[i] >= 0:
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - w[i]] + v[i])
dp[i + 1][j... | p03163 |
n, w = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(n)]
dp = [[0]*(w+1) for _ in range(n+1)]
for i in range(n):
for j in range(w+1):
dp[i+1][j] = max(dp[i][j], dp[i+1][j])
if j-w_v[i][0] >= 0:
dp[i+1][j] = max(dp[i+1][j], dp[i][j-w_v[i][0... | n, w = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(n)]
#import numpy as np
dp = [[0]*(w+1) for _ in range(n+1)]
for i in range(n):
for j in range(w+1):
dp[i+1][j] = max(dp[i][j], dp[i+1][j])
if j-w_v[i][0] >= 0:
dp[i+1][j] = max(dp[i+1][j... | p03163 |
def main():
n, w = list(map(int, input().split()))
weight = [0 for _ in range(110)]
value = [0 for _ in range(110)]
for i in range(n):
x, y = list(map(int, input().split()))
weight[i] = x
value[i] = y
dp = [[0 for _ in range(110000)] for i in range(110)]
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N, W = list(map(int, readline().split()))
INF = int(1e5)+100
weight = [0 for _ in range(110)]
value = [0 for _ in range(110)]
for i in range(N):
w, v ... | p03163 |
def inpl(): return list(map(int, input().split()))
N, L = inpl()
DP = [0]*(L+1)
for i in range(N):
DP2 = [0]*(L+1)
w, v = inpl()
for i in range(w):
DP2[i] = DP[i]
for j in range(L-w+1):
DP2[j+w] = max(DP[j] + v, DP2[j+w-1], DP[j+w])
DP = DP2
print((DP2[-1])) | def inpl(): return list(map(int, input().split()))
N, W = inpl()
DP = [0]*(W+1)
for _ in range(N):
DP2 = [0]*(W+1)
w, v = inpl()
for i in range(w):
DP2[i] = DP[i]
for i in range(w, W+1):
DP2[i] = max(DP[i], DP[i-w]+v)
DP = DP2
print((DP[-1]))
| p03163 |
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
#品物は0～N-1と考えるので注意！
DP = [[-1]*(W+1) for _ in range(N-1)] #0~N-2
#DP[depth:0~N-1][0~W] calc()の結果をメモる
#DP[N-1][]については、W-pwsum>=N-1の重さならN-1の重さ
##W-pwsum<N-1の重さ なら 0
##→W-(N-1)>=pwsumとW-(N-1)<pwsumで場合分け
DP.append([0]*(... | N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
#品物は0～N-1と考えるので注意！
DP = [0]*(W+1) #0~W
#各iにつき、残り重さがWの時の最大価値をDPに入れる
#i=N-1までいった時のmax(DP)が答え
for i in range(0, N, 1): #0~N-1
w, v = wv[i]
#残りwei(W-DPの2個目の添字)がw未満の場合入れられない
#入れない場合は変えなければいい
for nw in rang... | p03163 |
N,Wmax=list(map(int,input().split(' ')))
info=[ list(map(int,input().split(' '))) for i in range(N) ]
W = [ info[i][0] for i in range(N) ]
V = [ info[i][1] for i in range(N) ]
#dp[i][j]=i番目の品物までだけを選び重量制限をjとしたときの価値の最大値
dp = []
for i in range(N):
if i==0:
#重量制限がW[0]以上なら荷物を積むのが最善
dp.append([ V[0] if W[0]... | N,Wmax=list(map(int,input().split(' ')))
W=[]
V=[]
for _ in range(N):
w,v = list(map(int,input().split(' ')))
W.append(w)
V.append(v)
#dp[i][j]=i番目の品物までだけを選び重量制限をjとしたときの価値の最大値
dp = []
dp.append([0]*min(W[0],Wmax+1)+ [V[0]]*max(0, Wmax+1-W[0]))
for i in range(1,N):
#今回の重量制限をwとする
#今回は荷物を積む場合: dp[i]... | p03163 |
n,k = list(map(int,input().split()))
w=[]
v=[]
dp =[[0 for i in range(k+1)] for j in range(n+1)]
for i in range(n):
a,b = list(map(int,input().split()))
w.append(a)
v.append(b)
for i in range(n):
for sum_w in range(k+1):
if sum_w - w[i] >=0:
dp[i+1][sum_w]=max(dp[i][sum_... | N, W = list(map(int, input().split()))
a = []
for i in range(N):
x,y = list(map(int,input().split()))
a.append([x,y])
dp = [0]*(W+1)
max_weight = 0
for w, v in a:
max_w = min(max_weight, W-w)
for old_v, from_i in zip(dp[max_w::-1], list(range(max_w, -1, -1))):
if dp[from_i+w] < old_v... | p03163 |
N,W = list(map(int,input().split()))
dp = [0]*(W+1)
L = []
for i in range(N):
tb,ta = list(map(int,input().split()))
L.append([ta,tb])
for i in range(N):
for w in range(W,-1,-1):
if w-L[i][1]>=0 :dp[w] = max(dp[w],dp[w-L[i][1]]+L[i][0])
print((dp[-1])) | N,W = list(map(int,input().split()))
dp = [0]*(W+1)
L = []
for i in range(N):
ta,tb = list(map(int,input().split()))
L.append([tb,ta])
for i in range(N):
for w in range(W,-1,-1):
if w-L[i][1]>=0 :dp[w] = max(dp[w],dp[w-L[i][1]]+L[i][0])
print((dp[-1])) | p03163 |
# N, W = 3, 8
# ARR = [
# [3, 30],
# [4, 50],
# [5, 60],
# ]
# #
# N, W, = 6, 15
# ARR = [
# [6, 5],
# [5, 6],
# [6, 4],
# [6, 6],
# [3, 5],
# [7, 2],
# ]
N,W = list(map(int,input().split()))
ARR = []
for i in range(N):
ARR.append(list(map(int,input().s... | # N, W = 3, 8
# ARR = [
# [3, 30],
# [4, 50],
# [5, 60],
# ]
# #
N, W, = 6, 15
ARR = [
[6, 5],
[5, 6],
[6, 4],
[6, 6],
[3, 5],
[7, 2],
]
N,W = list(map(int,input().split()))
ARR = []
for i in range(N):
ARR.append(list(map(int,input().split())))
def... | p03163 |
n, w = list(map(int, input().split()))
g = []
for i in range(n):
g.append(list(map(int, input().split())))
m = [[0 for j in range(w+1)]for i in range(n+1)]
for i in range(n+1):
for j in range(w+1):
if j-g[i-1][0] < 0:
m[i][j] = m[i-1][j]
else:
m[i][j] = max(m[i-... | n, w = list(map(int, input().split()))
g = []
for i in range(n):
g.append(list(map(int, input().split())))
m = [[0 for j in range(w+1)]for i in range(n+1)]
for i in range(n):
for j in range(w+1):
if j-g[i][0] < 0:
m[i+1][j] = m[i][j]
else:
m[i+1][j] = max(m[i][j... | p03163 |
def f(i,w,d):
if i==n:
return 0
if (i,w) not in d:
if a[i][0]>w:
d[i,w]=f(i+1,w,d)
else:
d[i,w]=max(f(i+1,w,d),f(i+1,w-a[i][0],d)+a[i][1])
return d[i,w]
n,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
print(f(0,w,{})) | n,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
z=[[0]*(w+1)]
for i in range(n):
z.append(z[-1][:])
for j in range(w+1):
if a[i][0]<=j:
z[i+1][j]=max(z[i+1][j],z[i][j-a[i][0]]+a[i][1])
print(max(z[-1]))
| p03163 |
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(W):
w = wv[i - 1][0]
v = wv[i - 1][1]
if j + w <= W:
dp[i][j + w] = max(dp[i][j + w], dp... | N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(W):
w = wv[i - 1][0]
v = wv[i - 1][1]
if j + w <= W:
dp[i][j + w] = max(dp[i][j + w], dp... | p03163 |
N, W = list(map(int, input().split()))
wv = [tuple(map(int, input().split()))for _ in range(N)]
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(1, N+1):
for j in range(1, W+1):
if 0 <= j-wv[i-1][0]:
dp[i][j] = max(dp[i-1][j], dp[i-1][j-wv[i-1][0]]+wv[i-1][1])
dp[i][j] = max(dp... | n, w = list(map(int, input().split()))
weights, values = list(zip(*[tuple(map(int, input().split()))for _ in range(n)]))
dp = [0]*(w+1)
for i in range(1, n+1):
for j in reversed(list(range(1, w+1))):
if j-weights[i-1] < 0:
continue
dp[j] = max(dp[j], dp[j-weights[i-1]]+values[i-1]... | p03163 |
N, W = list(map(int, input().split()))
A = []
V = []
for i in range(N):
a, v = list(map(int, input().split()))
A.append(a)
V.append(v)
dp = [[0] * (W+1)]
for i in range(N)[::-1]:
a = []
for w in range(W+1):
if A[i] > w:
a.append(dp[-1][w])
else:
a.append(
dp[-1][w]... | N, W = list(map(int, input().split()))
A = []
V = []
for i in range(N):
a, v = list(map(int, input().split()))
A.append(a)
V.append(v)
dp = [0] * (W+1)
for i in range(N)[::-1]:
a = dp[:]
for w in range(W+1):
if A[i] <= w and a[w] < dp[w-A[i]] + V[i]:
a[w] = dp[w-A[i]] + V[i]
dp = a
... | p03163 |
def solve(N, W, weight_values):
dp = [0 for _ in range(W + 1)]
for i in range(N):
wi, vi = weight_values[i]
for w in range(W, wi - 1, -1):
dp[w] = max(dp[w], vi + dp[w - wi])
print((dp[W]))
def iln():
return list(map(int, input().split()))
N, W = iln()
w_v = [... |
N,W=list(map(int,input().split()))
dp=[0]*(W+1)
L = sorted([list(map(int,input().split())) for i in range(N)])
s=0
for w, v in L:
s+=w
for j in range(min(W,s),w-1,-1):
if dp[j-w]+v > dp[j]: dp[j]=dp[j-w]+v
print((max(dp))) | p03163 |
N,W=list(map(int,input().split()))
dp=[0]*(W+1)
L = sorted([list(map(int,input().split())) for i in range(N)])
s=0
for w, v in L:
s+=w
for j in range(min(W,s),w-1,-1):
if dp[j-w]+v > dp[j]: dp[j]=dp[j-w]+v
print((max(dp))) | def solve(N, W, weightValues):
dp = [0] * (W + 1)
s = 0
for w, v in weightValues:
s += w
for j in range(min(W, s), w - 1, -1):
if dp[j - w] + v > dp[j]:
dp[j] = dp[j - w] + v
print((max(dp)))
N, W = list(map(int, input().split()))
weightValues ... | p03163 |
def solve(N, W, weight_values):
dp = [0 for _ in range(W + 1)]
for i in range(N):
wi, vi = weight_values[i]
for w in range(W, wi - 1, -1): # loop from W down to wi
if dp[w - wi] + vi > dp[w]:
dp[w] = dp[w - wi] + vi
print((dp[W]))
def i... | def solve(N, W, weightValues):
dp = [0] * (W + 1)
s = 0
for w, v in weightValues:
s += w # why ?
for i in range(min(W, s), w - 1, -1): # why min(W, s)
if dp[i - w] + v > dp[i]:
dp[i] = dp[i - w] + v
print((max(dp)))
def iln(): return list(map(int,... | p03163 |
n,max_w = list(map(int,input().split()))
w=[]
v=[]
for i in range(n):
tmp_w,tmp_v = list(map(int,input().split()))
w.append(tmp_w)
v.append(tmp_v)
dp =[[-1]*(max_w+1) for i in range(n+1)]
#i番目以降の品物から、重さの総和がj以下となるように選ぶ
def knapsac(i,j):
if dp[i][j]>=0:
return dp[i][j]
if i == n:
#... | n,w = list(map(int,input().split()))
info = [[0,0]]+[list(map(int,input().split())) for i in range(n)]
## dp[i][j]:i番目までのアイテムを重さjのナップサックに詰めるときの最大価値
dp = [[0]*(w+1) for i in range(n+1)]
for i in range(n+1):
for j in range(w+1):
if j-info[i][0]>=0:
dp[i][j] = max(dp[i-1][j],dp[i-1][j-info[i][0]]+info... | p03163 |
# coding: utf-8
# Your code here!
N,W=list(map(int,input().split()))
l=[-1]*(W+1)
l[0]=0
dp=l[:]
for i in range(N):
w,v=list(map(int,input().split()))
for index,item in enumerate(l):
if item!=-1 and W>=index+w:
dp[index+w]=max(item+v,l[index+w])
l=dp[:]
print((max(l)))
| # coding: utf-8
# Your code here!
N,W=list(map(int,input().split()))
jwels=[]
for _ in range(N):
jwels.append(list(map(int,input().split())))
dp=[-1]*(W+1)
dp[0]=0
for w,v in jwels:
for i in range(W+1)[::-1]:
if dp[i]!=-1 and i+w<=W:
dp[i+w]=max(dp[i]+v,dp[i+w])
... | p03163 |
# coding: utf-8
# Your code here!
N,W=list(map(int,input().split()))
jwels=[]
for _ in range(N):
jwels.append(list(map(int,input().split())))
dp=[-1]*(W+1)
dp[0]=0
for w,v in jwels:
for i in range(W+1)[::-1]:
if dp[i]!=-1 and i+w<=W:
dp[i+w]=max(dp[i]+v,dp[i+w])
... | # coding: utf-8
# Your code here!
N,W=list(map(int,input().split()))
dp=[-1]*(W+1)
dp[0]=0
for _ in range(N):
w,v=list(map(int,input().split()))
for i in range(W+1)[::-1]:
if dp[i]!=-1 and i+w<=W:
dp[i+w]=max(dp[i+w],dp[i]+v)
print((max(dp))) | p03163 |
a = list(map(int, input().split()))
b = [list(map(int, input().split())) for i in range(a[0])]
result = []
max_weight = a[1]
def calc(i, queue):
if len(b) <= i:
return
current = b[i]
prev = queue[-1] if 0 < len(queue) else [0, 0]
if current[0] + prev[0] <= max_weight:
... | a = list(map(int, input().split()))
b = [list(map(int, input().split())) for i in range(a[0])]
max_index = a[0]
max_weight = a[1]
dp = [ [0] * (max_weight + 1) for j in range(max_index + 1)]
def solve():
for i in range(max_index - 1, -1, -1):
for j in range(max_weight + 1):
if (j <... | p03163 |
N,W = [int(v) for v in input().split()]
items = [[int(v) for v in input().split()] for _ in range(N)]
dp = [[0 for _ in range(W+1)] for _ in range(N+1)]
for i in range(1,N+1):
w,v = items[i-1]
for cap in range(W+1):
if cap - w >= 0:
dp[i][cap] = max(dp[i][cap],dp[i-1][cap-w]+v)
... | N,W = [int(v) for v in input().split()]
dp = [[0 for _ in range(W+1)] for _ in range(N+1)]
for i in range(1,N+1):
w,v = [int(v) for v in input().split()]
for cap in range(W+1):
if cap - w >= 0:
dp[i][cap] = max(dp[i][cap],dp[i-1][cap-w]+v)
dp[i][cap] = max(dp[i][cap],dp[i-1]... | p03163 |
def opt(N,W):
dp=[0]*(W+1)
for _ in range(N):
w,v=list(map(int,input().split()))
for i in range(W,w-1,-1):
dp[i]=max(dp[i],dp[i-w]+v)
print((dp[W]))
N,W=list(map(int,input().split()))
opt(N,W) | def opt(N,W):
dp=[0]*(W+1)
for _ in range(N):
w,v=list(map(int,input().split()))
for i in range(W,w-1,-1):
tmp=dp[i-w]+v
if tmp>dp[i]:
dp[i]=tmp
print((dp[W]))
N,W=list(map(int,input().split()))
opt(N,W)
| p03163 |
import sys
sys.setrecursionlimit(10000)
from functools import lru_cache
def resolve():
N, W = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(N)] # [N][0:weight, 1:value]
dp = [[-1] * (W+1) for _ in range(N+1)]
#print(dp)
@lru_cache(maxs... | def resolve():
N, W = list(map(int, input().split()))
w_v = [list(map(int, input().split())) for _ in range(N)] # [N][0:weight, 1:value]
dp = [[0] * (W+1) for _ in range(N+1)]
for i in range(N-1,-1,-1):
for j in range(W+1):
w = w_v[i][0]
v = w_v[i][1]
... | p03163 |
# -*- coding: utf-8 -*-
"""
Created on Sat Feb 16 19:31:10 2019
Knapsack1
@author: maezawa
"""
n, w = list(map(int, input().split()))
warr = [0]*(n+1)
varr = [0]*(n+1)
for i in range(n):
wi, vi = list(map(int, input().split()))
warr[i+1] = wi
varr[i+1] = vi
dp = [[0]*(w+1) for _ in rang... |
n, w = list(map(int, input().split()))
warr = [0]*(n+1)
varr = [0]*(n+1)
for i in range(n):
wi, vi = list(map(int, input().split()))
warr[i+1] = wi
varr[i+1] = vi
dp = [[0]*(w+1) for _ in range(n+1)]
for i in range(1,n+1):
for j in range(1,w+1):
jw = j-warr[i]
if jw ... | p03163 |
import sys
sys.setrecursionlimit(1000000) # 再帰上限を増やす
def main():
input = sys.stdin.readline # 文字列に対してinputした場合は、rstripするのを忘れずに！
N, W = list(map(int, input().rstrip().split()))
item_list = []
for _ in range(N):
w, v = list(map(int, input().rstrip().split()))
item_list.append((w... | import sys
sys.setrecursionlimit(1000000) # 再帰上限を増やす
def main():
input = sys.stdin.readline # 文字列に対してinputした場合は、rstripするのを忘れずに！
N, W = list(map(int, input().rstrip().split()))
item_list = []
for _ in range(N):
w, v = list(map(int, input().rstrip().split()))
item_list.append((w... | p03163 |
N,W = list(map(int,input().split()))
lis = [[[0,0]]]
for i in range(N):
w,v = list(map(int,input().split()))
new = []
for j in lis[i]:
if j[0] + w <= W:
new.append([j[0] + w , j[1] + v])
new.append([j[0] ,j[1]])
lis.append(new)
ans = ... |
N,W = list(map(int,input().split()))
lis = [ [0] * (W+1) ]
for i in range(N):
w,v = list(map(int,input().split()))
new = [0] * (W+1)
for j in range(W+1):
new[j] = max(new[j],lis[-1][j])
if j+w <= W:
new[j+w] = max(new[j+w],lis[-1][j]+v)
lis.appe... | p03163 |
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
def chmax(a, b):
if a >= b:
return a
else:
return b
dp = [[0]*(10**5 + 10) for _ in range(110)]
#i個の品物を入れて重さがjになっているときの価値の総和の最大値
#dp[i+1][j] = dp[i... | N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)] #1-index
def chmax(a,b):
if a >= b:
return a
else:
return b
# dp[i+1][w]: i番目までの品物を選びその重さがwを超えないときの最大価値
dp = [[0]*(W+10) for _ in range(N+10)]
for i in range(N):
for w in range(W+1):... | p03163 |
import sys
input = sys.stdin.readline
N, W = [int(i) for i in input().split()]
wv = [[int(i) for i in input().split()] for j in range(N)]
def ans(N, W, wv):
d = [[0] * (W+1) for i in range(N+1)]
for i in range(N):
for j in range(W+1):
if wv[i][0] > j:
d[i+1][j]... | import sys
input = sys.stdin.readline
N, W = [int(i) for i in input().split()]
def ans(N, W):
d = [0] * (W+1)
for i in range(N):
wi, vi = [int(i) for i in input().split()]
for w in range(W, wi - 1, -1):
v_ = d[w - wi] + vi
if v_ > d[w]:
d[w... | p03163 |
N, W = [int(_) for _ in input().split()]
WV = sorted([[int(_) for _ in input().split()] for _ in range(N)],
reverse=True)
dp = {}
dp[0] = 0
for w, v in WV:
dp_o = dp.copy()
for k in dp_o:
if k + w <= W:
dp[k + w] = max(dp_o.get(k + w, 0), dp_o[k] + v)
print((max([v for ... | N, W = [int(_) for _ in input().split()]
WV = [[int(_) for _ in input().split()] for _ in range(N)]
dp = {}
dp[0] = 0
for w, v in WV:
dp_o = dp.copy()
for k in dp_o:
if k + w <= W:
dp[k + w] = max(dp_o.get(k + w, 0), dp_o[k] + v)
print((max([v for k, v in list(dp.items())])))
| p03163 |
n, w = (int(x) for x in input().split())
wv = [[0, 0]]
for _ in range(n):
wv.append([int(x) for x in input().split()])
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(w + 1):
dp[0][i] = 0
for i in range(1, n + 1):
for j in range(1, w + 1):
if j - wv[i][0] >= 0:
dp[i][... | n, w = (int(x) for x in input().split())
wv = [[0, 0]]
for _ in range(n):
wv.append([int(x) for x in input().split()])
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(w + 1):
dp[0][i] = 0
for i in range(1, n + 1):
for j in range(0, w + 1):
if j - wv[i][0] >= 0:
dp[i][... | p03163 |
def main():
N, W = list(map(int, input().split()))
wi, vi = list(map(int, input().split()))
dp = [0] * wi + [vi] * (W + 1 - wi)
for _ in range(1, N):
wi, vi = list(map(int, input().split()))
dp[wi:] = [max(i + vi, j) for i, j in zip(dp, dp[wi:])]
print((dp[-1]))
if __name... | def main():
N, W = list(map(int, input().split()))
wi, vi = list(map(int, input().split()))
dp = [0] * wi + [vi] * (W + 1 - wi)
for _ in range(1, N):
wi, vi = list(map(int, input().split()))
for i in range(W, wi - 1, -1):
t = dp[i - wi] + vi
if t > dp[i]:
... | p03163 |
n, w = list(map(int, input().split()))
arr = [list(map(int, input().split())) for _ in range(n)]
# 最大化問題なので0で初期化
dp = [[0] * (w + 1) for _ in range(n + 1)]
# 品物iを選べる場合、前の行からsum_wから品物iの重さを引いた要素を参照する
for i in range(1, n + 1):
for j in range(1, w + 1):
if j - arr[i - 1][0] >= 0:
dp[i][j... | n, w = list(map(int, input().split()))
arr = [list(map(int, input().split())) for _ in range(n)]
# 最大化問題なので0で初期化
dp = [[0] * (w + 1) for _ in range(n + 1)]
# 品物iを選ばない場合で更新してから、選べる場合は再更新
for i in range(1, n + 1):
for j in range(w + 1):
dp[i][j] = dp[i - 1][j]
if j - arr[i - 1][0] >= 0:
... | p03163 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_left... | p03163 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_left... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools import accumulate, product
from bisect import bisect_left... | p03163 |
N, W = list(map(int, input().split()))
X = [0] + [-1] * W
for i in range(N):
w, v = list(map(int, input().split()))
for j in range(W - w, -1, -1):
if X[j] >= 0:
X[j+w] = max(X[j+w], X[j]+v)
print((max(X))) | def MAX(a, b):
return b + (((((a + ms - b) & ms) >> (K - 1)) * tt) & (ms + a - b))
def tolist(n):
sx = bin(n)[2:] + "_"
return [int(sx[-(i+1) * K - 1:-i * K - 1], 2) for i in range((len(sx)+K-2) // K)]
K = 52
N, W = list(map(int, input().split()))
ms = int(("1" + "0" * (K - 1)) * (W + 1), 2)
t... | p03163 |
n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
#重さ、価値の順
dp=[[0]*(w+1) for i in range(n+1)]
#配列のインデックスを重さに対応させる
for i in range(n):
for sum_w in range(w+1):
if sum_w-l[i][0]>=0:
dp[i+1][sum_w]=max(dp[i+1][sum_w],dp[i][sum_w-l[i][0]]+l[i... | #DP-C
n,w=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
dp=[[0]*(w+1) for i in range(n+1)]
for i in range(1,n+1):
for sum_w in range(w+1):
if sum_w-l[i-1][0]>=0:
dp[i][sum_w]=max(dp[i-1][sum_w],dp[i-1][sum_w-l[i-1][0]]+l[i-1][1])
else:
... | p03163 |
N,W = list(map(int,input().split()))
dp = [0 for _ in range(W+1)]
for i in range(N):
w,v = list(map(int,input().split()))
for j in range(W+1):
if j+w <= W:
dp[j] = max(dp[j],dp[j+w]+v)
print((max(dp))) | N, capW = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for _ in range(N)]
def knapsack01(items, capW):
dp = [0] * (capW+1)
for wi, vi in items:
for w in reversed(list(range(wi, capW+1))):
v0 = dp[w-wi] + vi
if v0 > dp[w]:
dp... | p03163 |
import sys
input = sys.stdin.readline
def main():
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
DP = [[0] * (W+1) for _ in range(N+1)]
for i in range(N):
for sum_w in range(W+1):
if sum_w - wv[i][0] >= 0:
... | import sys
def main():
_input = sys.stdin.readline
N, W = list(map(int, _input().split()))
wv = [list(map(int, _input().split())) for _ in range(N)]
wv.sort()
DP = [-1] * (W+1)
DP[0] = 0
sum_w = 0
for w, v in wv:
sum_w += w
for j in range(min(W, sum_w... | p03163 |
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
weights2check = [0]
for _ in range(N):
w, v = list(map(int, input().split()))
new_weights2check = []
for k in weights2check:
if k + w <= W:
dp[k + w] = max(dp[k + w], dp[k] + v)
new_weights2check.append(k + ... | N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
weights2check = [0]
ans = 0
for _ in range(N):
w, v = list(map(int, input().split()))
for k in range(W-w, -1, -1):
dp[k + w] = max(dp[k + w], dp[k] + v)
ans = max(ans, dp[k + w])
print(ans)
| p03163 |
N,W=list(map(int,input().split()))
wv=[list(map(int,input().split())) for i in range(N)]
dp=[[0]*(W+1) for _ in range(N+1)]
for w in range(W+1):
for n in range(N):
if wv[n][0]<=w:
dp[n+1][w]+=max(wv[n][1]+dp[n][w-wv[n][0]],dp[n][w])
else:
dp[n+1][w]=dp[n][w]
pr... | N, W = list(map(int, input().split()))
wv = [[int(i) for i in input().split()] for i in range(N)]
dp=[[0]*(W+1) for i in range(N+1)]
for w in range(W+1):
for n in range(N):
if wv[n][0] <= w:
dp[n+1][w] = max(dp[n][w-wv[n][0]] + wv[n][1], dp[n][w])
else:
dp[n+1][... | p03163 |
N,W=list(map(int,input().split()))
wv=[list(map(int,input().split())) for _ in range(N)]
dp=[[0]*(W+1) for _ in range(N+1)]
for w in range(W+1):
for n in range(N):
if w>=wv[n][0]:
dp[n+1][w] += max(dp[n][w-wv[n][0]]+wv[n][1], dp[n][w])
else:
dp[n+1][w]=dp[n][w]
... | N,W=list(map(int,input().split()))
w=[0]*N
v=[0]*N
for i in range(N):
w[i],v[i]=list(map(int,input().split()))
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(W+1):
for g in range(N):
if i>=w[g]:
dp[g+1][i]=max(dp[g][i],v[g]+dp[g][i-w[g]])
else:
dp[g+1]... | p03163 |
n,W=list(map(int,input().split()))
w_list=[]
v_list=[]
dp=[]
for i in range(n):
w,v=list(map(int,input().split()))
w_list.append(w)
v_list.append(v)
for i in range(n):
dp_sub=[]
for j in range(W+1):
dp_sub.append(-1)
dp.append(dp_sub)
dp_sub=[]
for j in range(W+1):
dp_... | n,W=list(map(int,input().split()))
w_list=[0]
v_list=[0]
for i in range(n):
w,v=list(map(int,input().split()))
w_list.append(w)
v_list.append(v)
dp=[]
for i in range(n+1):
sub_list=[]
for j in range(W+1):
sub_list.append(0)
dp.append(sub_list)
for i in range(1,n+1):
for... | p03163 |
N,W = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(N)]
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in range(N) :
weight_i,value_i = L[i]
for weight in range(W+1) :
if weight - weight_i >= 0 :
dp[i+1][weight] = max(dp[i][weight], dp... | n,w = list(map(int,input().split()))
dp = [[0]*(w+1) for i in range(n+1)]
for i in range(1, n+1) :
a, v = list(map(int,input().split()))
for j in range(1, w+1) :
if j < a :
dp[i][j] = max(dp[i-1][j], dp[i][j-1])
else :
dp[i][j] = max(dp[i-1][j], dp[i][j-1], dp[i... | p03163 |
import sys
def 解():
input = sys.stdin.readline
N,W=[int(_) for _ in input().split()]
#dp = [[0]*(W+1) for _ in range(N+1)]
dp = [0]*(W+1)
for i in range(N):
w,v=[int(_) for _ in input().split()]
for j in range(W,w-1,-1):
dp[j] = max(dp[j] ,dp[j-w]+v)
pr... | import sys
def 解():
input = sys.stdin.readline
N,W=[int(_) for _ in input().split()]
dp = [0]*(W+1)
for i in range(N):
w,v=[int(_) for _ in input().split()]
for j in range(W,w-1,-1):
dp[j] = max(dp[j] ,dp[j-w]+v)
print((dp[W]))
解()
| p03163 |
N, W = list(map(int, input().split(' ')))
pair = [tuple(map(int, input().split(' '))) for _ in range(N)]
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(N):
for sum_w in range(W+1):
if sum_w >= pair[i][0]:
dp[i+1][sum_w] = max(dp[i][sum_w], dp[i][sum_w-pair[i][0]] + pair[i][1])
... | N, WW = list(map(int, input().split()))
W = [0] * N
V = [0] * N
for i in range(N):
w, v = list(map(int, input().split()))
W[i] = w
V[i] = v
dp = [[0]*(WW+1) for _ in range(N+1)]
for n in range(1, N+1):
w = W[n-1]
v = V[n-1]
for sum_w in range(WW+1):
if sum_w <= WW - w:
... | p03163 |
def LI(): return [int(x) for x in input().split()]
def II(): return int(eval(input()))
N,W=LI()
LIS=[tuple(LI()) for _ in range(N)]
DP = [[0]*(W+1) for i in range(N+1)]
for i,(w,v) in enumerate(LIS, 1):
for wb in range(0, W+1):
DP[i][wb] = DP[i-1][wb]
if wb >= w :
DP[i][wb... | def LI(): return [int(x) for x in input().split()]
def II(): return int(eval(input()))
N,W=LI()
LIS=[tuple(LI()) for _ in range(N)]
DP = [[0]*(W+1) for i in range(N+1)]
for i,(w,v) in enumerate(LIS, 1):
for wb in range(0, W+1):
DP[i][wb] = DP[i-1][wb]
if wb >= w :
DP[i][wb... | p03163 |
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
N,W = MAP()
weight=[]
value=[]
for i in range(N):
w,v = MAP()
weight.append(w)
value.append(v)
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(N)... | n,W = list(map(int,input().split()))
w = []
v = []
for i in range(n):
w_,v_ = list(map(int,input().split()))
w.append(w_)
v.append(v_)
dp = [[0]*(W+1) for _ in range(n+1)]
for i in range(n):
for sum_w in range(W+1):
dp[i+1][sum_w] = max(dp[i+1][sum_w],dp[i][sum_w])
if sum_w-... | p03163 |
n,w=list(map(int,input().split()))
d,f=list(map(int,input().split()))
if n==1:print((f if d<=w else 0));exit()
dp=[[0,0],[d,f]]#w,v
dp_=[]
for i in range(1,n):
d,f=list(map(int,input().split()))
if dp_==[]:
for x,c in dp:
if x+d<=w:dp_.append([x+d,c+f])
dp_+=dp
dp=[]
else:
for x... | n,w=list(map(int,input().split()))
dp=[0]*(w+1)
for i in range(n):
wi,vi=list(map(int,input().split()))
for j in range(w-wi,-1,-1):
dp[j+wi]=max(dp[j+wi],dp[j]+vi)
print((dp[-1])) | p03163 |
n,W=list(map(int,input().split()))
li=[]
wr=[0]*n
vr=[0]*n
dd = [[0 for _ in range(W+1)] for k in range(n+1)]
for i in range(n):
w,v=list(map(int,input().split()))
wr[i]=w
vr[i]=v
mw=min(wr)
def maxv(i,w):
if dd[i][w]!=0:
return dd[i][w]
if i==n:
return 0
if W-w<mw:
return 0
if w+wr[... | n,W=list(map(int,input().split()))
dp=[0]*(W+1)
dd=dp.copy()
for i in range(n):
w,v=list(map(int,input().split()))
for j in range(W):
cw=j+w
cv=dp[j]+v
if cw <=W and dd[cw]<cv:
dd[cw]=cv
dp=dd.copy()
print((dp[W])) | p03163 |
n,W=list(map(int,input().split()))
dp=[0]*(W+1)
dd=dp.copy()
for i in range(n):
w,v=list(map(int,input().split()))
for j in range(W):
cw=j+w
cv=dp[j]+v
if cw <=W and dd[cw]<cv:
dd[cw]=cv
dp=dd.copy()
print((dp[W])) | n,W=list(map(int,input().split()))
dp=[0]*(W+1)
for i in range(n):
w,v=list(map(int,input().split()))
for j in range(W,-1,-1):
cw=j+w
cv=dp[j]+v
if cw <=W and dp[cw]<cv:
dp[cw]=cv
print((dp[W])) | p03163 |
n,W=list(map(int,input().split()))
dp=[0]*(W+1)
for i in range(n):
w,v=list(map(int,input().split()))
for j in range(W,-1,-1):
cw=j+w
cv=dp[j]+v
if cw <=W and dp[cw]<cv:
dp[cw]=cv
print((dp[W])) | n,W=list(map(int,input().split()))
dp=[0]*(W+1)
for _ in range(n):
w,v=list(map(int,input().split()))
for j in range(W-w,-1,-1):
dp[j+w]=max(dp[j+w],dp[j]+v)
print((dp[W])) | p03163 |
n,w=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
dp=[[0 for _ in range(w+1)] for _ in range(n+1)]
for i in range(n):
for j in range(w+1):
weight,value=a[i]
dp[i+1][j]=max(dp[i][j],dp[i+1][j])
if j+weight<=w:
dp[i+1][j+weight]=max(dp[... | n,W=list(map(int,input().split()))
a=[list(map(int,input().split())) for _ in range(n)]
dp=[[0 for _ in range(W+1)] for _ in range(n+1)]
for i in range(n):
weight,value=a[i]
for j in range(W+1):
dp[i+1][j]=max(dp[i][j],dp[i+1][j])
if j+weight<=W:
dp[i+1][j+weight]=max(dp[i][j... | p03163 |
N, W = list(map(int, input().split()))
item = [list(map(int, input().split())) for _ in range(N)]
dp = [[0]*100100 for _ in range(110)]
for i in range(N):
for sum_w in range(W+1):
weight, value = item[i]
if sum_w - weight >= 0:
dp[i + 1][sum_w] = max(dp[i + 1][sum_w], dp[i][su... | N, W = list(map(int, input().split()))
dp = [[0]*100100 for _ in range(110)]
for i in range(N):
weight, value = list(map(int, input().split()))
for sum_w in range(W+1):
if sum_w - weight >= 0:
dp[i + 1][sum_w] = max(dp[i + 1][sum_w], dp[i][sum_w - weight] + value)
dp[i + 1... | p03163 |
N, W = list(map(int, input().split()))
dp = [[0]*100100 for _ in range(110)]
for i in range(N):
weight, value = list(map(int, input().split()))
for sum_w in range(W+1):
if sum_w - weight >= 0:
dp[i + 1][sum_w] = max(dp[i + 1][sum_w], dp[i][sum_w - weight] + value)
dp[i + 1... | N, W = list(map(int, input().split()))
dp = [[0] * (W + 1) for i in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j >= w:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - ... | p03163 |
import os
import sys
from io import BytesIO, IOBase
def knapsack(wt,price,n,c,dp):
if n<0 or c==0:
return 0
if dp[n][c]!=-1:
return dp[n][c]
inc=exc=0
if c>=wt[n]:
inc=price[n]+knapsack(wt,price,n-1,c-wt[n],dp)
exc=0+knapsack(wt,price,n-1,c,dp)
dp[n][c]=ma... | def knapsackBottomUp(wt,price,c,n):
dp=[[0 for x in range(c+1)] for y in range(n+1)]
for i in range(n+1):
for w in range(c+1):
if i==0 or w==0:
dp[i][w]=0
else:
inc=exc=0
if wt[i-1]<=w:
inc=price[i-1]+dp... | p03163 |
x, y = list(map(int, input().split()))
dp = [0]*(y+1)
for i in range(x):
w, v = list(map(int, input().split()))
for j in range(y, w-1, -1):
num = dp[j-w]+v
if num > dp[j]:
dp[j] = num
print((dp[-1])) | def main():
n, w = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(n)]
dp = [0] * (w + 1)
for wi, vi in wv:
for sum_w in range(w, wi - 1, -1):
v = dp[sum_w - wi] + vi
if dp[sum_w] < v:
dp[sum_w] = v
pri... | p03163 |
import sys
input = sys.stdin.readline
def main():
N, W = list(map(int, input().split()))
wv = [None] * N
for i in range(N):
wv[i] = tuple(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i, (w, v) in enumerate(wv, start=1):
dp_i = dp[i]
... | import sys
input = sys.stdin.readline
def main():
N, W = list(map(int, input().split()))
wv = [None] * N
for i in range(N):
wv[i] = tuple(map(int, input().split()))
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i, (w, v) in enumerate(wv, start=1):
dp_i = dp[i]
... | p03163 |
def calc():
N,W=list(map(int,input().split()))
dp=[-1]*(W+1)
dp[0]=0
for i in range(N):
w,v=list(map(int,input().split()))
for j in range(W-w,-1,-1):
if dp[j]!=-1:
dp[j+w]=max(dp[j+w],dp[j]+v)
print((max(dp)))
calc() | def calc():
N,W=list(map(int,input().split()))
dp=[-1]*(W+1)
dp[0]=0
for i in range(N):
w,v=list(map(int,input().split()))
for j in range(W-w,-1,-1):
if dp[j]!=-1:
if dp[j+w]<dp[j]+v:
dp[j+w]=dp[j]+v
print((max(dp)))
calc() | p03163 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | p03163 |
import copy
n,w=list(map(int,input().split()))
wv=[list(map(int,input().split())) for _ in range(n)]
dp=([0]*wv[0][0])+[wv[0][1]]*(w+1-wv[0][0])
for i in range(n-1):
dp_copy=copy.deepcopy(dp)
for j in range(w+1):
if j>=wv[i+1][0]:
dp[j]=max(dp_copy[j],dp_copy[j-wv[i+1][0]]+wv[i+1][1]... | n,w=list(map(int,input().split()))
wv=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*(w+1) for _ in range(n+1)]
for i in range(n):
for j in range(w+1):
if j>=wv[i][0]:
dp[i+1][j]=max(dp[i][j],dp[i][j-wv[i][0]]+wv[i][1])
else:
dp[i+1][j]=dp[i][j]
print((dp... | p03163 |
# D-Knapsack 1
N,W = list(map(int,input().split()))
Weight = [0 for _ in range(N)]
Value = [0 for _ in range(N)]
for i in range(N):
Weight[i],Value[i] = list(map(int,input().split()))
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in range(N):
# あらゆる合計重量sum_wに対して品物iを入れるべきか計算する
for sum... | # D-Knapsack 1
N,W = list(map(int,input().split()))
Weight = [0 for _ in range(N)]
Value = [0 for _ in range(N)]
for i in range(N):
Weight[i],Value[i] = list(map(int,input().split()))
# dp[i+1][w]:= i番目までの品物の中から重さがwを超えないように選んだときの、価値の総和の最大値
dp = [[0 for i in range(W+1)] for j in range(N+1)]
for i in rang... | p03163 |
def resolve():
import sys
input = sys.stdin.readline
# 整数 1 つ
# n = int(input())
# 整数複数個
n, w = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
# N = [int(input()) for i in range(N)]
# 整数 N 個 (スペース区切り)
# N = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
... | def resolve():
import sys
input = sys.stdin.readline
# 整数 1 つ
# n = int(input())
# 整数複数個
n, w = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
# N = [int(input()) for i in range(N)]
# 整数 N 個 (スペース区切り)
# N = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
... | p03163 |
N,W = list(map(int,input().split()))
w = []
v = []
for i in range(N):
w_,v_ = list(map(int,input().split()))
w.append(w_)
v.append(v_)
dp = [[0]*(W+1) for _ in range(N+1)]
def memo(i,j):
if dp[i][j]:
return dp[i][j]
if i == N:
dp[i][j] = 0
elif w[i] > j:
dp[i][j] = memo(i+1,j)
... | import sys
sys.setrecursionlimit(10**9)
N,W = list(map(int,input().split()))
w = []
v = []
for i in range(N):
w_,v_ = list(map(int,input().split()))
w.append(w_)
v.append(v_)
dp = [[0]*(W+1) for _ in range(N+1)]
def memo(i,j):
if dp[i][j]:
return dp[i][j]
if i == N:
dp[i][j] = 0
e... | p03163 |
# 再帰関数使用時は再帰上限を十分にとること
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
# グローバル変数定義
INF = 10 ** 13
N, W = list(map(int, input().split()))
# knopsock[n][0] = w : n = 品物の位置 , w = 重さ
# knopsock[n][1] = v : n = 品物の位置 , v = 価値
knapsack = [list(map(int, input().split())) for _ in ... | import sys
readline = sys.stdin.readline
def chmax(a, b):
"""
2値の大きい値を返す
Args:
a (int) : 値１
b (int) : 値２
Return:
a (int) : aまたはbの大きい値
"""
if a < b:
a = b
return a
def main():
N, W = list(map(int, readline().split()))
... | p03163 |
n, mw = list(map(int, input().split()))
w, v = [], []
for _ in range(n):
x, y = list(map(int, input().split()))
w.append(x)
v.append(y)
dp = [[0 for _ in range(mw+1)] for _ in range(n+1)]
for i in range(1, n+1):
for j in range(mw+1):
if w[i-1] <= j:
dp[i][j] = max(dp[i-1][j... | n, mw = list(map(int, input().split()))
goods = [tuple(map(int, input().split())) for _ in range(n)]
dp = [[0 for _ in range(mw+1)] for _ in range(n+1)]
for i in range(n):
for j in range(mw+1):
w, v = goods[i]
if j >= w:
dp[i+1][j] = max(dp[i][j], dp[i][j - w] + v)
else: ... | p03163 |
N,W=list(map(int,input().split()))
w,v=[],[]
for i in range(N):
a,b=list(map(int,input().split()))
w.append(a)
v.append(b)
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(N):
for j in range(W+1):
if j-w[i]>=0:
dp[i+1][j]=dp[i][j-w[i]]+v[i]
dp[i+1][j]=max(dp[i+1][j],dp[i][j])
... | N,W=list(map(int,input().split()))
w,v=[],[]
for i in range(N):
ww,vv=list(map(int,input().split()))
w.append(ww)
v.append(vv)
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(N):
for j in range(W+1):
if j-w[i]>=0:
dp[i+1][j]=max(dp[i][j-w[i]]+v[i],dp[i+1][j])
dp[i+1][j]=max(dp[i+1][... | p03163 |
def main():
N, W = [int(n) for n in input().split()]
baggages = [[int(n) for n in input().split()] for i in range(N)]
VALUE, WEIGHT = 1, 0
dp = [[-1] * (W+1) for n in range(N)]
# dp[baggage][weight] := baggage番目までの荷物を使ってweight以下に抑える
dp[0] = [0 if weight < baggages[0][WEIGHT] else baggage... | N,W = [int(_n) for _n in input().split()]
A = []
for i in range(N):
w,v = [int(_n) for _n in input().split()]
A.append((w,v))
dp = [[0]*(W+1) for _ in range(N)]
for w in range(W+1):
dp[0][w] = 0 if w < A[0][0] else A[0][1]
for i in range(N):
for w in range(W+1):
dp[i][w] = dp[i-1][... | p03163 |
import sys
sys.setrecursionlimit(10 ** 8)
N, W = list(map(int, input().split()))
w = []
v = []
for i in range(N):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [[-1] *(W + 1) for i in range(N + 1)]
def dfs(i, W):
if dp[i][W] != -1:
return dp[i][W]
... | N, W = list(map(int, input().split()))
w = []
v = []
for i in range(N):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [[0] *(W + 1) for i in range(N + 1)]
for i in range(N):
for j in range(W + 1):
if j < w[i]:
dp[i + 1][j] = dp[i][j]
... | p03163 |
N, W = list(map(int, input().split()))
w_list = []
v_list = []
for i in range(N):
w, v = list(map(int, input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0 for i in range(W+1)] for i in range(N)]
for i in range(N):
w = w_list[i]
v = v_list[i]
for j in range(W+1):
if j... | N,W = list(map(int,input().split()))
w_list = []
v_list = []
for _ in range(N):
w,v = list(map(int,input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0]*(W+1) for i in range(N+1)]
for i in range(1,N+1):
w = w_list[i-1]
v = v_list[i-1]
for j in range(1,W+1):
if j-w >= ... | p03163 |
N,W = list(map(int,input().split()))
w_list = []
v_list = []
for _ in range(N):
w,v = list(map(int,input().split()))
w_list.append(w)
v_list.append(v)
dp = [[0]*(W+1) for i in range(N+1)]
for i in range(1,N+1):
w = w_list[i-1]
v = v_list[i-1]
for j in range(1,W+1):
if j-w >= ... | n,W = list(map(int,input().split()))
dp = [[0]*(W+1) for i in range(n)]
for i in range(n):
w,v = list(map(int,input().split()))
if i == 0:
for j in range(W+1):
if w <= j:
dp[0][j] = v
else:
for j in range(W+1):
if j < w:
dp[i... | p03163 |
n,w=list(map(int,input().split()))
WV=[list(map(int,input().split())) for i in range(n)]
#WV[i][0]が重さ、WV[i][1]が価値
#配るDP
dp=[[0 for i in range(w+1)] for i in range(n+1)]
#dp[i][j]はi回目(0,n-1)に重さjまで入るmax value
for i in range(n):
for j in range(w+1):
if WV[i][0]+j<=w and i <=n-1:
dp[i+1][j+... | # 貰うDP
n, w = list(map(int, input().split()))
WV = [list(map(int, input().split())) for i in range(n)]
# dp[i][w] 重さwでの最高価値
dp = [[-1] * (w + 1) for i in range(n + 1)]
for j in range(w + 1):
dp[0][j] = 0
for i in range(n):
for j in range(w + 1):
if j - WV[i][0] >= 0 and j - WV[i][0] <= w:
... | p03163 |
n, m = list(map(int, input().split()))
WV = [tuple(map(int, input().split())) for i in range(n)]
W = [w for w, v in WV]
V = [v for w, v in WV]
DP = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(n):
for j in range(W[i]):
DP[i+1][j] = DP[i][j]
for j in range(W[i], m+1):
DP[... | n, m = list(map(int, input().split()))
WV = [tuple(map(int, input().split())) for i in range(n)]
W = [w for w, v in WV]
V = [v for w, v in WV]
DP = [[0 for j in range(m+1)] for i in range(n+1)]
for i in range(1, n+1):
for j in range(W[i-1]):
DP[i][j] = DP[i-1][j]
for j in range(W[i-1], m+1):
... | p03163 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4
1 2 3 5
output:
30
"""
import sys
from functools import reduce
def gcd(x, y):
if x < y:
x, y = y, x
while y > 0:
r = x % y
x = y
y = r
return x
def lcm(a, b):
return a * b // ... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4
1 2 3 5
output:
30
"""
import sys
from functools import reduce
def gcd(x, y):
if x < y:
x, y = y, x
while y > 0:
r = x % y
x = y
y = r
return x
def lcm(a, b):
return a * b // ... | p02469 |
eval(input())
a=list(map(int,input().split()))
m=max(a)
i,f=1,0
while i:
for j in a:
if (m*i)%j:break
if j==a[-1]: f=1
if f:break
i+=1
print((m*i)) | def gcd(a,b):
while b:a,b=b,a%b
return a
def lcm(a,b):
return a//gcd(a,b)*b
eval(input())
a=list(map(int,input().split()))
b=1
for i in a:
b=lcm(b,i)
print(b) | p02469 |
import sys
n = int(sys.stdin.readline())
s = sys.stdin.readline()
def count(s, idx):
w = s.count("W", 0, idx)
e = s.count("E", idx + 1)
return w + e
m = count(s, 0)
j = 0
for i in range(1, len(s)):
m2 = count(s, i)
if m2 < m:
m = m2
j = i
print(m)
| import sys
n = int(sys.stdin.readline())
s = list(sys.stdin.readline())
it = s[0]
w = 0
e = s[1:].count('E')
m = e
j = 0
for i in range(1, len(s)):
if it == 'W':
w = w + 1
it = s[i]
if it == 'E':
e = e - 1
m2 = w + e
if m2 < m:
m = m2
j = i
print(m)
| p03341 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product
... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product
... | p03341 |
_, s = open(0).read().split()
left, right = [0], []
lw, re = 0, 0
for i in s:
if i == 'W':
lw += 1
left += [lw]
for i in s[::-1]:
if i == 'E':
re += 1
right += [re]
print((min(i + j for i, j in zip(left[:-1], right[-2::-1] + [0])))) | def main():
_, s = open(0).read().split()
w, res = 0, 0
for i in s:
if i == 'W':
w += 1
elif w:
w -= 1
res += 1
else:
pass
return res
if __name__ == '__main__':
print((main())) | p03341 |
N,M=list(map(int,input().split()))
n=[list(map(int,input().split())) for _ in range(N)]
m=[list(map(int,input().split())) for _ in range(M)]
result=[]
for i in range(len(n)):
result=[]
for j in range(len(m)):
result.append(abs(n[i][0]-m[j][0])+abs(n[i][1]-m[j][1]))
print((result.index(min(result))+1)) | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]
cd=[list(map(int,input().split())) for _ in range(m)]
r=[]
for i in ab:
x1,y1=i[0],i[1]
temp=[]
for j in cd:
x2,y2=j[0],j[1]
temp.append(abs(x1-x2)+abs(y1-y2))
r.append(temp.index(min(temp))+1)
print(*r,sep='\n... | p03774 |
n,m=list(map(int,input().split()))
a=[]
b=[]
c=[]
d=[]
for i in range(n):
A,B=list(map(int,input().split()))
a.append(A)
b.append(B)
for i in range(m):
C,D=list(map(int,input().split()))
c.append(C)
d.append(D)
for i in range(n):
minimum=1000000000
ans=0
for j in range(m):
if abs(... | n,m=list(map(int,input().split()))
a=[]
b=[]
for i in range(n):
x,y=list(map(int,input().split()))
a.append([x,y])
for i in range(m):
x,y=list(map(int,input().split()))
b.append([x,y])
for i in a:
ans=10**18
t=0
for j in range(m):
if abs(i[0]-b[j][0])+abs(i[1]-b[j][1])<ans:
t=j+1
... | p03774 |
def manhattan_distance(s, c):
return abs(s[0]-c[0]) + abs(s[1]-c[1])
def main():
n, m = list(map(int, input().split()))
student = []
for _ in range(n):
a, b = list(map(int, input().split()))
student.append([a, b])
checkpoint = []
for _ in range(m):
c, d ... | def man_dis(s, c):
return abs(s[0]-c[0])+abs(s[1]-c[1])
def main():
n, m = list(map(int, input().split()))
s_list = [list(map(int, input().split())) for _ in range(n)]
c_list = [list(map(int, input().split())) for _ in range(m)]
for s in s_list:
minv = 1000000000
for i,... | p03774 |
n,m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
s = 0
t = float('inf')
for j in range(m):
p = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
if p < t:
s = j+1
... | n,m = list(map(int, input().split()))
ab = []
for _ in range(n):
a,b = list(map(int, input().split()))
ab.append((a,b))
cd = []
for _ in range(m):
c,d = list(map(int, input().split()))
cd.append((c,d))
for i in ab:
s = float("inf")
for j in range(m):
t = abs(i[0]-cd[j][0]) + abs(i[1]-cd[... | p03774 |
n,m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
p = [float("INF")] * n
check = [""]*n
for i in range(n):
for j in range(m):
if abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1]) < p[i]:
p... | n,m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
cd = [list(map(int, input().split())) for _ in range(m)]
for a,b in ab:
ans = []
for c,d in cd:
ans.append(abs(a-c)+abs(b-d))
print((ans.index(min(ans))+1)) | p03774 |
n, m = (int(i) for i in input().split())
ab = [[int(i) for i in input().split()] for j in range(n)]
cd = [[int(i) for i in input().split()] for j in range(m)]
for i in range(n):
d_min = 1000000000
p_num = 0
for j in range(m):
cur_d = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
... | def main():
N, M = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
CD = [[int(i) for i in input().split()] for j in range(M)]
for a, b in AB:
cur = 10**12
cur_ans = -1
for i, cd in enumerate(CD):
if cur > abs(a-cd... | p03774 |
def main():
N, M = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
CD = [[int(i) for i in input().split()] for j in range(M)]
for a, b in AB:
cur = 10**12
cur_ans = -1
for i, cd in enumerate(CD):
if cur > abs(a-cd... | def main():
import sys
input = sys.stdin.buffer.readline
N, M = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
CD = [[int(i) for i in input().split()] for j in range(M)]
for a, b in AB:
mi = 10**20
ans = -1
for i, p i... | p03774 |
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(n)]
cd = [list(map(int,input().split())) for _ in range(m)]
ans = [0]*n
for i in range(n):
count = 10**9
for j in range(m):
ch = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
#print("i =",i,"j=... | n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(n)]
cd = [list(map(int,input().split())) for _ in range(m)]
ans = [0]*n
for i in range(n):
count = 10**9
for j in range(m):
ch = abs(ab[i][0] - cd[j][0]) + abs(ab[i][1] - cd[j][1])
if ch < count:
... | p03774 |
n, m = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(n)]
CD = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
a, b = AB[i]
res = float("inf")
for j in range(m):
c, d = CD[j]
dist = abs(a - c) + abs(b - d)
if res... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(n)]
CD = [list(map(int, input().split())) for _ in range(m)]
for a, b in... | p03774 |
N, M = list(map(int, input().split()))
ab = [[int(i) for i in input().split()] for i in range(N)]
cd = []
for i in range(M):
c, d = list(map(int, input().split()))
cd.append([c, d, i])
ans = []
for a, b in ab:
dis = float('inf')
num = 0
for c, d, i in cd:
if (abs(c-a) + abs(b-d)... | N, M = list(map(int, input().split()))
ab = [[int(i) for i in input().split()] for i in range(N)]
cd = [[int(i) for i in input().split()] for i in range(M)]
ans = []
for a, b in ab:
num = float('inf')
for i in range(M):
if num > abs(a - cd[i][0]) + abs(b - cd[i][1]):
num = abs(a ... | p03774 |
n,m = list(map(int,input().split()))
x = [list(map(int,input().split())) for i in range(n)]
y = [list(map(int,input().split())) for i in range(m)]
for a,b in x:
l = [abs(a-c)+abs(b-d) for c,d in y]
print((l.index(min(l))+1)) | n,m = list(map(int,input().split()))
x = [list(map(int,input().split())) for i in [0]*(n+m)]
for a,b in x[:n]:
l = [abs(a-c)+abs(b-d) for c,d in x[n:]]
print((l.index(min(l))+1)) | p03774 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.