s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s844099402 | p03732 | u829859091 | 1575772832 | Python | Python (3.4.3) | py | Runtime Error | 1765 | 1974388 | 369 | N, W = map(int, input().split())
w, v = [], []
for i in range(N):
wi, vi = map(int, input().split())
w.append(wi)
v.append(vi)
dp = [[0]*(W+1) for i in range(N+1)]
for i in range(N):
for j in range(W+1):
if w[i] > j:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = max... |
s304835051 | p03732 | u134712256 | 1574967033 | Python | Python (3.4.3) | py | Runtime Error | 2129 | 346080 | 397 | import numpy as np
N,W = map(int,input().split())
wv = []
for i in range(N):
x,y = map(int,input().split())
wv.append([x,y])
print(wv)
dp = [[0 for i in range(N+10)]for j in range(W+10)]
for i in range(1,N+1):
for wi in range(1,W+1):
if wi>=wv[i-1][0]:
dp[i][wi] = max(dp[i-1][wi-wv[i-1][0]]+wv[i-... |
s336439630 | p03732 | u134712256 | 1574894454 | Python | Python (3.4.3) | py | Runtime Error | 2128 | 400884 | 381 | N,W = map(int,input().split())
w = []
v = []
for i in range(N):
x,y = [int(i) for i in input().split()]
w.append(x)
v.append(y)
dp = [[0 for i in range(N+1000)]for j in range(W+1000)]
for i in range(1,N+1):
for wi in range(1,W+1):
if wi>=w[i-1]:
dp[i][wi] = max(dp[i-1][wi-w[i-1]]+v[i-1],dp[i-1][wi... |
s379355231 | p03732 | u134712256 | 1574894342 | Python | Python (3.4.3) | py | Runtime Error | 2126 | 348660 | 377 | N,W = map(int,input().split())
w = []
v = []
for i in range(N):
x,y = [int(i) for i in input().split()]
w.append(x)
v.append(y)
dp = [[0 for i in range(N+10)]for j in range(W+10)]
for i in range(1,N+1):
for wi in range(1,W+1):
if wi>=w[i-1]:
dp[i][wi] = max(dp[i-1][wi-w[i-1]]+v[i-1],dp[i-1][wi])
... |
s971865281 | p03732 | u256464928 | 1574137297 | Python | Python (3.4.3) | py | Runtime Error | 2138 | 565364 | 376 | #ABC060D
N, W = map(int,input().split())
WV = [list(map(int,input().split())) for _ in range(N)]
dp = [[0] * (N+10) for _ in range(W+10)]
#DPループ
for i in range(N):
for w in range(W+1):
if w >= WV[i][0]:
dp[i+1][w] = max(dp[i][w-WV[i][0]] + WV[i][1],dp[i][w])
else:
dp[i+1][w]... |
s801547331 | p03732 | u673361376 | 1573698574 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 559 | N,W = map(int,input().split())
w1,v1 = map(int,input().split())
items = {w: [] for w in range(w1,w1+3)}
items[w1].append(v1)
for _ in range(N-1):
w,v = map(int,input().split())
items[w].append(v)
lens = {}
for key in sorted(items.keys()):
items[key].sort(reverse=True)
lens[key] = len(items[key])
ans = -float(... |
s530280090 | p03732 | u753803401 | 1573443962 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38384 | 593 | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n, w = list(map(int, readline().split()))
wv = [list(map(int, readline().split())) for _ in range(n)]
if wv[0][0] > w:
print(0)
else:
dp = [0] * (10 * 3)
dp[0] = wv[0][1]
for i in ran... |
s227230873 | p03732 | u254871849 | 1572635109 | Python | Python (3.4.3) | py | Runtime Error | 2127 | 1974388 | 422 | n, W = [int(x) for x in input().split()]
weight = []
value = []
for i in range(n):
wi, vi = [int(x) for x in input().split()]
weight.append(wi)
value.append(vi)
dp = [[0] * (W+1)] * (n+1)
for i in range(n):
for w in range(W+1):
if w >= weight[i]:
dp[i+1][w] = max(dp[i][w - weight[i... |
s759784591 | p03732 | u042802884 | 1572157748 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2106 | 42200 | 1543 | from collections import deque
N,W=map(int,input().split())
a=[];b=[];c=[];d=[]
w1,v=map(int,input().split())
w2=w1+1;w3=w2+1;w4=w3+1
a.append(v)
for i in range(N-1):
w,v=map(int,input().split())
if w==w1:
a.append(v)
elif w==w2:
b.append(v)
elif w==w3:
c.append(v)
elif w==w4... |
s213540175 | p03732 | u760767494 | 1571181012 | Python | Python (3.4.3) | py | Runtime Error | 1468 | 16860 | 392 | import numpy as np
n, w = map(int, input().split())
l = []
for i in range(n):
l.append(list(map(int, input().split())))
# print(l)
dp = np.zeros((n + 1, w + 1))
for i in range(n):
for w in range(w + 1):
if w >= l[i][0]:
dp[i + 1][w] = max(dp[i][w], dp[i][w - l[i][0]] + l[i][1])
el... |
s569632235 | p03732 | u367130284 | 1570518154 | Python | Python (3.4.3) | py | Runtime Error | 39 | 5304 | 1097 | #from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations... |
s783272520 | p03732 | u736729525 | 1568352052 | Python | Python (3.4.3) | py | Runtime Error | 1902 | 1974388 | 416 | N, W = map(int, input().split())
WV = [0]*N
for i in range(N):
w, v = map(int, input().split())
WV[i] = w, v
#WV.sort()
dp = [[0]*(W+1) for i in range(N+1)]
for c in range(1, N+1):
wv = WV[c-1]
for w in range(W+1):
if w < wv[0]:
dp[c][w] = dp[c-1][w]
else:
dp[c][w] = max(dp[c-1][w -wv[0]]... |
s041644685 | p03732 | u736729525 | 1568352016 | Python | Python (3.4.3) | py | Runtime Error | 1875 | 1974388 | 416 | N, W = map(int, input().split())
WV = [0]*N
for i in range(N):
w, v = map(int, input().split())
WV[i] = w, v
#WV.sort()
dp = [[0]*(W+1) for i in range(N+1)]
for c in range(1, N+1):
wv = WV[c-1]
for w in range(W+1):
if w < wv[0]:
dp[c][w] = dp[c-1][w]
else:
dp[c][w] = max(dp[c-1][w -wv[0]]... |
s291653533 | p03732 | u670180528 | 1568255503 | Python | Python (3.4.3) | py | Runtime Error | 2127 | 1880436 | 388 | N,W,*l = map(int,open(0).read().split())
wl = l[::2]
vl = l[1::2]
M = N*max(vl)
INF = float("inf")
dp = [[INF]*(M+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
w,v = wl[i],vl[i]
for j in range(M+1):
if j >= v:
dp[i+1][j] = min(dp[i][j],dp[i][j-v]+w)
else:
dp[i+1][j] = dp[i][j]
ans=0
for val,wei ... |
s233039818 | p03732 | u480138356 | 1568207503 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38256 | 1360 | import sys
import numpy as np
input = sys.stdin.readline
def main():
N, W = map(int, input().split())
wv = [list(map(int, input().split())) for i in range(N)]
base_w = wv[0][0]
dic = {wv[0][0]:[], wv[0][0]+1:[], wv[0][0]+2:[], wv[0][0]+3:[]}
for i in range(N):
w, v = wv[i]
dic[w].a... |
s453331953 | p03732 | u480138356 | 1568204642 | Python | Python (3.4.3) | py | Runtime Error | 163 | 15844 | 470 | import sys
import numpy as np
input = sys.stdin.readline
def main():
N, W = map(int, input().split())
wv = [list(map(int, input().split())) for i in range(N)]
MAX_ = (wv[0][0] + 3) * N
dp = np.zeros((N+1, min(W, MAX_) + 1), dtype=int)
for i in range(1, N+1):
w, v = wv[i-1]
dp[i] ... |
s818329338 | p03732 | u800258529 | 1568157481 | Python | Python (3.4.3) | py | Runtime Error | 2127 | 2086260 | 169 | n,W=map(int,input().split())
dp=[0]*(W+1)
for _ in [0]*n:
w,v=map(int,input().split())
for i in range(W,w-1,-1):
dp[i]=max(dp[i],dp[i-w]+v)
print(dp[-1]) |
s721619871 | p03732 | u499381410 | 1567037995 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2111 | 2006424 | 939 | from collections import defaultdict, deque
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate
import sys
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LIM(): return list(map(l... |
s302010716 | p03732 | u723590269 | 1567009534 | Python | Python (3.4.3) | py | Runtime Error | 2123 | 531736 | 596 | N,W = map(int,input().split())
w = [-1 for i in range(N)]
v = [-1 for i in range(N)]
for i in range(N):
w[i],v[i] = map(int,input().split())
dp = [[0 for i in range(W+1)] for j in range(N)]
#荷物を1つだけ入れた状態で、各許容重量の最大値を初期値として持たせる
for i in range(N):
dp[i][w[i]] = v[i]
for i in range(1,N):
for j in range... |
s033329801 | p03732 | u723590269 | 1566995239 | Python | Python (3.4.3) | py | Runtime Error | 2137 | 528560 | 600 | N,W = map(int,input().split())
w = [-1 for i in range(N)]
v = [-1 for i in range(N)]
for i in range(N):
w[i],v[i] = map(int,input().split())
dp = [[0 for i in range(W+1)] for j in range(N)]
#荷物を1つだけ入れた状態で、各許容重量の最大値を初期値として持たせる
for i in range(w[0],W+1):
dp[0][i] = v[0]
for i in range(1,N):
for k in r... |
s370282969 | p03732 | u423585790 | 1566226218 | Python | PyPy3 (2.4.0) | py | Runtime Error | 230 | 45532 | 2246 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): re... |
s071560371 | p03732 | u423585790 | 1566223889 | Python | PyPy3 (2.4.0) | py | Runtime Error | 254 | 46448 | 2148 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): re... |
s382947541 | p03732 | u423585790 | 1566223876 | Python | PyPy3 (2.4.0) | py | Runtime Error | 240 | 46448 | 2144 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): re... |
s617080507 | p03732 | u472065247 | 1565834522 | Python | Python (3.4.3) | py | Runtime Error | 1986 | 1974388 | 412 | import sys
sys.setrecursionlimit(10**9)
N, WW = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(N)]
W, V = zip(*l)
M = [[-1] * (WW + 1) for i in range(N + 1)]
def cal(i, w):
if M[i][w] >= 0:
return M[i][w]
if i == N:
v = 0
elif w < W[i]:
v = cal(i + 1, w)
else:
v =... |
s242773008 | p03732 | u472065247 | 1565834450 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 413 | import sys
sys.setrecursionlimit(10**11)
N, WW = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(N)]
W, V = zip(*l)
M = [[-1] * (WW + 1) for i in range(N + 1)]
def cal(i, w):
if M[i][w] >= 0:
return M[i][w]
if i == N:
v = 0
elif w < W[i]:
v = cal(i + 1, w)
else:
v ... |
s568037665 | p03732 | u472065247 | 1565834318 | Python | Python (3.4.3) | py | Runtime Error | 1744 | 1974388 | 371 | N, WW = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(N)]
W, V = zip(*l)
M = [[-1] * (WW + 1) for i in range(N + 1)]
def cal(i, w):
if M[i][w] >= 0:
return M[i][w]
if i == N:
v = 0
elif w < W[i]:
v = cal(i + 1, w)
else:
v = max(cal(i + 1, w), cal(i + 1, w - W[i]) ... |
s359740916 | p03732 | u511965386 | 1565531557 | Python | PyPy3 (2.4.0) | py | Runtime Error | 193 | 44016 | 893 | import sys
input = sys.stdin.readline
N, W = map(int, input().split())
wv = [[int(i) for i in input().split()] for _ in range(N)]
wv.sort()
s, t = 0, 0
ns, nt = 0, 0
for i in range(N) :
if s + wv[i][0] <= W :
s += wv[i][0]
ns += 1
else :
break
for i in range(N-1, -1, -1) :
if t + w... |
s704666128 | p03732 | u511965386 | 1565529638 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1371 | 2004124 | 403 | import sys
input = sys.stdin.readline
N, W = map(int, input().split())
wv = [[int(i) for i in input().split()] for _ in range(N)]
dp = [[0] * (W + 1) for _ in range(N + 1)]
for i in range(1, N + 1) :
w, v = wv[i-1]
for j in range(W+1) :
if j < w :
dp[i][j] = dp[i-1][j]
else :
... |
s884986554 | p03732 | u761989513 | 1565055705 | Python | Python (3.4.3) | py | Runtime Error | 1738 | 1974388 | 495 | n, W = map(int, input().split())
w = []
v = []
for i in range(n):
w_, v_ = map(int, input().split())
w.append(w_)
v.append(v_)
if sum(w) <= W:
print(sum(v))
else:
dp = [[0] * (W + 1) for i in range(n + 1)] # DP テーブル
for i in range(n - 1, -1, -1):
for j in range(w[0], W + 1):
... |
s959138129 | p03732 | u761989513 | 1565055520 | Python | Python (3.4.3) | py | Runtime Error | 1764 | 1974388 | 423 | n, W = map(int, input().split())
w = []
v = []
for i in range(n):
w_, v_ = map(int, input().split())
w.append(w_)
v.append(v_)
dp = [[0] * (W + 1) for i in range(n + 1)] # DP テーブル
for i in range(n - 1, -1, -1):
for j in range(w[0], W + 1):
if j < w[i]:
dp[i][j] = dp[i + 1][j]
... |
s769344754 | p03732 | u138253748 | 1564713354 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2362 | #[macro_use]
mod input {
use std;
use std::io;
const SPLIT_DELIMITER: char = ' ';
#[macro_export]
#[allow(unused_macros)]
macro_rules! input {
( $($x:expr ),*) => {
{
let temp_str = input_line_str();
let mut split_result_iter = temp_str.split_whitespace();
$(
... |
s394580981 | p03732 | u584174687 | 1563145353 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 2630 |
def main():
num, max_weigh = map(int, input().split())
data = [list(map(int, input().split())) for i in range(num)]
kosuu = [0, 0, 0, 0]
start_weigh = data[0][0]
for i in range(num):
weigh, value = data[i]
kosuu[weigh - start_weigh] += 1
data.sort(key=lambda x: (x[0], -x[1]))... |
s972776777 | p03732 | u584174687 | 1563130278 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 312 |
import numpy as np
import sys
input = sys.stdin.readline
N, W = map(int, input().split())
dp = np.full(N * 1000 + 1, 10 ** 10, dtype=np.int64)
dp[0] = 0
for _ in range(N):
w, v = map(int, input().split())
np.minimum(dp[:-v] + w, dp[v:], out=dp[v:])
print(((dp <= W) * np.arange(N * 1000 + 1)).max())
|
s155226429 | p03732 | u211160392 | 1561262704 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1145 | 2004124 | 325 | N,W = map(int,input().split())
wv = list(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):
w,v = wv[i]
for j in range(1,W+1):
if w > j:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = max(dp[i][j],dp[i][j-w]+v)
print(dp[-1]... |
s761402286 | p03732 | u211160392 | 1561261821 | Python | Python (3.4.3) | py | Runtime Error | 1687 | 1974388 | 325 | N,W = map(int,input().split())
wv = list(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):
w,v = wv[i]
for j in range(1,W+1):
if w > j:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = max(dp[i][j],dp[i][j-w]+v)
print(dp[-1]... |
s593615140 | p03732 | u191829404 | 1560523687 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 38384 | 1747 | import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq)... |
s122959795 | p03732 | u928784113 | 1560478591 | Python | Python (3.4.3) | py | Runtime Error | 1711 | 1974388 | 517 | N,W = map(int,input().split())
wv = [list(map(int,input().split())) for _ in range(N)]
w = [wv[i][0] for i in range(N)]
v = [wv[i][1] for i in range(N)]
dp = [[0]*(W+1) for _ in range(N+1)] #dp[i][j]...i番目以降の品物から重さの総和がj以下となるように選んだ時の価値の総和の最大値
for i in reversed(range(N)):
for j in range(W+1):
if w[i] > j:
... |
s786399454 | p03732 | u191829404 | 1560450426 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1767 | 2004124 | 1525 | import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq)... |
s042069452 | p03732 | u796060588 | 1557639560 | Python | PyPy3 (2.4.0) | py | Runtime Error | 262 | 56536 | 1228 | import sys
input = sys.stdin.readline
def main():
print(search_with_memo(0, W))
def search_with_memo(i, rest):
if memo[i][rest] != None:
return memo[i][rest]
if i == N:
return 0
elif rest < items[i].w:
through = search_with_memo(i + 1, rest)
memo[i+1][rest] = through... |
s673353102 | p03732 | u796060588 | 1557639047 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2113 | 2004380 | 1266 | import sys
input = sys.stdin.readline
def main():
#print(all_search(0, W))
print(search_with_memo(0, W))
def search_with_memo(i, rest):
if memo[i][rest] != None:
return memo[i][rest]
if i == N:
return 0
elif rest < items[i].w:
through = search_with_memo(i+1, rest) # thr... |
s552961283 | p03732 | u367130284 | 1556787317 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 212276 | 174 | from numpy import*
N,W=map(int, input().split())
dp=zeros(W+1)
for i in range(N):
w,v=map(int, input().split())
dp[w:]=maximum(dp[w:], dp[:-w]+v)
print(int(max(dp)))
|
s378235685 | p03732 | u367130284 | 1556787302 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 38256 | 174 | from numpy import*
N,W=map(int, input().split())
dp=zeros(W+1)
for i in range(N):
w,v=map(int, input().split())
dp[w:]=maximum(dp[w:], dp[:-w]+v)
print(int(max(dp)))
|
s914268464 | p03732 | u367130284 | 1555527410 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 209 | N,W=map(int,input().split())
2.dp=[0]*(W+1)
3.for i in range(N):
4. w,v=map(int,input().split())
5. for p,q in enumerate(dp):
6. if p+w<=W:
7. dp[p+w]=max(dp[p+w],q+v)
8.print(max(dp))
|
s734614197 | p03732 | u367130284 | 1555527188 | Python | Python (3.4.3) | py | Runtime Error | 2126 | 1974388 | 201 | N,W=map(int,input().split())
dp=[0]*(W+1)
for i in range(N):
w,v=map(int,input().split())
for p,q in enumerate(dp.copy()):
if p+w<=W:
dp[p+w]=max(dp[p+w],q+v)
print(max(dp)) |
s973592019 | p03732 | u619819312 | 1554857775 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 258 | from collections import defaultdict as d
s=d(int)
s[0]=0
n,w=map(int,input().split())
for i in range(n):
q,v=map(int,input().split())
c=s.copy()
for p,r in c.items():
if p+q<=w:
s[p+q]=max(c[p+q],c[p]+v)
print(max(s.values())) |
s679385740 | p03732 | u319818856 | 1554156925 | Python | Python (3.4.3) | py | Runtime Error | 2070 | 1974388 | 643 | def simple_knapsack(N: int, W: int, items: list) -> int:
# dp[n][w] は n~N 番目の品物を利用して重さが w 以下となるときの
# 最大価値
dp = [[0] * (W+1) for _ in range(N+1)]
for i, (iw, iv) in enumerate(items):
for w in range(W+1):
if w < iw:
dp[N-i-1][w] = dp[N-i][w]
else:
... |
s377537034 | p03732 | u983918956 | 1554065586 | Python | Python (3.4.3) | py | Runtime Error | 2114 | 117628 | 951 | import sys
input = sys.stdin.readline
def main():
N,W = map(int,input().split())
info = []
for i in range(N):
w,v = map(int,input().split())
if i == 0:
w1 = w
w = w - (w1-1)
info.append((w,v))
# dp[i][j][k]
# dp[i][j][k] = max(dp[i-1][j][k],dp[i-1][j-w][k... |
s799770810 | p03732 | u179066965 | 1551310760 | Python | Python (3.4.3) | py | Runtime Error | 1751 | 1974388 | 400 | N,W = map(int, input().split())
weight=[]
values=[]
for idx in range(N):
w, v = map(int, input().split())
weight.append(w)
values.append(v)
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(N):
for j in range(W):
if weight[i]<=j+1:
dp[i+1][j+1] = max(dp[i][j+1-weight[i]]+values[i],d... |
s005544893 | p03732 | u476418095 | 1548708701 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 91 | a,b,c = input().split()
if a[-1]==b[0] and b[-1]==c[0]:
print("YES")
else:
print("NO")
|
s736863716 | p03732 | u513081876 | 1548300705 | Python | Python (3.4.3) | py | Runtime Error | 2060 | 1974388 | 334 | N, W = map(int, input().split())
wv = [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 j in range(1, W + 1):
dp[i+1][j] = dp[i][j]
if 0 <= j - wv[i][0] <= W:
dp[i+1][j] = max(dp[i][j], dp[i][j - wv[i][0]] + wv[i][1])
pri... |
s685591916 | p03732 | u123756661 | 1542956368 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 871 | n,w=map(int,input().split())
d={}
p=0
ans=[0,0]
u=[[] for i in range(4)]
for i in range(n):
a,b=map(int,input().split())
if a in d: d[a].append(b)
else:d[a]=[0,b]
p=max(p,a)
for i in range(4):
if p-i in d: d[p-i].sort()
else: d[p-i]=[0]
for x in range(4):
if len(d[p-x])*(p-x)+ans[0]<=w:
... |
s753570750 | p03732 | u426108351 | 1540931241 | Python | PyPy3 (2.4.0) | py | Runtime Error | 371 | 71772 | 841 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+10)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
fo... |
s382022517 | p03732 | u426108351 | 1540931219 | Python | PyPy3 (2.4.0) | py | Runtime Error | 369 | 71772 | 841 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+10)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
fo... |
s208963628 | p03732 | u426108351 | 1540931170 | Python | PyPy3 (2.4.0) | py | Runtime Error | 431 | 77148 | 841 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+10)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
fo... |
s262339383 | p03732 | u426108351 | 1540929099 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38256 | 758 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+10)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
fo... |
s824488812 | p03732 | u426108351 | 1540928964 | Python | PyPy3 (2.4.0) | py | Runtime Error | 370 | 72796 | 736 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+10)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
fo... |
s166632206 | p03732 | u426108351 | 1540928644 | Python | PyPy3 (2.4.0) | py | Runtime Error | 394 | 71900 | 735 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+4)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
for... |
s357548646 | p03732 | u426108351 | 1540928454 | Python | Python (3.4.3) | py | Runtime Error | 2112 | 73796 | 735 | N, W = map(int, input().split())
w = []
v = []
for i in range(N):
a, b = map(int, input().split())
w.append(a)
v.append(b)
w_adjust = []
for i in range(N):
w_adjust.append(w[i]-w[0])
a = w[0]
dp = [[[0 for i in range(N+1)] for j in range(N*3+4)] for k in range(N+1)]
#i個目までの物のうちk個選んで重さの和がjになる中での最大価値
for... |
s837203513 | p03732 | u201234972 | 1537588136 | Python | Python (3.4.3) | py | Runtime Error | 2126 | 2051572 | 245 | N, W = map( int, input().split())
dp = [0]*(W+1)
for _ in range(N):
w, v = map( int, input().split())
for i in range(W,-1,-1):
if i >= w:
dp[i] = max( dp[i], dp[i-w]+v)
else:
continue
print(dp[-1]) |
s171363691 | p03732 | u255280439 | 1537216940 | Python | Python (3.4.3) | py | Runtime Error | 1772 | 1976072 | 3571 | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in inspect.currentframe().f_back.f_locals.items()
}
print(', '.join(
name... |
s487953409 | p03732 | u255280439 | 1537216090 | Python | Python (3.4.3) | py | Runtime Error | 1819 | 1976012 | 3556 | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in inspect.currentframe().f_back.f_locals.items()
}
print(', '.join(
name... |
s789141904 | p03732 | u631277801 | 1536861982 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 1730 | #import sys
#stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return l... |
s411041102 | p03732 | u826263061 | 1536528480 | Python | Python (3.4.3) | py | Runtime Error | 1871 | 1974388 | 390 | n, wm = list(map(int, input().split()))
w = []
v = []
for i in range(n):
vw = list(map(int, input().split()))
w.append(vw[0])
v.append(vw[1])
dp = [[0]*(wm+1) for _ in range(n+1)]
for i in range(n):
for j in range(wm+1):
if j >= w[i]:
dp[i+1][j] = max([dp[i][j], dp[i][j-w[i]]+v... |
s815055677 | p03732 | u457901067 | 1536245691 | Python | Python (3.4.3) | py | Runtime Error | 2141 | 1974388 | 475 | N, W = map(int, input().split())
P = []
for i in range(N):
P.append(list(map(int, input().split())))
#dp[i][w] : i番目までの品物で、wの重みでできる最大の価値. 1-indexed
dp = [[0] * (W+1) for i in range(N+1)]
for i in range(1,N+1):
weight = P[i-1][0]
value = P[i-1][1]
for j in range(W+1):
if j - weight >= 0:
dp[i][j] = ... |
s694256501 | p03732 | u334712262 | 1533978396 | Python | Python (3.4.3) | py | Runtime Error | 364 | 14088 | 2027 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from pprint import pprint
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_r... |
s364666811 | p03732 | u588341295 | 1531969042 | Python | Python (3.4.3) | py | Runtime Error | 63 | 3608 | 832 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * (3*(N-1)+100) for i in range(N+1)]
# 答えが明らかな範囲はDPに含めない
if W < wN[0]:
print(0)
exit()
elif W >= sum(wN):
print(sum(vN))
exit()
#... |
s458477021 | p03732 | u588341295 | 1531968964 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 836 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * (3*(N-1)+1)+100 for i in range(N+1)]
# 答えが明らかな範囲はDPに含めない
if W < wN[0]:
print(0)
exit()
elif W >= sum(wN):
print(sum(vN))
exit()
... |
s518329122 | p03732 | u588341295 | 1531968863 | Python | Python (3.4.3) | py | Runtime Error | 2111 | 91432 | 836 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * (3*(N-1)+1)*100 for i in range(N+1)]
# 答えが明らかな範囲はDPに含めない
if W < wN[0]:
print(0)
exit()
elif W >= sum(wN):
print(sum(vN))
exit()
... |
s394390219 | p03732 | u588341295 | 1531968189 | Python | Python (3.4.3) | py | Runtime Error | 50 | 3444 | 826 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * (3*(N-1)+1) for i in range(N+1)]
# 答えが明らかな範囲はDPに含めない
if W < wN[0]:
print(0)
exit()
elif W >= sum(wN):
print(sum(vN))
exit()
# w... |
s391472959 | p03732 | u588341295 | 1531966652 | Python | Python (3.4.3) | py | Runtime Error | 2116 | 1908084 | 782 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * (wN[0]+3)*N for i in range(N+1)]
if W < wN[0]:
print(0)
exit()
elif W >= (wN[0]+3)*N:
print(sum(vN))
exit()
# wNの範囲はかなり限定されているの... |
s179938158 | p03732 | u588341295 | 1531965832 | Python | Python (3.4.3) | py | Runtime Error | 2114 | 1908084 | 771 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * (wN[0]+3)*N for i in range(N+1)]
if W < wN[0]:
print(0)
exit()
elif W >= (wN[0]+3)*N:
print(sum(vN))
# wNの範囲はかなり限定されているので、オフセットを用意
... |
s820341017 | p03732 | u588341295 | 1531965689 | Python | Python (3.4.3) | py | Runtime Error | 2111 | 127616 | 785 | # -*- coding: utf-8 -*-
N,W = map(int, input().split())
wN = []
vN = []
for i in range(N):
w,v = map(int, input().split())
wN.append(w)
vN.append(v)
dp = [[0] * ((wN[0]+3)*N - 3) for i in range(N+1)]
if W < wN[0]:
print(0)
exit()
elif W >= (wN[0]+3)*N - 3:
print(sum(vN))
# wNの範囲はかなり限定されているので... |
s461541268 | p03732 | u904804404 | 1531440463 | Python | Python (3.4.3) | py | Runtime Error | 1760 | 1974388 | 635 | '''
https://beta.atcoder.jp/contests/abc060/tasks/arc073_://beta.atcoder.jp/contests/abc060/tasks/arc073_b
'''
n,w_limit = map(int,input().split(" "))
#n, w_limit = nw[0], nw[1]
item_list = []
for i in range(n):
item_list.append(list(map(int,input().split(" "))))
#dpテーブルの作成
dp = [[0] * (w_limit + 1) for _ in range(... |
s539112872 | p03732 | u904804404 | 1531440279 | Python | Python (3.4.3) | py | Runtime Error | 1761 | 1974388 | 613 | '''
https://beta.atcoder.jp/contests/abc060/tasks/arc073_://beta.atcoder.jp/contests/abc060/tasks/arc073_b
'''
n,w_limit = map(int,input().split(" "))
#n, w_limit = nw[0], nw[1]
item_list = [list(map(int,input().split(" "))) for _ in range(n)]
#dpテーブルの作成
dp = [[0] * (w_limit + 1) for _ in range(n + 1)]
for i in range... |
s326362112 | p03732 | u904804404 | 1531440139 | Python | Python (3.4.3) | py | Runtime Error | 1788 | 1974388 | 615 | '''
https://beta.atcoder.jp/contests/abc060/tasks/arc073_://beta.atcoder.jp/contests/abc060/tasks/arc073_b
'''
n,w_limit = map(int,input().split(" "))
#n, w_limit = nw[0], nw[1]
item_list = [[list(map(int,input().split(" ")))] for _ in range(n)]
#dpテーブルの作成
dp = [[0] * (w_limit + 1) for _ in range(n + 1)]
for i in ran... |
s939638852 | p03732 | u904804404 | 1531438887 | Python | Python (3.4.3) | py | Runtime Error | 1766 | 1974388 | 640 | '''
https://beta.atcoder.jp/contests/abc060/tasks/arc073_://beta.atcoder.jp/contests/abc060/tasks/arc073_b
'''
nw = [int(i) for i in input().split()]
n, w_limit = nw[0], nw[1]
item_list = [[int(i) for i in input().split()] for _ in range(n)]
#dpテーブルの作成
dp = [[0] * (w_limit + 1) for _ in range(n + 1)]
for i in range(1... |
s435169085 | p03732 | u718096172 | 1531438599 | Python | Python (3.4.3) | py | Runtime Error | 1759 | 1974388 | 527 | nw = [int(i) for i in input().split()]
n, w_limit = nw[0], nw[1]
item_list = [[int(i) for i in input().split()] for _ in range(n)]
#dpテーブルの作成
dp = [[0] * (w_limit + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
item_weight = item_list[i - 1][0]
item_value = item_list[i - 1][1]
for w in range(1, w_lim... |
s947531354 | p03732 | u718096172 | 1531414570 | Python | Python (3.4.3) | py | Runtime Error | 1788 | 1974388 | 526 | nw = [int(i) for i in input().split()]
n, w_limit = nw[0], nw[1]
item_list = [[int(i) for i in input().split()] for _ in range(n)]
#dpテーブルの作成
dp = [[0] * (w_limit + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
item_weight = item_list[i - 1][0]
item_value = item_list[i - 1][1]
for w in range(1, w_lim... |
s635567270 | p03732 | u426501657 | 1530313495 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3192 | 1900 | n,m=input().split()
N = int(n)
M = int(m)
w_list = []
v_list = []
w1_values = []
w2_values = []
w3_values = []
w4_values = []
sum_w1_values = []
sum_w2_values = []
sum_w3_values = []
sum_w4_values = []
sum_v1 = 0
sum_v2 = 0
sum_v3 = 0
sum_v4 = 0
for i in range(N):
w,v = input().split()
w = int(w)
v = int(v)
w_list... |
s346257456 | p03732 | u467736898 | 1529515333 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 349 | from collections import defaultdict
N, W = map(int, input().split())
dd = defaultdict(int)
dd[0] = 0
for i in range(N):
w, v = map(int, input().split())
ddOld = dd.copy()
for dk, dv in ddOld.items():
dd[dk+w] = max(ddOld[dk+w], ddOld[dk]+v)
ans = 0
for dk, dv in dd.items():
if dk <= W:
a... |
s964750528 | p03732 | u557171945 | 1521588709 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38640 | 671 | N,W = map(int,input().split())
w_in, v = map(int,input().split())
table = [[] for i in range(4)]
table[0].append(v)
for i in range(N-1):
w, v = map(int,input().split())
table[w-w_in].append(v)
for i in range(N):
table[i].sort(reverse=True)
for j in range(len(table[i])-1):
table[i][j+1] += ta... |
s744402047 | p03732 | u925364229 | 1517678278 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1156 | #include <bits/stdc++.h>
#define REP(i,n) for (long i=0;i<(n);i++)
#define FOR(i,a,b) for (long i=(a);i<(b);i++)
#define RREP(i,n) for(long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl;
#define du... |
s256844633 | p03732 | u764600134 | 1517327592 | Python | Python (3.4.3) | py | Runtime Error | 2130 | 1880812 | 1828 | # -*- coding: utf-8 -*-
"""
https://abc060.contest.atcoder.jp/tasks/arc073_b
01ナップサック問題
Wの上限値が非常に大きいケース(～1e9)。Wを横軸にしてdpテーブルを作成すると非常に大きくなってしまうので、メモリ消費や処理時間が問題になる。
価値に対する重さが最小になるようにdpを計算する
"""
import sys
from sys import stdin
input = stdin.readline
from collections import namedtuple
from operator import itemgetter
from b... |
s618043064 | p03732 | u343675824 | 1517176674 | Python | PyPy3 (2.4.0) | py | Runtime Error | 419 | 42716 | 661 | N, W = map(int, input().split())
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = map(int, input().split())
minW = min(w)
for i in range(N):
w[i] -= minW
MAX_W = 3 * 100
MAX_V = int(1e9)
INF = MAX_V + 2
dp = [[-INF] * (MAX_W + 10) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(MA... |
s228064648 | p03732 | u621935300 | 1516683230 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 8192 | 508 | import heapq
N,W=map(int,raw_input().split())
wv=[]
w_sum=0
for i in range(N):
w,v=map(int,raw_input().split())
w_sum+=w
wv.append((w,v))
a=[ float("-inf") for i in range(w_sum+1) ]
q=[]
for ind_i, i in enumerate(wv):
w=i[0]
v=i[1]
#Initialize
if ind_i==0:
a[0]=0
a[w]=v
continue
#Put queue
for ind_... |
s116237351 | p03732 | u621935300 | 1516682041 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 13568 | 515 | import heapq
N,W=map(int,raw_input().split())
wv=[]
w_sum=0
for i in range(N):
w,v=map(int,raw_input().split())
w_sum+=w
wv.append((w,v))
a=[ float("-inf") for i in range(w_sum*2) ]
i=0
i=1
q=[]
for ind_i, i in enumerate(wv):
w=i[0]
v=i[1]
#Initialize
if ind_i==0:
a[0]=0
a[w]=v
continue
#Put queue
fo... |
s024152417 | p03732 | u621935300 | 1516681792 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 8192 | 516 | import heapq
N,W=map(int,raw_input().split())
wv=[]
w_sum=0
for i in range(N):
w,v=map(int,raw_input().split())
w_sum+=w
wv.append((w,v))
a=[ float("-inf") for i in range(w_sum+1) ]
i=0
i=1
q=[]
for ind_i, i in enumerate(wv):
w=i[0]
v=i[1]
#Initialize
if ind_i==0:
a[0]=0
a[w]=v
continue
#Put queue
fo... |
s786638757 | p03732 | u343675824 | 1515417346 | Python | Python (3.4.3) | py | Runtime Error | 2103 | 4188 | 545 | N, W = map(int, input().split())
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = map(int, input().split())
minW = min(w)
for i in range(N):
w[i] -= minW
INF = int(1e9)
dp = [[-INF] * (3 * N + 1) for i in range(N+1)]
dp[0][0] = 0
ans = 0
for i in range(N):
for j in range(N, 0, -1):
for k i... |
s148277117 | p03732 | u367393577 | 1509220914 | Python | Python (3.4.3) | py | Runtime Error | 2130 | 1974388 | 968 | # coding: utf-8
# Here your code !
import sys
"""
recursionlimit増やす
"""
sys.setrecursionlimit(1000000)
def knapsack(v, w, limit, n):
"""straightforward DP solution
Arguments:
- `v`: list of values
- `w`: list of weights
- `limit`: maximum limit
- `n`: number of items
"""
F = [[0] * (l... |
s169061791 | p03732 | u367393577 | 1509220706 | Python | Python (3.4.3) | py | Runtime Error | 2130 | 1974516 | 1506 | # coding: utf-8
# Here your code !
import sys
"""
recursionlimit増やす
"""
sys.setrecursionlimit(1000000)
def knapsack(v, w, limit, n):
"""straightforward DP solution
Arguments:
- `v`: list of values
- `w`: list of weights
- `limit`: maximum limit
- `n`: number of items
"""
F = [[0] * (l... |
s520731392 | p03732 | u367393577 | 1509220582 | Python | Python (3.4.3) | py | Runtime Error | 1893 | 1974516 | 1587 | # coding: utf-8
# Here your code !
import sys
"""
recursionlimit増やす
"""
sys.setrecursionlimit(1000000)
def knapsack(v, w, limit, n):
"""straightforward DP solution
Arguments:
- `v`: list of values
- `w`: list of weights
- `limit`: maximum limit
- `n`: number of items
"""
F = [[0] * (l... |
s120891385 | p03732 | u367393577 | 1509220538 | Python | Python (3.4.3) | py | Runtime Error | 2004 | 1974516 | 1521 | # coding: utf-8
# Here your code !
def knapsack(v, w, limit, n):
"""straightforward DP solution
Arguments:
- `v`: list of values
- `w`: list of weights
- `limit`: maximum limit
- `n`: number of items
"""
F = [[0] * (limit + 1) for x in range(n + 1)]
for i in range(0, n): ... |
s514478069 | p03732 | u367393577 | 1509220213 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 1693 | # coding: utf-8
# Here your code !
def knapsack(v, w, limit, n):
"""straightforward DP solution
Arguments:
- `v`: list of values
- `w`: list of weights
- `limit`: maximum limit
- `n`: number of items
"""
F = [[0] * (limit + 1) for x in range(n + 1)]
for i in range(0, n): ... |
s975184480 | p03732 | u451017206 | 1501487927 | Python | Python (3.4.3) | py | Runtime Error | 1737 | 1974388 | 381 | N,W = map(int, input().split())
dp = [[None] * (W+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(N):
w, v = map(int, input().split())
for j in range(W):#dp[i]:
if dp[i][j] == None:
continue
if j + w <= W:
dp[i+1][j+w] = max(dp[i][j] + v, dp[i][j+w] or 0)
dp[i... |
s199860556 | p03732 | u846372029 | 1499124677 | Python | Python (3.4.3) | py | Runtime Error | 1730 | 1974388 | 495 | #Simple Knapsack
N,W = list(map(int, input().split()))
w = []
v = []
for i in range(N):
wi,vi = list(map(int, input().split()))
w.append(wi)
v.append(vi)
#メモ化再帰
dp = [[-1]*(W+1) for i in range(N+1)]
def rec(i, j):
if dp[i][j] != -1:
return dp[i][j]
if i == N:
res = 0
elif j < ... |
s734784462 | p03732 | u602860891 | 1497702710 | Python | Python (3.4.3) | py | Runtime Error | 2153 | 2018580 | 536 | N, W = list(map(int, input().split()))
w_list = list()
v_list = list()
for _ in range(N):
w, v = list(map(int, input().split()))
w_list.append(w)
v_list.append(v)
cases = [[0]*(W+1)]
for i_item in range(1, N+1):
case = [0]
w = w_list[i_item-1]
v = v_list[i_item-1]
for i_w in range(1, W+1)... |
s763286007 | p03732 | u004797437 | 1495339793 | Python | Python (3.4.3) | py | Runtime Error | 1868 | 3712 | 629 | import copy
N, W = [int(i) for i in input().split(' ')]
dic = {}
for i in range(N):
new_w, new_v = [int(i) for i in input().split(' ')]
if new_w in dic:
dic[new_w].append(new_v)
else:
dic[new_w] = [new_v]
for key in dic.keys():
dic[new_w].sort(reverse=True)
w = list(dic.keys())
def rec... |
s571870410 | p03732 | u652737716 | 1495215635 | Python | Python (3.4.3) | py | Runtime Error | 2129 | 337268 | 613 |
# input
NW = [int(x) for x in input().split(" ")]
N = NW[0]
W = NW[1]
w = []
v = []
for _ in range(N):
wv = [int(x) for x in input().split(" ")]
w.append(wv[0])
v.append(wv[1])
memo = [[-1 for _ in range(N)] for _ in range(W+1)]
print(memo)
# 品物i-Nまでを使って容量Wのナップサックにいれられる品物の価値の総和の最大値
def rec(i, Wrec):
if i >= N:... |
s233195942 | p03732 | u683479402 | 1494249241 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 365 | # ARC60 D recursive with memorization
dp = [{} for j in range(N+1)]
def rec_dp(i, j):
if(j in dp[i]):
return dp[i][j]
res = 0
if(i == N):
res = 0
elif(j < w[i]):
res = rec_dp(i+1, j)
else:
res = max(rec_dp(i+1, j), rec_dp(i+1, j-w[i]) + v[i])
dp[i][j] = ... |
s272711391 | p03732 | u682181971 | 1494112330 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 763 |
N,W = map(int, input().split())
w=[0 for i in range(N)]
v=[0 for i in range(N)]
Wsum = [0 for i in range(N+1)]
Vsum = [0 for i in range(N+1)]
for i in range(N):
w[i],v[i] = map(int, input().split())
w.insert(0,"0")
v.insert(0,"0")
for i in range(N):
Wsum[i+1] = Wsum[i] + w[i+1]
Vsum[i+1] = Vsum[i] + v[... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.