input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
h,a,*m=open(0)
h,w,k,a,b,f,g=list(map(int,(h+a).split()))
d=[I:=h*w]*I
m+=d,
q=[a:=~w+a*w+b]
d[a]=1
for s in q:
for x in 0,1,2,3:
for z in range(k):
y=0,~z,0,z+1;i,j=s//w+y[x],s%w+y[~x];t=i*w+j;p=d[s]+1
if'.'!=m[i][j]or d[t]<p:break
if d[t]>p:q+=t,;d[t]=p
print((d[~w+f*w+g]%I-1)) | h,a,*m=open(0)
h,w,k,a,b,f,g=list(map(int,(h+a).split()))
d=[I:=h*w]*I
m+=d,
q=[a:=~w+a*w+b]
d[a]=1
for s in q:
for x in 0,1,2,3:
for z in range(k):
y=z+1,0,~z,0;i,j=s//w+y[x],s%w+y[~x];t=i*w+j;p=d[s]+1
if'.'!=m[i][j]or d[t]<p:break
if d[t]>p:q+=t,;d[t]=p
print((d[~w+f*w+g]%I-1)) | p02644 |
import sys
from collections import deque
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
h, w, k = map(int, input().strip().split())
x1, y1, x2, y2 = map(int, input().strip().split())
x1 -= 1
y1 -= 1
x2 -= 1
y2 -= 1
m = []
c... | import sys
from collections import deque
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
h, w, k = map(int, input().strip().split())
x1, y1, x2, y2 = map(int, input().strip().split())
x1 -= 1
y1 -= 1
x2 -= 1
y2 -= 1
m = []
c... | p02644 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import collections
import sys
INF = 10**10
def main(H, W, K, x1, y1, x2, y2, C):
dist = [[INF] * W for _ in range(H)]
q = collections.deque([(x1, y1)])
dist[x1][y1] = 0
while q:
i, j = q.popleft()
d = dist[i][j]
for di, dj... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import collections
import sys
INF = 10**10
def main(H, W, K, x1, y1, x2, y2, C):
dist = [[INF] * W for _ in range(H)]
q = collections.deque([(x1, y1)])
dist[x1][y1] = 0
while q:
i, j = q.popleft()
d = dist[i][j]
for di, dj... | p02644 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from heapq import heappush, heappop
import sys
INF = 10**10
def main(H, W, K, x1, y1, x2, y2, C):
dist = [[INF] * W for _ in range(H)]
q = [(0, x1, y1)]
dist[x1][y1] = 0
while q:
d, i, j = heappop(q)
if dist[i][j] < d: continue
... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from heapq import heappush, heappop
import sys
INF = 10**10
def main(H, W, K, x1, y1, x2, y2, C):
dist = [[INF] * W for _ in range(H)]
q = [(0, x1, y1)]
dist[x1][y1] = 0
while q:
d, i, j = heappop(q)
if dist[i][j] < d: continue
... | p02644 |
import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
H, W, K = list(map(int, rl().split()))
sy, sx, gy, gx = [int(n) - 1 for n in rl().split()]
c = [rl().rstrip() for _ in range(H)]
INF = 10 ** 10
cost = [[INF] * W for _ in... | import sys
from collections import deque
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
H, W, K = list(map(int, rl().split()))
sy, sx, gy, gx = [int(n) - 1 for n in rl().split()]
c = [rl().rstrip() for _ in range(H)]
INF = 10 ** 10
cost = [[INF] * W for _ in... | p02644 |
h,w,k=map(int,input().split())
r,s,t,u=map(lambda x:int(x)-1,input().split())
b=[input()for _ in range(h)]
l=[[-1]*w for _ in range(h)]
l[r][s]=0
from collections import*
d=deque([(r,s)])
while d:
x,y=d.popleft()
if(x==t)&(y==u):exit(print(l[x][y]))
for e,f in [[1,0],[-1,0],[0,-1],[0,1]]:
for i in ... | h,w,k=map(int,input().split())
r,s,t,u=map(lambda x:int(x)-1,input().split())
b=[input()for _ in range(h)]
l=[[-1]*w for _ in range(h)]
l[r][s]=0
from collections import*
d=deque([(r,s)])
while d:
x,y=d.popleft()
if(x==t)&(y==u):exit(print(l[x][y]))
for e,f in[[1,0],[-1,0],[0,-1],[0,1]]:
for i in r... | p02644 |
z,v,a=input,range,print
h,w,k=map(int,z().split())
r,s,t,u=map(lambda x:int(x)-1,z().split())
b=[z()for _ in v(h)]
l=[[-1]*w for _ in v(h)]
l[r][s]=0
from collections import*
d=deque([(r,s)])
while d:
x,y=d.popleft()
if(x==t)&(y==u):exit(a(l[x][y]))
for e,f in[[1,0],[-1,0],[0,-1],[0,1]]:
for i in ... | from collections import*
z,v,a=input,range,print
h,w,k=map(int,z().split());r,s,t,u=map(lambda x:int(x)-1,z().split())
b=[z()for _ in v(h)];l=[[-1]*w for _ in v(h)];l[r][s]=0
d=deque([(r,s)])
while d:
x,y=d.popleft()
if(x==t)&(y==u):exit(a(l[x][y]))
for e,f in[[1,0],[-1,0],[0,-1],[0,1]]:
for i in v(1... | p02644 |
from collections import*
z,v,a=input,range,print
h,w,k=map(int,z().split());r,s,t,u=map(lambda x:int(x)-1,z().split())
b=[z()for _ in v(h)];l=[[-1]*w for _ in v(h)];l[r][s]=0
d=deque([(r,s)])
while d:
x,y=d.popleft()
if(x==t)&(y==u):exit(a(l[x][y]))
for e,f in[[1,0],[-1,0],[0,-1],[0,1]]:
for i in v(1... | from collections import*
z,v,a=input,range,print
h,w,k=map(int,z().split());r,s,t,u=map(lambda x:int(x)-1,z().split())
b=[z()for _ in v(h)];l=[[-1]*w for _ in v(h)];l[r][s]=0
d=deque([(r,s)])
while d:
x,y=d.popleft();j=l[x][y]
if(x==t)&(y==u):exit(a(j))
for e,f in[[1,0],[-1,0],[0,-1],[0,1]]:
for i in... | p02644 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def graph_bfs(source, target, parent):
visited = [False] * vertices
queue = deque()
queue.append(source)
visited[source] = True
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
4 5
0 1 2
0 2 1
1 2 1
1 3 1
2 3 2
output:
3
"""
import sys
from collections import deque
def graph_bfs(source, target, parent):
visited = [False] * vertices
queue = deque()
queue.append(source)
visited[source] = True
... | p02376 |
# Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
adj_mat = [[0] * V for i in range(V)]
for line in file_input:
u, v, c = list(map(int, line.split()))
adj_mat[u][v] = c
# Ford???Fulkerson algorithm
import collections
# BFS for ... | # Acceptance of input
import sys
file_input = sys.stdin
V, E = list(map(int, file_input.readline().split()))
adj_mat = [[0] * V for i in range(V)]
for line in file_input:
u, v, c = list(map(int, line.split()))
adj_mat[u][v] = c
# Ford???Fulkerson algorithm
import collections
# BFS for ... | p02376 |
from collections import deque
class Edge:
def __init__(self, to, rev, cap):
self.to = to
self.rev = rev
self.cap = cap
# 最大流問題を解く O(|E||V|^2)
class Dinic:
def __init__(self, num_of_node: int):
assert num_of_node > 0
self.graph = [list() for _ in range(... | from collections import deque
class Edge:
def __init__(self, to, flow, cap, rev, is_rev):
self.to = to
self.flow = flow
self.cap = cap
self.rev = rev
self.is_rev = is_rev
class Dinic:
def __init__(self, num_of_node: int):
assert num_of_node > 0
... | p02376 |
import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*self._node
... | import sys
from collections import deque
class MaxFlow:
class Edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, node_size, inf):
self._node = node_size
self._inf = inf
self._level = [-1]*self._node
... | p02376 |
from collections import deque
class Dinic:
"""Dinic Algorithm: find max-flow
complexity: O(EV^2)
"""
class edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, V, E, source, sink):
""" V: the number of vertexe... | from collections import deque
class Dinic:
"""Dinic Algorithm: find max-flow
complexity: O(EV^2)
"""
class edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, V, E, source, sink):
""" V: the number of vertexe... | p02376 |
from sys import stdin
from collections import defaultdict
readline = stdin.readline
#readline = open('???.txt').readline
def main():
v, e = list(map(int, readline().split()))
g = defaultdict(list)
residual = [[0] * v for _ in range(v)]
source, sink = 0, v - 1
for _ in range(e):
... | from sys import stdin
from collections import defaultdict
readline = stdin.readline
def main():
v, e = list(map(int, readline().split()))
g = defaultdict(set)
residual = [[0] * v for _ in range(v)]
source, sink = 0, v - 1
for _ in range(e):
s, t, c = list(map(int, readline().s... | p02376 |
#!/usr/bin/env python3
# Based on https://en.wikipedia.org/wiki/Ford???Fulkerson_algorithm
import collections
import sys
import uuid
REC_LIMIT = 10000
class Edge(object):
def __init__(self, source, sink, capacity):
self.source = source
self.sink = sink
self.capacity = c... | #!/usr/bin/env python3
# Based on ...
# https://en.wikipedia.org/wiki/Ford???Fulkerson_algorithm
# http://algoogle.hadrori.jp/algorithm/ford-fulkerson.html
import collections
import sys
REC_LIMIT = 10000
INF = 10 ** 8
class Edge(object):
def __init__(self, source, sink, capacity):
self... | p02376 |
from collections import defaultdict
def dfs(source, sink, flow, connect):
if source == sink:
return flow
used[source] = 1
for i, (target, cost, rev_i) in enumerate(connect[source]):
if not used[target] and cost > 0:
that_flow = dfs(target, sink, min(flow, cost), connect)... | from collections import defaultdict
def bfs(start, end, connect, v_num, flow):
level = [-1] * v_num
level[start] = 0
queue = [start]
while queue:
v = queue.pop()
for next_v in connect[v]:
if flow[v][next_v] > 0 and level[next_v] < 0:
level[next_v] =... | p02376 |
def main():
nvertices, nedges = list(map(int, input().split()))
adj = [[0 for i in range(nvertices)] for j in range(nvertices)]
for i in range(nedges):
u, v, c = list(map(int, input().split()))
adj[u][v] = c
INF = float('inf')
ans = 0
while True:
parents = bfs(... | def main():
nvertices, nedges = list(map(int, input().split()))
adj = [[0] * nvertices for j in range(nvertices)]
for i in range(nedges):
u, v, c = list(map(int, input().split()))
adj[u][v] = c
INF = float('inf')
ans = 0
while True:
parents = bfs(0, nvertices -... | p02376 |
G_MAX = 40*10
N_MAX = 40
INF = float('inf')
dp = [[[INF]*(G_MAX+1) for _ in range(G_MAX+1)]
for _ in range(N_MAX+1)]
N,Ma,Mb = list(map(int, input().split()))
a,b,c = [],[],[]
for _ in range(N):
ai,bi,ci = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
dp[0... | from math import isinf
N, Ma, Mb = list(map(int, input().split()))
a = [0]*N
b = [0]*N
c = [0]*N
for i in range(N):
a[i],b[i],c[i] = list(map(int, input().split()))
W_MAX = 40*10
dp = [[float('inf')]*(W_MAX+1) for _ in range(W_MAX+1)]
dp[0][0] = 0
for i in range(N):
for wa in reversed(list(rang... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
G = []
for i in range(N):
a, b, c = list(map(int, input().split()))
G.append( (a,b,c) )
M = 401
INF = 1000000000
dp = [INF] * (M * M)
dp[0] = 0
for a, b, c in G:
i = M - a - 1
while i >= 0:
j = M - b - 1
while j >= 0:
dp[(i+a)*M+(j+b)] = ... | N, Ma, Mb = list(map(int, input().split()))
G = []
for i in range(N):
a, b, c = list(map(int, input().split()))
G.append( (a,b,c) )
M = 1 + min(sum([ a for a, b, c in G ]),
sum([ b for a, b, c in G ]) )
INF = 1000000000
dp = [INF] * (M * M)
dp[0] = 0
for a, b, c in G:
i = M - a - 1
whi... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
G = []
for i in range(N):
a, b, c = list(map(int, input().split()))
G.append( (a,b,c) )
M = 1 + min(sum([ a for a, b, c in G ]),
sum([ b for a, b, c in G ]) )
INF = 1000000000
dp = [INF] * (M * M)
dp[0] = 0
for a, b, c in G:
i = M - a - 1
whi... | N, Ma, Mb = list(map(int, input().split()))
G = []
for i in range(N):
a, b, c = list(map(int, input().split()))
G.append( (a,b,c) )
M = 1 + min(sum([ a for a, b, c in G ]),
sum([ b for a, b, c in G ]) )
INF = 1000000000
dp = [INF] * (M * M)
dp[0] = 0
for a, b, c in G:
for i in reversed(li... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
D = [tuple(map(int, input().split())) for _ in range(N)]
def dfs(L, D, i, ta, tb, tc):
if i==len(D):
key = (ta, tb)
L[key] = min(L[key], tc) if key in L else tc
return
a, b, c = D[i]
dfs(L, D, i+1, ta , tb , tc )
dfs(L, D,... | N, Ma, Mb = list(map(int, input().split()))
D = [tuple(map(int, input().split())) for _ in range(N)]
def listup(L, D):
for a, b, c in D:
for (ka, kb), kc in list(L.copy().items()):
key = (ka+a, kb+b)
L[key] = min(L[key], kc+c) if key in L else kc+c
L1 = {(0,0):0}... | p03806 |
INF = 10**18
def solve(N, Ma, Mb, sol):
if N % 2 == 1:
sol.append((0, 0, 0))
N += 1
M = N // 2
sol1 = sol[:M]
sol2 = sol[M:]
S1 = []
S2 = []
for i in range(2**M):
A1, B1, C1 = 0, 0, 0
A2, B2, C2 = 0, 0, 0
for j in range(M):
... | INF = 10**18
def solve(N, Ma, Mb, sol):
if N % 2 == 1:
sol.append((0, 0, 0))
N += 1
M = N // 2
sol1 = sol[:M]
sol2 = sol[M:]
S1 = []
D = dict()
res = INF
for i in range(2**M):
A1, B1, C1 = 0, 0, 0
A2, B2, C2 = 0, 0, 0
for j ... | p03806 |
import math
nmax = 40
abmax = 10
INF = 10000
#入力
N, Ma, Mb = list(map(int, input().split()))
medichine = []
for i in range(N):
Lst = [int(x) for x in input().split()]
medichine.append(Lst)
dp = {}
#dp初期化
for i in range(N+1):
for ca in range(nmax*abmax+1):
for cb in range(nmax*abmax... | import collections
import copy
INF = 10000
#入力
N, Ma, Mb = list(map(int, input().split()))
medichine = [tuple(map(int, input().split())) for _ in range(N)]
dp = {}
#dp初期化
dp = collections.defaultdict(lambda:INF)
dp[0,0] = 0
for a, b, c in medichine:
dp_ = copy.copy(dp)
for ca,cb in list(dp.key... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
A, B, C = [], [], []
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
A.append(ai)
B.append(bi)
C.append(ci)
INF = float('inf')
dp = [[[INF]*401 for i in range(401)] for j in range(N+1)]
dp[0][0][0] = 0
for i in range(1, N+1):
... | N, Ma, Mb = list(map(int, input().split()))
A, B, C = [], [], []
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
A.append(ai)
B.append(bi)
C.append(ci)
INF = float('inf')
dp = [[[INF]*401 for i in range(401)] for j in range(N+1)]
dp[0][0][0] = 0
for i in range(N):
for ... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
Items = [list(map(int, input().split())) for i in range(N)]
# dp[i][a][b] := i個目の薬品までで薬品Aがaグラム、薬品Bがbグラムの混合液を作るために必要な最小予算
dp = [[[float('inf')] * 401 for j in range(401)] for i in range(N + 1)]
dp[0][0][0] = 0
for i in range(N):
ai, bi, ci = Items[i]
for a i... | N, Ma, Mb = list(map(int, input().split()))
Items = [list(map(int, input().split())) for i in range(N)]
# dp[i][a][b] := i個目の薬品までで薬品Aがaグラム、薬品Bがbグラムの混合液を作るために必要な最小予算
dp = [[[float('inf')] * 401 for j in range(401)] for i in range(N + 1)]
dp[0][0][0] = 0
for i in range(1, N + 1):
ai, bi, ci = Items[i - 1]
... | p03806 |
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
... | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
... | p03806 |
def main():
INF = 10 ** 20
n, ma, mb = list(map(int, input().split()))
dp = [[INF] * 401 for _ in range(401)]
dp[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for i in range(400 - a, -1, -1):
for j in range(400 - b, -1, -1):
... | def main():
INF = 10 ** 5
n, ma, mb = list(map(int, input().split()))
dp = [[INF] * 401 for _ in range(401)]
dp[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for i in range(400 - a, -1, -1):
dpi = dp[i]
dpia = dp[i + a]
... | p03806 |
N,Ma,Mb=list(map(int, input().strip().split()))
abc=[list(map(int, input().strip().split())) for i in range(N)]
maxW=N*10
dp=[[[float("inf")]*(maxW+1) for _ in range(maxW+1)]for __ in range(N+1)]
dp[0][0][0]=0
for i in range(N):
a,b,c=abc[i]
for ai in range(maxW):
for bi in range(maxW):
... | N,Ma,Mb=list(map(int, input().strip().split()))
abc=[list(map(int, input().strip().split())) for i in range(N)]
maxW=N*10
dp=[{} for __ in range(N+1)]
dp[0][(0,0)]=0
for i in range(N):
a,b,c=abc[i]
for k,v in list(dp[i].items()):
dp[i+1][k]=min(dp[i][k], dp[i+1][k]if k in dp[i+1] else float("inf... | p03806 |
N,Ma,Mb=list(map(int,input().split()))
medic=[tuple(map(int,input().split())) for _ in range(N)]
from collections import defaultdict
inf = float('inf')
dp=defaultdict(lambda :inf)
dp[(0,0)]=0
for n in range(N):
dpc=dp.copy()
a,b,c=medic[n]
for d,cost in list(dpc.items()):
da,db=d
... | N,Ma,Mb=list(map(int,input().split()))
medic=[tuple(map(int,input().split())) for i in range(N)]
from collections import defaultdict
dp=defaultdict(lambda : float('inf'))
dp[(0,0)]=0
for a,b,c in medic:
dpc=dp.copy()
for k,v in list(dpc.items()):
x,y=k
dp[(x+a,y+b)]=min(dp[(x+a,y+b)],v+... | p03806 |
N, Ma, Mb = list(map(int,input().split()))
a=[0]*N
b=[0]*N
c=[0]*N
for i in range(N):
a[i], b[i], c[i] = list(map(int,input().split()))
dp = [[[4001 for i in range(411)] for j in range(411)] for l in range(N+1)]
dp[0][0][0] = 0
for i in range(1,N+1):
for j in range(400):
for k in range(4... | N, Ma, Mb = list(map(int,input().split()))
a=[0]*N
b=[0]*N
c=[0]*N
for i in range(N):
a[i], b[i], c[i] = list(map(int,input().split()))
dp = [[[4001 for i in range(411)] for j in range(411)] for l in range(N+1)]
dp[0][0][0] = 0
for i in range(1,N+1):
for j in range(400):
for k in range(4... | p03806 |
n, ma, mb = list(map(int, input().split()))
N = 403
memo = [[10**18]*(N+20) for i in range(N+20)]
memo[0][0] = 0
for t in range(n):
a, b, c = list(map(int, input().split()))
for i in range(N, -1, -1):
for j in range(N, -1, -1):
memo[i+a][j+b] = min(memo[i+a][j+b], memo[i][j] + c)
an... | from heapq import heappush, heappop
n, ma, mb = list(map(int, input().split()))
dp = {(0, 0): 0}
INF = 10**18
for i in range(n):
a, b, c = list(map(int, input().split()))
for x, y in sorted(dp.keys())[::-1]:
dp[x+a, y+b] = min(dp.get((x+a, y+b), INF), dp[x, y] + c)
ans = INF
for x, y in dp:
... | p03806 |
#!/usr/bin/env python3
import sys
try:
from typing import List
except ImportError:
pass
def solve(N: int, M_a: int, M_b: int, a: "List[int]", b: "List[int]", c: "List[int]"):
t = [[float("inf")] * (10 * N + 1) for _ in range(10 * N + 1)]
t[0][0] = 0
for ai, bi, ci in zip(a, b, c):
... | #!/usr/bin/env python3
import sys
try:
from typing import List
except ImportError:
pass
def solve(N: int, M_a: int, M_b: int, a: "List[int]", b: "List[int]", c: "List[int]"):
inf = 100000
t = [[inf] * (10 * N + 1) for _ in range(10 * N + 1)]
t[0][0] = 0
for ai, bi, ci in zip(a, b, ... | p03806 |
#!/usr/bin/env python3
import sys
try:
from typing import List
except ImportError:
pass
N, M_a, M_b = [int(x) for x in input().split()]
inf = 100000
t = [[inf] * (10 * N + 1) for _ in range(10 * N + 1)]
t[0][0] = 0
for _ in range(N):
ai, bi, ci = [int(x) for x in input().split()]
for ta ... | #!/usr/bin/env python3
def solve():
N, M_a, M_b = [int(x) for x in input().split()]
inf = 100000
t = [[inf] * (10 * N + 1) for _ in range(10 * N + 1)]
t[0][0] = 0
for _ in range(N):
ai, bi, ci = [int(x) for x in input().split()]
for ta in reversed(list(range(ai, len(t)))):
... | p03806 |
import sys
input = sys.stdin.buffer.readline
N, Ma, Mb = list(map(int, input().split()))
ABC = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 15
dp = [[INF for j in range(401)] for i in range(401)]
dp[0][0] = 0
for a, b, c in ABC:
for i in range(400, -1, -1):
for j in range(400, -1... | import sys
input = sys.stdin.buffer.readline
N, Ma, Mb = list(map(int, input().split()))
ABC = [list(map(int, input().split())) for _ in range(N)]
sumA = sum([ABC[i][0] for i in range(N)])
sumB = sum([ABC[i][1] for i in range(N)])
INF = 10 ** 15
dp = [[INF for j in range(sumB + 1)] for i in range(sumA + 1)... | p03806 |
import itertools
N,MA,MB = list(map(int,input().split()))
arr = []
for i in range(N):
l = list(map(int,input().split()))
arr.append(l)
dp = [ [ [50000 for k in range(401)] for j in range(401)] for i in range(N+1) ]
dp[0][0][0] = 0
for i,a,b in itertools.product(list(range(1,N+1)),list(range(401)),... | import itertools
N,MA,MB = list(map(int,input().split()))
arr = []
for i in range(N):
l = list(map(int,input().split()))
arr.append(l)
dp = [ [ [50000 for k in range(401)] for j in range(401)] for i in range(N+1) ]
dp[0][0][0] = 0
ans = 50000
for i,a,b in itertools.product(list(range(1,N+1)),list... | p03806 |
def solve():
N, Ma, Mb = list(map(int, input().split()))
a, b, c = [], [], []
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
alim = sum(a)
blim = sum(b)
inf = 40 * 100 + 1
dp = [[inf]*(... |
def solve():
N, Ma, Mb = list(map(int, input().split()))
a, b, c = [], [], []
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
nvals = 99 * N * 2 + 1
inf = 40 * 100 + 1
dp = [[inf] * nvals for i... | p03806 |
def solve():
N, Ma, Mb = list(map(int, input().split()))
a, b, c = [], [], []
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
nvals = 99 * N * 2 + 1
inf = 40 * 100 + 1
dp = [[inf] * nvals for i... |
def solve():
N, Ma, Mb = list(map(int, input().split()))
a, b, c = [], [], []
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
a.append(ai)
b.append(bi)
c.append(ci)
nvals = 99 * N * 2 + 1
inf = 40 * 100 + 1
dp = [inf] * nvals
... | p03806 |
import copy
N, Ma, Mb = list(map(int, input().split()))
ABC = [tuple(map(int, input().split())) for _ in range(N)]
INF, W = 10 ** 10, 10 * 10 * N
dp = [[INF] * (2 * W + 1)]
for a, b, c in ABC:
dp.append(copy.deepcopy(dp[-1]))
df = a * Mb - b * Ma
dp[-1][df] = min(c, dp[-1][df])
for d in r... | import copy
N, Ma, Mb = list(map(int, input().split()))
ABC = [tuple(map(int, input().split())) for _ in range(N)]
INF, W = 10000, 10 * max(Ma, Mb) * N
dp = [[INF] * (2 * W + 1)]
for a, b, c in ABC:
dp.append(copy.deepcopy(dp[-1]))
df = a * Mb - b * Ma
dp[-1][df] = min(dp[-1][df], c)
for ... | p03806 |
import sys
inf = float('inf')
n, ma, mb = list(map(int, input().split()))
t = [[inf] * 401 for _ in range(401)]
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(400, 0, -1):
for bb in range(400, 0, -1):
if t[aa][bb] == inf:
continue
if t[a + aa][b + bb] ... | import sys
inf = float('inf')
n, ma, mb = list(map(int, input().split()))
t = [[inf] * 401 for _ in range(401)]
t[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(400, -1, -1):
for bb in range(400, -1, -1):
if t[aa][bb] == inf:
continue
if t[a... | p03806 |
nmax, abmax, inf = 40, 10, 1000000
a, b, c = [0] * nmax, [0] * nmax, [0] * nmax
dp = [[[0] * (nmax * abmax + 1) for _ in range(nmax * abmax + 1)] for _ in range(nmax + 1)]
n, ma, mb = list(map(int, input().split()))
for i in range(n):
x, y, z = list(map(int, input().split()))
a[i], b[i], c[i] = x, y, z
... | nmax, abmax, inf = 40, 10, 1000000
dp = [[[inf] * (nmax * abmax + 1) for _ in range(nmax * abmax + 1)] for _ in range(nmax + 1)]
n, ma, mb = list(map(int, input().split()))
dp[0][0][0] = 0
for i in range(n):
a, b, c = list(map(int, input().split()))
dpi = dp[i]
dpi1 = dp[i + 1]
for ca in range(0... | p03806 |
nmax, abmax, inf = 40, 10, 1000000
dp = [[[inf] * (nmax * abmax + 1) for _ in range(nmax * abmax + 1)] for _ in range(nmax + 1)]
n, ma, mb = list(map(int, input().split()))
dp[0][0][0] = 0
for i in range(n):
a, b, c = list(map(int, input().split()))
dpi = dp[i]
dpi1 = dp[i + 1]
for ca in range(0... | INF = float('inf')
n, ma, mb = list(map(int, input().split()))
t = [[INF] * 401 for _ in range(401)]
t[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(400, -1, -1):
for bb in range(400, -1, -1):
if t[aa][bb] == INF:
continue
if t[a + aa][b + b... | p03806 |
INF = float('inf')
n, ma, mb = list(map(int, input().split()))
t = [[INF] * 401 for _ in range(401)]
t[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(400, -1, -1):
for bb in range(400, -1, -1):
if t[aa][bb] == INF:
continue
if t[a + aa][b + b... | INF = float('inf')
MAXAB = 10
n, ma, mb = list(map(int, input().split()))
t = [[INF] * (n * MAXAB + 1) for _ in range(n * MAXAB + 1)]
t[0][0] = 0
for _ in range(n):
a, b, c = list(map(int, input().split()))
for aa in range(n * MAXAB, -1, -1):
for bb in range(n * MAXAB, -1, -1):
if t[aa][bb] == IN... | p03806 |
n,ma,mb=list(map(int,input().split()))
abc=[]
for i in range(n):
abc.append([int(j) for j in input().split()])
from operator import itemgetter
abc.sort(key=itemgetter(2))
dp=[[10**18 for i in range(401)]for j in range(401)]
dp[0][0]=0
q=[[0,0]]
for a,b,c in abc:
l=[]
for i,j in q:
l.... | n,ma,mb=list(map(int,input().split()))
abc=[]
for i in range(n):
abc.append([int(j) for j in input().split()])
from operator import itemgetter
abc.sort(key=itemgetter(2))
dp=[[10**18 for i in range(401)]for j in range(401)]
dp[0][0]=0
p,q=0,0
for a,b,c in abc:
for j in reversed(list(range(q+1))):
... | p03806 |
#!/usr/bin/env python3
from copy import deepcopy
ABMAX = 400
HUGE = 10 ** 12
def main():
n, ma, mb = list(map(int, input().split()))
sold = []
for i in range(n):
a, b, c = list(map(int, input().split()))
sold.append((a, b, c))
mincost = dp(sold, n)
print((find_mincos... | #!/usr/bin/env python3
from copy import deepcopy
ABMAX = 400
HUGE = 10 ** 12
def main():
n, ma, mb = list(map(int, input().split()))
sold = []
for i in range(n):
a, b, c = list(map(int, input().split()))
sold.append((a, b, c))
mincost = dp(sold, n)
print((find_mincos... | p03806 |
N,Ma,Mb=list(map(int,input().split()))
Med=[]
for i in range(N):
a=[int(x) for x in input().split()]
Med.append(a)
#[i]まででMa=[j],Mb=[k]を作る場合の最小のコストdp
#dp[i+1][j+Ma][k+Mb]=min(dp[i][j+Ma][k+Mb],dp[i][j][k]+Cost)
#リストをinfで初期化。inf=作れない配合なので、continue。初期値はdp[0][0][0]=0
dp=[[[float('inf') for j in range(401)]... | N,Ma,Mb=list(map(int,input().split()))
Med=[]
cnt_a=0
cnt_b=0
for i in range(N):
a=[int(x) for x in input().split()]
Med.append(a)
cnt_a+=a[0]
cnt_b+=a[1]
R=max(cnt_a,cnt_b)
#[i]まででMa=[j],Mb=[k]を作る場合の最小のコストdp
#dp[i+1][j+Ma][k+Mb]=min(dp[i][j+Ma][k+Mb],dp[i][j][k]+Cost)
#リストをinfで初期化。inf=作れない配合なので、con... | p03806 |
def sol():
N, Ma, Mb = list(map(int, input().split()))
items = []
for _ in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
dp = [[[[]] for _ in range(Ma)] for _ in range(N + 1)]
for i, (a, _, _) in enumerate(items):
for mod in range(Ma)... | def sol():
N, Ma, Mb = list(map(int, input().split()))
items = []
for _ in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
dp = [[set([()]) for _ in range(Ma)] for _ in range(N + 1)]
for i, (a, _, _) in enumerate(items):
for mod in rang... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
items = []
for i in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
inf = float("inf")
dp = [[[inf for _ in range(411)] for _ in range(411)] for i in range(N+1)]
dp[0][0][0] = 0
for i in range(N):
for a in range(401):
... | N, Ma, Mb = list(map(int, input().split()))
items = []
for i in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
a_sum = sum([item[0] for item in items])
b_sum = sum([item[1] for item in items])
inf = float("inf")
dp = [[[inf for _ in range(a_sum + 100)] for _ in range(b_sum... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
items = []
for i in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
a_sum = sum([item[0] for item in items])
b_sum = sum([item[1] for item in items])
inf = float("inf")
dp = [[[inf for _ in range(a_sum + 100)] for _ in range(b_sum... | N, Ma, Mb = list(map(int, input().split()))
items = []
for i in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
a_sum = sum([item[0] for item in items])
b_sum = sum([item[1] for item in items])
inf = float("inf")
dp = [[[inf for _ in range(a_sum + 60)] for _ in range(b_sum ... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
items = []
for i in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
a_sum = sum([item[0] for item in items])
b_sum = sum([item[1] for item in items])
inf = float("inf")
dp = [[[inf for _ in range(a_sum + 50)] for _ in range(b_sum ... | N, Ma, Mb = list(map(int, input().split()))
items = []
for i in range(N):
a, b, c = list(map(int, input().split()))
items.append((a, b, c))
a_sum = sum([item[0] for item in items])
b_sum = sum([item[1] for item in items])
inf = float("inf")
dp = [[[inf for _ in range(b_sum + 11)] for _ in range(a_sum ... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
items = []
ap = items.append
a_sum =0
b_sum = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
ap((a, b, c))
a_sum += a
b_sum += b
inf = float("inf")
dp = [[[inf for _ in range(b_sum + 10)] for _ in range(a_sum + 10)] for i in range(... | N, Ma, Mb = list(map(int, input().split()))
items = []
ap = items.append
a_sum =0
b_sum = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
ap((a, b, c))
a_sum += a
b_sum += b
inf = float("inf")
dp = [[[inf for _ in range(b_sum + 10)] for _ in range(a_sum + 10)] for i in range(... | p03806 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from itertools import product
from copy import deepcopy
def resolve():
n,ma,mb=list(map(int,input().split()))
ABC=[tuple(map(int,input().split())) for _ in range(n)]
M=400
d... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from itertools import product
from copy import deepcopy
def resolve():
n,ma,mb=list(map(int,input().split()))
ABC=[tuple(map(int,input().split())) for _ in range(n)]
M=400
d... | p03806 |
from copy import deepcopy
N, Ma, Mb = list(map(int, input().split()))
L = [[float("inf")]*410 for i in range(410)]
P = [[0, 0]]
L[0][0] = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
OldP = P.copy()
OldL = deepcopy(L)
for p in OldP:
if L[p[0]+a][p[1]+b] == float("in... | N, Ma, Mb = list(map(int, input().split()))
L = [[float("inf")]*410 for i in range(410)]
P = [[0, 0]]
L[0][0] = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
OldP = P.copy()
Lsub = [L[p[0]][p[1]] for p in OldP]
for xp, p in enumerate(OldP):
if L[p[0]+a][p[1]+b] == flo... | p03806 |
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N,Ma,Mb = list(map(int,input().split()))
abc = [list(map(int,input().split())) for i in range(N)]
INF = N * 100 + 1
dp = [[... | # import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
N,Ma,Mb = list(map(int,input().split()))
abc = [list(map(int,input().split())) for i in range(N)]
INF = N * 100 + 1
dp = [[... | p03806 |
n,ma,mb = list(map(int, input().split()))
abcl = []
for _ in range(n):
a,b,c = list(map(int, input().split()))
abcl.append((a,b,c))
dp = [ [ [10**9]*401 for _ in range(401) ] for _ in range(n+1) ]
dp[0][0][0] = 0
for i in range(n):
ai,bi,ci = abcl[i]
for a in range(401):
for b in ra... | n,ma,mb = list(map(int, input().split()))
abcl = []
for _ in range(n):
a,b,c = list(map(int, input().split()))
abcl.append((a,b,c))
dp = [ [ [10**9]*401 for _ in range(401) ] for _ in range(n+1) ]
dp[0][0][0] = 0
for i in range(n):
ai,bi,ci = abcl[i]
for a in range(401):
for b in ra... | p03806 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
abc = [list(map(int, input().split())) for _ in range(N)]
inf = float('inf')
dp = [[[inf] * 401 for _ in range(401)] for _ in range(N + 1)]
dp[0][0][0] = 0
for i in range(N):
for j in range(401):
for k in range(401):
dp[i + 1][j][k] = dp[... | N, Ma, Mb = list(map(int, input().split()))
abc = [list(map(int, input().split())) for _ in range(N)]
inf = float('inf')
dp = [[[inf] * 401 for _ in range(401)] for _ in range(N + 1)]
dp[0][0][0] = 0
for i in range(N):
for j in range(401):
for k in range(401):
if j - abc[i][0] >= 0... | p03806 |
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | p03806 |
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | p03806 |
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def LI(): return list(map(int, input().split()))
def LIR(row,col):
... | p03806 |
n,ma,mb=list(map(int,input().split()))
abc=[list(map(int,input().split())) for _ in [0]*n]
memo=[[10**5 for _ in [0]*401] for _ in [0]*401]
memo[0][0]=0
for N in range(n):
for i in range(390,-1,-1):
for j in range(390,-1,-1):
a,b,c=abc[N]
memo[i+a][j+b]=min(memo[i+a][j+b]... | n,ma,mb=list(map(int,input().split()))
abc=[list(map(int,input().split())) for _ in [0]*n]
memo=[[10**4 for _ in [0]*(n*10+1)] for _ in [0]*(n*10+1)]
memo[0][0]=0
for N in range(n):
for i in range(N*10,-1,-1):
for j in range(N*10,-1,-1):
a,b,c=abc[N]
memo[i+a][j+b]=min(me... | p03806 |
#D問題
NM=40
ABM=10
N,M1,M2=list(map(int,input().split()))
A=[]
B=[]
C=[]
for i in range(N):
a,b,c=list(map(int,input().split()))
A.append(a)
B.append(b)
C.append(c)
amax,bmax,cmax,=max(A),max(B),max(C)
dp=[[[N*cmax for broop in range(NM*ABM+1)] for aroop in range(NM*ABM+1)] for nroop in ra... | #D問題
NM=40
ABM=10
MM=400
N,M1,M2=list(map(int,input().split()))
A=[]
B=[]
C=[]
for i in range(N):
a,b,c=list(map(int,input().split()))
A.append(a)
B.append(b)
C.append(c)
cmax=max(C)
CM=N*cmax+10
dp=[[[CM for broop in range(401)] for aroop in range(401)] for nroop in range(N+1)]
dp[0][... | p03806 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n, ma, mb = list(map(int, input().split()))
abc = [None]*n
for i in range(n):
a,b,c = tuple(map(int, input().split()))
abc[i] = (a*mb - b*ma, c)
abc.sort()
d... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n, ma, mb = list(map(int, input().split()))
abc = [None]*n
for i in range(n):
a,b,c = tuple(map(int, input().split()))
abc[i] = (a*mb - b*ma, c)
abc.sort()
d... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
e = [tuple(map(int, input().split())) for _ in range(N)]
N_max = 40
a_max = 10
b_max = 10
c_max = 100
inf = N_max * c_max + 1
dp = [[inf] * (N_max * b_max + 1) for _ in range(N_max * a_max + 1)]
dp[0][0] = 0
for i, (aa, bb, cc) in enumerate(e):
for a in re... | inf = float('inf')
N, Ma, Mb = list(map(int, input().split()))
dp = [[inf] * (400 + 1) for _ in range(400 + 1)]
dp[0][0] = 0
max_a = 0
max_b = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
max_a += a
max_b += b
for j in reversed(list(range(max_a + 1 - a))):
for k ... | p03806 |
def main():
inf = 100 * 40 + 1
mx = 400
N, Ma, Mb = list(map(int, input().split()))
dp = [[[inf] * (400 + 1) for _ in range(400 + 1)] for _ in range(N + 1)]
dp[0][0][0] = 0
for i in range(N):
ai, bi, ci = list(map(int, input().split()))
for a in range(mx + 1):
... | def main():
INF = 100 * 40 + 1
MX = 4000
N, Ma, Mb = list(map(int, input().split()))
dp = [[INF] * (MX * 2 + 1) for _ in range(2)]
i, j = 0, 1
for _ in range(N):
ai, bi, ci = list(map(int, input().split()))
x = Ma * bi - Mb * ai # Σai:Σbi=Ma:Mb<->Ma*Σbi-Mb*Σai=0
... | p03806 |
def main():
INF = 100 * 40 + 1
MX = 4000
N, Ma, Mb = list(map(int, input().split()))
dp = [[INF] * (MX * 2 + 1) for _ in range(2)]
i, j = 0, 1
for _ in range(N):
ai, bi, ci = list(map(int, input().split()))
x = Ma * bi - Mb * ai # Σai:Σbi=Ma:Mb<->Ma*Σbi-Mb*Σai=0
... | # https://atcoder.jp/contests/abc054/submissions/4360181
def main():
from collections import defaultdict
INF = 40 * 100 + 1
N, Ma, Mb = list(map(int, input().split()))
memo = defaultdict(lambda: INF)
for _ in range(N):
ai, bi, ci = list(map(int, input().split()))
x ... | p03806 |
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03806 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p03806 |
def main():
n,ma,mb = list(map(int,input().split()))
dp = [[[float("inf") for _ in range(401)] for _ in range(401)] for _ in range(n+1)]
dp[0][0][0]=0
for i in range(1,n+1):
a,b,c = list(map(int,input().split()))
for j in range(401):
for k in range(401):
... | n,ma,mb=list(map(int,input().split()))
dp=[[[10**30 for j in range(401)]for i in range(401)]for k in range(n+1)]
dp[0][0][0]=0
l=[]
for i in range(n):
a,b,c=list(map(int,input().split()))
l.append([a,b,c])
for i in range(1,n+1):
a,b,c=l[i-1][0],l[i-1][1],l[i-1][2]
for x in range(401):
... | p03806 |
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_... | import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_... | p03806 |
from collections import defaultdict
MAX = 40001
def main():
N, Ma, Mb = [int(a) for a in input().split()]
abc = [
[int(a) for a in input().split()]
for _ in range(N)
]
dp = [
[
[MAX for b in range(10 * N + 1)]
for a in range(10 * N + 1... | from collections import defaultdict
MAX = 40001
def main():
N, Ma, Mb = [int(a) for a in input().split()]
abc = [
[int(a) for a in input().split()]
for _ in range(N)
]
dp = [
[
[MAX for b in range(10 * N + 1)]
for a in range(10 * N + 1... | p03806 |
from collections import defaultdict
N,Ma,Mb=list(map(int,input().split()))
A=[]
B=[]
C=[]
a_sum=0
b_sum=0
for i in range(N):
a,b,c=list(map(int,input().split()))
A.append(a)
B.append(b)
C.append(c)
a_sum+=a
b_sum+=b
dp=defaultdict(lambda: float("inf"))
dp[(0,0,0)]=0
for k in range(1,N+1):
... | from collections import defaultdict
N,Ma,Mb=list(map(int,input().split()))
dp=defaultdict(lambda: float("inf"))
dp[(0,0)]=0
for i in range(N):
a,b,c=list(map(int,input().split()))
for j in list(dp.items()):
x=j[0][0]
y=j[0][1]
z=j[1]
na, nb, nc = x+a, y+b, z+c
dp[(na, nb)]=min( dp[(na, nb)],... | p03806 |
N,Ma,Mb=list(map(int,input().split()))
a=[0 for k in range(N)]
b=[0 for k in range(N)]
c=[0 for k in range(N)]
import copy
for k in range(N):
a[k],b[k],c[k]=list(map(int,input().split()))
Sa=sum(a)
Sb=sum(b)
dp =[[5000 for k in range(Sb+1)]for k in range(Sa+1)]
dp[0][0]=0
for k in range(N):
listj=[]... | N,Ma,Mb=list(map(int,input().split()))
a=[0 for k in range(N)]
b=[0 for k in range(N)]
c=[0 for k in range(N)]
import copy
for k in range(N):
a[k],b[k],c[k]=list(map(int,input().split()))
Sa=sum(a)
Sb=sum(b)
dp =[[[5000 for k in range(Sb+1)]for k in range(Sa+1)]for k in range(N+1)]
dp[0][0][0]=0
for k in... | p03806 |
import math
def f(i):
if i == ns:
suma, sumb, sumcost = 0, 0, 0
for j in range(ns):
if s[j] == 1:
suma += x[j][0]
sumb += x[j][1]
sumcost += x[j][2]
mincost[suma][sumb] = min(mincost[suma][sumb], sumcost)
return
... | n, ma, mb = list(map(int, input().split()))
x = [list(map(int, input().split())) for _ in range(n)]
x.insert(0, [0, 0, 0])
inf = 114514
dp = [[[inf] * (10 * n + 1) for _ in range(10 * n + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0][0] = 0
suma, sumb = 0, 0
for i in range(1, n + 1):
suma ... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
a = [0]*N
b = [0]*N
c = [0]*N
INF = float("inf")
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
#dp[i][j][k]...i番目までの品物で, タイプAの物質をjグラム, タイプBの物質をkグラム調達するのに必要な費用の最小値
dp = [[[INF]*400 for _ in range(400)] for _ in range(N+1)]
dp[0][0][... | N, Ma, Mb = list(map(int, input().split()))
a = [0]*N
b = [0]*N
c = [0]*N
INF = 10000
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
#dp[i][j][k]...i番目までの品物で, タイプAの物質をjグラム, タイプBの物質をkグラム調達するのに必要な費用の最小値
dp = [[[INF]*400 for _ in range(400)] for _ in range(N+1)]
dp[0][0][0] = 0
... | p03806 |
def main():
n, ma, mb, *L = list(map(int, open(0).read().split()))
M = 1<<30
dp = [[M] * 420 for _ in range(420)]
dp[0][0] = 0
for a, b, c in zip(*[iter(L)] * 3):
for i in range(400, -1, -1):
for j in range(400, -1, -1):
t = dp[i][j] + c
if dp[i + a][j + b] > t:
dp[i + a][j + b] = t
a... | def main():
n, ma, mb, *L = list(map(int, open(0).read().split()))
M = 1 << 30
dp = [[M] * 420 for _ in range(420)]
dp[0][0] = 0
ua = ub = 15
for a, b, c in zip(*[iter(L)] * 3):
for i in range(ua, -1, -1):
for j in range(ub, -1, -1):
t = dp[i][j] + c
if dp[i + a][j + b] > t:
dp[i + a]... | p03806 |
global N
global Nlist
global Ma
global Mb
global minicost
minicost = 10000000
N, Ma, Mb = list(map(int,input().split()))
Nlist = []
for i in range(N):
a,b,c = list(map(int,input().split()))
Nlist.append([a,b,c])
def dvector(vector):
global Ma
global Mb
global Nlist
global minic... | global N
global Nlist
global Ma
global Mb
global minicost
minicost = 10000000
N, Ma, Mb = list(map(int,input().split()))
Nlist = []
for i in range(N):
a,b,c = list(map(int,input().split()))
Nlist.append([a,b,c])
def dvector(Masum,Mbsum,cost,vector):
global Ma
global Mb
global Nlist
... | p03806 |
n,Ma,Mb=list(map(int,input().split()))
inf=float("inf")
dp=[[[inf]*401 for _ in range(401)] for _ in range(n+1)]
dp[0][0][0]=0
l=[tuple(map(int,input().split())) for _ in range(n)]
for i in range(1,n+1):
for j in range(401):
for k in range(401):
a,b,c=l[i-1]
dp[i][j][k]=... | n,Ma,Mb=list(map(int,input().split()))
inf=float("inf")
dp=[[[inf]*401 for _ in range(401)] for _ in range(n+1)]
dp[0][0][0]=0
l=[tuple(map(int,input().split())) for _ in range(n)]
for i in range(1,n+1):
for j in range(401):
for k in range(401):
a,b,c=l[i-1]
dp[i][j][k]=... | p03806 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
INF = 10**5
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
n,ma,mb = LI()
med = [LI() for _ in range(n)]
h1 = []
h2 = []
for i in range(2 ** (n//2)):
bit = 1
ta = 0
... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
INF = 10**5
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
n,ma,mb = LI()
med = [LI() for _ in range(n)]
h1 = [INF] * 10000
for i in range(1,2 ** (n//2)):
bit = 1
ta = 0
... | p03806 |
n,ma,mb = (int(i) for i in input().split())
dp = [[[float("inf") for i in range(10*n+1)] for i in range(10*n+1)] for i in range(n+1)]
dp[0][0][0],ans = 0,float("inf")
for i in range(1,n+1):
x,y,c = (int(l) for l in input().split())
for j in range(10*(i-1)+1):
for k in range(10*(i-1)+1):
if dp[i-1][j][k]!=... | n, ma, mb = list(map(int, input().split()))
INF = float("inf")
dp = [[[INF for i in range(10*n+1)] for i in range(10*n+1)] for i in range(n+1)]
dp[0][0][0],ans = 0,INF
for i in range(1,n+1):
a,b,c = (int(l) for l in input().split())
for j in range(10*(i-1)+1):
for k in range(10*(i-1)+1):
... | p03806 |
import fractions
n, ma, mb = list(map(int,input().split()))
a = [0] * (n + 1)
b = [0] * (n + 1)
c = [0] * (n + 1)
for i in range(1, n + 1):
a[i], b[i], c[i] = list(map(int,input().split()))
#iまでの薬品で、aがj(g),bがk(g)となるときの最小コスト
dp = [[[float('inf') for i in range(n + 1)] for j in range(401)] \
for k in... | import fractions
n, ma, mb = list(map(int,input().split()))
a = [0] * (n + 1)
b = [0] * (n + 1)
c = [0] * (n + 1)
for i in range(1, n + 1):
a[i], b[i], c[i] = list(map(int,input().split()))
#iまでの薬品で、aがj(g),bがk(g)となるときの最小コスト
dp = [[[10**15 for i in range(n + 1)] for j in range(401)] \
for k in range... | p03806 |
import fractions
n, ma, mb = list(map(int,input().split()))
a = [0] * (n + 1)
b = [0] * (n + 1)
c = [0] * (n + 1)
for i in range(1, n + 1):
a[i], b[i], c[i] = list(map(int,input().split()))
#iまでの薬品で、aがj(g),bがk(g)となるときの最小コスト
dp = [[[10 ** 15 for i in range(n + 1)] for j in range(401)] \
for k in ran... | n, ma, mb = list(map(int,input().split()))
a = [0] * (n + 1)
b = [0] * (n + 1)
c = [0] * (n + 1)
for i in range(1, n + 1):
a[i], b[i], c[i] = list(map(int,input().split()))
#iまでの薬品で、aがj(g),bがk(g)となるときの最小コスト
dp = [[[10 ** 15 for i in range(n + 1)] for j in range(401)] \
for k in range(401)]
dp[0][0]... | p03806 |
# coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
n, ma, ... | # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
n, ma, mb = LI()
src = []
a_max, b_max = 1, 1
for _ ... | p03806 |
N,Ma,Mb = list(map(int,input().split()))
INF = 10000
dp = [[[INF for b in range(401)] for a in range(401)] for i in range(N+1)]
dp[0][0][0] = 0
for i in range(1,N+1):
ai,bi,ci = list(map(int,input().split()))
for a in range(401):
for b in range(401):
if a-ai >= 0 and b-bi >= ... | N,Ma,Mb = list(map(int,input().split()))
INF = 10000
dp = [[INF for b in range(401)] for a in range(401)]
dp[0][0] = 0
for i in range(1,N+1):
ai,bi,ci = list(map(int,input().split()))
for a in range(400,-1,-1):
for b in range(400,-1,-1):
if a-ai >= 0 and b-bi >= 0:
... | p03806 |
N,Ma,Mb = list(map(int,input().split()))
INF = float('inf')
dp = [[INF for b in range(401)] for a in range(401)]
dp[0][0] = 0
for i in range(1,N+1):
ai,bi,ci = list(map(int,input().split()))
for a in range(400,-1,-1):
for b in range(400,-1,-1):
if a-ai >= 0 and b-bi >= 0:
... | N,Ma,Mb = list(map(int,input().split()))
INF = float('inf')
dp = [[INF for b in range(401)] for a in range(401)]
dp[0][0] = 0
sa = 0
sb = 0
for i in range(1,N+1):
ai,bi,ci = list(map(int,input().split()))
sa += ai
sb += bi
for a in range(sa+1,-1,-1):
for b in range(sb+1,-1,-... | p03806 |
N,MA,MB = list(map(int,input().split()))
src = []
sum_a = sum_b = 0
for i in range(N):
a,b,c = list(map(int,input().split()))
src.append((a,b,c))
sum_a += a
sum_b += b
INF = 10**9
dp = [[[INF for b in range(sum_b+1)] for a in range(sum_a+1)] for i in range(N+1)]
dp[0][0][0] = 0
for i in range(N):... | N,MA,MB = list(map(int,input().split()))
src = []
sum_a = sum_b = 0
for i in range(N):
a,b,c = list(map(int,input().split()))
src.append((a,b,c))
sum_a += a
sum_b += b
INF = 10**9
dp = [[[INF for b in range(sum_b+1)] for a in range(sum_a+1)] for i in range(N+1)]
dp[0][0][0] = 0
for i in range(N):... | p03806 |
N,MA,MB = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
INF = 10**9
dp = [[INF for j in range(401)] for i in range(401)]
dp[0][0] = 0
maxa = maxb = 0
for a,b,c in src:
for ai in range(maxa,-1,-1):
for bi in range(maxb,-1,-1):
dp[ai+a][bi+b] =... | N,MA,MB = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
INF = 10**9
MAX = 401
dp = [[INF] * MAX for i in range(MAX)]
dp[0][0] = 0
amax = bmax = 0
for a,b,n in src:
for i in reversed(list(range(bmax+1))):
for j in range(amax+1):
if dp[i][j] =... | p03806 |
N , Ma, Mb = list(map(int, input().split()))
a = [0] * N
b = [0] * N
c = [0] * N
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
# 最小値を求める問題なのでinfで初期化
# dp[i][sun_a][sum_b]で考えていく
dp = [[[float('inf') for _ in range(10 * N + 1)] for _ in range(10 * N + 1)] for _ in range(N+1)]
... | N , Ma, Mb = list(map(int, input().split()))
a = [0] * N
b = [0] * N
c = [0] * N
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
# TLEになってしまうためinfを5000とかで設定する
INF = 5000
# 最小値を求める問題なのでinfで初期化
# dp[i][sun_a][sum_b]で考えていく
dp = [[[INF for _ in range(10 * N + 1)] for _ in range(1... | p03806 |
N , Ma, Mb = list(map(int, input().split()))
a = [0] * N
b = [0] * N
c = [0] * N
for i in range(N):
a[i], b[i], c[i] = list(map(int, input().split()))
# TLEになってしまうためinfを5000とかで設定する
INF = 5000
# さらに計算量を落とすため10 * N + 1などを定数で設定する
# 最小値を求める問題なのでinfで初期化
# dp[i][sun_a][sum_b]で考えていく
dp = [[[INF for _ in... | N , Ma, Mb = list(map(int, input().split()))
# 入力値の受け取り方を変える
arr=[list(map(int,input().split())) for _ in range(N)]
#a = [0] * N
#b = [0] * N
#c = [0] * N
#for i in range(N):
# a[i], b[i], c[i] = map(int, input().split())
# TLEになってしまうためinfを5000とかで設定する
INF = 5000
# さらに計算量を落とすため10 * N + 1などを定数で... | p03806 |
N,Ma,Mb = list(map(int, input().split()))
arr=[list(map(int,input().split())) for _ in range(N)]
dp=[[[5000]*401 for _ in range(401)] for _ in range(41)]
dp[0][0][0] = 0
for i in range(N):
a,b,c=arr[i]
for j in range(10*N+1):
for k in range(10*N+1):
if dp[i][j][k] == 5000:
... | def calc():
N,Ma,Mb = list(map(int, input().split()))
arr=[list(map(int,input().split())) for _ in range(N)]
dp=[[[5000]*401 for _ in range(401)] for _ in range(41)]
dp[0][0][0] = 0
for i in range(N):
a,b,c=arr[i]
for j in range(10*N+1):
for k in range(10*N+1):
... | p03806 |
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, Ma, Mb = inpl()
INF = 4001
DP = [[INF]*(411) for _ in range(411)]
DP[0][0] = 0
for n in range(N):
DP2 = [[INF]*(411) for _ in range(411)]
a, b, c = inpl()
for i in range(10*(n+1) + 1):
for j in range(10*(n+... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
N, Ma, Mb = inpl()
INF = 4001
DP = [[INF]*(411) for _ in range(411)]
DP[0][0] = 0
for n in range(N):
DP2 = [[INF]*(411) for _ in range(411)]
a, b, c = inpl()
for i in range(10*(n+1) + 1):
for j in range(10*(n+... | p03806 |
N, Ma, Mb = list(map(int, input().split()))
INF = 10 ** 18
dp = [[[INF] * (10*N+1) for _ in range(10*N+1)] for _ in range(N+1)]
dp[0][0][0] = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
for j in range(10*N+1-a):
for k in range(10*N+1-b):
dp[i+1][j][k] = min(dp[... | N, Ma, Mb = list(map(int, input().split()))
INF = 10 ** 18
dp = [[[INF] * (10*N+1) for _ in range(10*N+1)] for _ in range(N+1)]
dp[0][0][0] = 0
for i in range(N):
a, b, c = list(map(int, input().split()))
for j in range(10*N+1-a):
for k in range(10*N+1-b):
if dp[i][j][k] == INF:
... | p03806 |
n, ma, mb = list(map(int, input().split()))
abc = [tuple(int(x) for x in input().split()) for _ in range(n)]
c = n * 100 + 1
dp = [[[99999 for _ in range(1001)] for _ in range(1001)] for _ in range(n + 1)]
ans = 99999
dp[0][0][0] = 0
for i in range(n):
for j in range(1001):
for k in range(1001... | n, ma, mb = list(map(int, input().split()))
abc = [tuple(int(x) for x in input().split()) for _ in range(n)]
c = n * 100 + 1
m = 401
dp = [[[99999 for _ in range(m)] for _ in range(m)] for _ in range(n + 1)]
ans = 99999
dp[0][0][0] = 0
for i in range(n):
for j in range(m):
for k in range(m)... | p03806 |
N,Ma,Mb=list(map(int,input().split()))
dp = [[10**18 for _ in range(401)] for _ in range(401)]
dp[0][0]=0
for i in range(N):
a,b,c=list(map(int,input().split()))
for ca in range(361, -1, -1):
for cb in range(361, -1, -1):
dp[ca+a][cb+b] = min(dp[ca+a][cb+b],dp[ca][cb]+c)
ans = ... | N,Ma,Mb=list(map(int,input().split()))
dp = [[10**18 for _ in range(401)] for _ in range(401)]
dp[0][0]=0
for i in range(N):
a,b,c=list(map(int,input().split()))
for ca in range(i * 10, -1, -1):
for cb in range(i * 10, -1, -1):
dp[ca+a][cb+b] = min(dp[ca+a][cb+b],dp[ca][cb]+c)
... | p03806 |
N, A, B = list(map(int, input().split()))
X = [1<<20] * 8080
for _ in range(N):
a, b, c = list(map(int, input().split()))
t = A*b-B*a
X = [min(X[i], (0 if (i-t)%8080 == 0 else X[(i-t)%8080]) + c) for i in range(8080)]
print((-1 if X[0] > 1<<18 else X[0])) | N, A, B = list(map(int, input().split()))
X = [1<<20] * 4040
for _ in range(N):
a, b, c = list(map(int, input().split()))
t = A*b-B*a
X = [min(X[i], (0 if (i-t)%4040 == 0 else X[(i-t)%4040]) + c) for i in range(4040)]
print((-1 if X[0] > 1<<18 else X[0])) | p03806 |
n,ma,mb = list(map(int,input().split()))
INF = 10**4
dp = [[[INF] * (n*10+1) for _ in range(n*10+1)] for _ in range(n+1)]
dp[0][0][0] = 0
for i in range(n):
a,b,c = list(map(int,input().split()))
for ai in range(n*10):
for bi in range(n*10):
if ai>=a and bi>=b:
t... | n,ma,mb = list(map(int,input().split()))
INF = 10**4
dp = [[[INF] * (n*10+1) for _ in range(n*10+1)] for _ in range(n+1)]
dp[0][0][0] = 0
for i in range(n):
a,b,c = list(map(int,input().split()))
for ai in range(i*10+11):
for bi in range(i*10+11):
if ai>=a and bi>=b:
... | p03806 |
N,Ma,Mb=list(map(int, input().split()))
A = []
B = []
C = []
for i in range(N):
a,b,c=list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
sa = sum(A)
sb = sum(B)
dp = [[[10000]*(sb+1) for _ in range(sa+1)] for _ in range(N+1)]
dp[0][0][0] = 0
ta = 0
tb = 0
for i in range(N):
... | N,Ma,Mb=list(map(int, input().split()))
A = []
B = []
C = []
for i in range(N):
a,b,c=list(map(int, input().split()))
A.append(a)
B.append(b)
C.append(c)
sa = sum(A)
sb = sum(B)
dp = [[[10000]*(sb+1) for _ in range(sa+1)] for _ in range(N+1)]
dp[0][0][0] = 0
ta = 0
tb = 0
for i in range(N):
... | p03806 |
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意
n,A,B = [int(i) for i in readline().split()]
abc = [[int(i) for i in readline().split()] for j in range(n)]
res1 = []
res2 = []
eq = 10**9
def dfs(s,g,amari,yen,List):
global e... | # coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意
n,A,B = [int(i) for i in readline().split()]
abc = [[int(i) for i in readline().split()] for j in range(n)]
res1 = []
res2 = []
eq = 10**9
"""
def dfs(s,g,amari,yen,List):
globa... | p03806 |
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意
n,A,B = [int(i) for i in readline().split()]
abc = [[int(i) for i in readline().split()] for j in range(n)]
res1 = []
res2 = []
eq = 10**9
"""
def dfs(s,g,amari,yen,List):
globa... | # coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意
n,A,B = [int(i) for i in readline().split()]
abc = [[int(i) for i in readline().split()] for j in range(n)]
ans = 10**9
d = {0:0}
for i in range(n):
nd = {}
a,b,c = abc[i]
... | p03806 |
n,ma,mb=list(map(int,input().split()))
dp=[[0]*401 for _ in range(401)]
for _ in range(n):
a,b,c=list(map(int,input().split()))
for i in range(400,-1,-1):
for j in range(400,-1,-1):
if i-a<0 or j-b<0:
continue
else:
if dp[i-a][j-b]==0:
continue
else:
... | import sys
n, ma, mb = list(map(int, input().split()))
abc = []
for _ in range(n):
a, b, cost = list(map(int, input().split()))
abc.append((a, b, cost))
def main():
sa = 0
sb = 0
for i in range(n):
sa += abc[i][0]
sb += abc[i][1]
res = [[float('infinity')]... | p03806 |
from copy import deepcopy
N, MA, MB = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
DP = [[100000 for _ in range(401)] for _ in range(401)]
DP[0][0] = 0
S = {(0, 0)}
for a, b, c in X:
DP2 = deepcopy(DP)
for sa, sb in S:
if DP[sa+a][sb+b] > DP2[sa]... | from collections import defaultdict
N, MA, MB = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
dp = defaultdict()
dp[(0, 0)] = 0
for a, b, c in X:
dp2 = defaultdict()
for sa, sb in dp:
if (sa+a, sb+b) not in dp:
dp2[(sa+a, sb+b)] = dp[(... | p03806 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.