input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 10001) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for a, b in zip(*[iter(AB)] * 2):
for i in range(H):
dp[i + a] = ... | # E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 10001) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for a, b in zip(*[iter(AB)] * 2):
for i in range(H):
if dp[i] + b... | p02787 |
H, N = list(map(int, input().split()))
AB = [[None,None]]
for i in range(N):
AB.append(list(map(int, input().split())))
dp = [[int(1e8) for i in range(H+1)] for j in range(N+1)]
for n in range(N+1):
dp[n][0] = 0
for n in range(1,N+1):
for h in range(1,H+1):
ionly_n = int(h/AB[n][0]) + 1
can... | H, N = list(map(int, input().split()))
AB = [[None,None]]
for i in range(N):
AB.append(list(map(int, input().split())))
dp = [int(1e8) for i in range(H+1)]
dp[0] = 0
for h in range(1,H+1):
cand = []
for n in range(1,N+1):
if h - AB[n][0] < 0:
cand.append(dp[0] + AB[n][1])
else:
... | p02787 |
H, N = list(map(int, input().split()))
AB = [[None,None]]
for i in range(N):
AB.append(list(map(int, input().split())))
dp = [int(1e8) for i in range(H+1)]
dp[0] = 0
for h in range(1,H+1):
cand = [dp[0] + AB[n][1] if h - AB[n][0] < 0 else dp[h-AB[n][0]] + AB[n][1]for n in range(1,N+1) ]
dp[h] = min(ca... | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
magic = [list(map(int, input().split())) for _ in range(N)]
max_damage = max(damage for damage, cost in magic)
dp = [0] * (H + max_damage)
for x in range(1, H + max_damage):
dp[x] = min(dp[x - damage] + cost for damage, cost i... | p02787 |
H,N=list(map(int,input().split()))
A=[]
B=[]
for i in range(N):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
DP=[[0]*(H+max(A)) for i in range(N)]
DP.insert(0,[10**8+1]*(H+max(A)))
DP[0][0]=0
for i in range(1,N+1):
for j in range(1,H+max(A)):
if j-A[i-1]>0:
DP[i... | H,N=list(map(int,input().split()))
A=[]
B=[]
for i in range(N):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
DP=[[0]*(H+max(A)) for i in range(N)]
DP.insert(0,[10**8+1]*(H+max(A)))
DP[0][0]=0
for i in range(1,N+1):
for j in range(1,H+1):
if j-A[i-1]>0:
DP[i][j]=... | p02787 |
from collections import defaultdict
def dp(H, N, a, b):
d = defaultdict(lambda: INF)
d[0] = 0
max_a = max(a)
for h in range(1, H + max_a):
d[h] = min([d[h - a[i]] + b[i] for i in range(N)])
return min([d[H + h] for h in range(max_a)])
INF = 10 ** 10
H, N = list(map(int, input().split()))
a = [... | def dp(H, N, ab):
max_a = max([ab[i][0] for i in range(N)])
d = [INF for _ in range(H + max_a)]
d[0] = 0
for h in range(1, H + max_a):
d[h] = min(d[h - a] + b for a, b in ab)
return min(d[H:])
INF = 10 ** 10
H, N = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for _ in ra... | p02787 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
H, N = list(map(int, input().split()))
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
INF... | #!/usr/bin/env python3
def main():
H, N = list(map(int, input().split()))
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
#1次元DPに書き換え
INF = 10**12
dp = [INF] * (H+1)
dp[0] = 0
for i in range(N):
for j in ra... | p02787 |
import sys
import functools
def inpl():
return list(map(int, input().split()))
@functools.lru_cache(maxsize=None)
def solve(h):
if h <= 0:
return 0
ret_val = float("inf")
for a, b in AB:
ret_val = min(ret_val, b + solve(h - a))
return ret_val
sys.setrecursio... | import sys
import functools
def inpl():
return list(map(int, input().split()))
@functools.lru_cache(maxsize=None)
def solve(h):
if h <= 0:
return 0
ret_val = float("inf")
for a, b in AB:
val = b + solve(h - a)
if val < ret_val:
ret_val = val
... | p02787 |
h, n = list(map(int, input().split()))
a_list = []
b_list = []
for _ in range(n):
a, b = list(map(int, input().split()))
a_list.append(a)
b_list.append(b)
max_a = max(a_list)
dp = [float('inf')] * (h + max_a + 1)
dp[0] = 0
cost = float('inf')
for i in range(h):
for j in range(n):
... | h, n = list(map(int, input().split()))
a_list = []
b_list = []
for _ in range(n):
a, b = list(map(int, input().split()))
a_list.append(a)
b_list.append(b)
max_a = max(a_list)
dp = [float('inf')] * (h + max_a + 1)
dp[0] = 0
for i in range(h):
for j in range(n):
dp[i + a_list... | p02787 |
H,N=list(map(int,input().split()))
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
maxA=max(AB)[0]
#dp[i] ひとつ前までの呪文で体力iを削るために必要な最小魔法消費量
dp=[float("inf")]*(H+maxA)
ndp=[float("inf")]*(H+maxA)
dp[0]=0
for j in range(N):
for i in range(H+1):
ndp[i]=dp[i]
cost=AB[j][1]
... | H,N=list(map(int,input().split()))
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
maxA=max(AB)[0]
#dp[i] 敵に合計iダメージを与えるのに必要な最小魔力量
dp=[float("inf")]*(H+maxA)
dp[0]=0
for i in range(H):
for fire,cost in AB:
dp[i+fire]=min(dp[i+fire],dp[i]+cost)
ans=min(dp[H:])
print(ans)
... | p02787 |
(h, n), *m = [[*list(map(int, i.split()))] for i in open(0)]
dp = [0] + [10**9] * h
for i in range(1, h + 1):
for a, b in m:
dp[i] = min(dp[i], dp[max(i-a,0)]+b)
print((dp[-1]))
| (h, n), *m = [[*list(map(int, i.split()))] for i in open(0)]
dp = [0] * 20001
for i in range(1, h + 1):
dp[i] = min(dp[i-a]+b for a, b in m)
print((dp[h]))
| p02787 |
(h, n), *m = [[*list(map(int, i.split()))] for i in open(0)]
dp = [0] * 20001
for i in range(1, h + 1):
dp[i] = 10**9
for a, b in m:
dp[i] = min(dp[i], dp[i-a]+b)
print((dp[h]))
| (h, n), *m = [[*list(map(int, i.split()))] for i in open(0)]
dp = [0] * 20001
for i in range(1, h + 1):
dp[i] = min(dp[i-a]+b for a, b in m)
print((dp[h]))
| p02787 |
H, N=list(map(int, input().split()))
dp=[0]+[float('inf') for _ in range(2*10**4)]
for _ in range(N):
a, b=list(map(int, input().split()))
for i in range(a, H+a):
dp[i]=min(dp[i-a]+b, dp[i])
print((min(dp[H:]))) | H, N=list(map(int, input().split()))
AB=[list(map(int, input().split())) for _ in range(N)]
dp=[0]+[float('inf') for _ in range(2*10**4)]
for a, b in AB:
for i in range(a, H+a):
dp[i]=min(dp[i-a]+b, dp[i])
print((min(dp[H:]))) | p02787 |
# coding: utf-8
H,N=list(map(int,input().split()))
AB=[[0,0]]
for i in range(N):
AB.append(list(map(int,input().split())))
INF=10**9
dp=[[INF for i in range(H+1)] for j in range(N+1)]
for i in range(N+1):
dp[i][0]=0
for i in range(1,N+1):
for j in range(1,H+1):
dp[i][j]=min(dp[i... | # coding: utf-8
H,N=list(map(int,input().split()))
AB=[[0,0]]
for i in range(N):
AB.append(list(map(int,input().split())))
INF=10**9
dp=[[INF for i in range(H+1)] for j in range(N+1)]
for i in range(N+1):
dp[i][0]=0
for i in range(1,N+1):
for j in range(1,H+1):
dp[i][j]=min(dp[i... | p02787 |
# coding: utf-8
H,N=list(map(int,input().split()))
AB=[[0,0]]
for i in range(N):
AB.append(list(map(int,input().split())))
INF=10**9
dp=[[INF for i in range(H+1)] for j in range(N+1)]
for i in range(N+1):
dp[i][0]=0
for i in range(1,N+1):
for j in range(1,H+1):
dp[i][j]=min(dp[i... | # coding: utf-8
H,N=list(map(int,input().split()))
AB=[[0,0]]
for i in range(N):
AB.append(list(map(int,input().split())))
INF=10**9
dp=[INF for i in range(H+1)]
dp[0]=0
for i in range(1,N+1):
for j in range(1,H+1):
dp[j]=min(dp[j],dp[max(0,j-AB[i][0])] + AB[i][1])
print((dp[H])) | p02787 |
# coding: utf-8
H,N=list(map(int,input().split()))
AB=[[0,0]]
for i in range(N):
AB.append(list(map(int,input().split())))
INF=10**9
dp=[INF for i in range(H+1)]
dp[0]=0
for i in range(1,N+1):
for j in range(1,H+1):
dp[j]=min(dp[j],dp[max(0,j-AB[i][0])] + AB[i][1])
print((dp[H])) | # coding: utf-8
H,N=list(map(int,input().split()))
AB=[[0,0]]
for i in range(N):
AB.append(list(map(int,input().split())))
INF=10**9
dp=[INF for i in range(H+1)]
dp[0]=0
for i in range(1,N+1):
damage ,mp = AB[i]
for j in range(1,H+1):
dp[j]=min(dp[j],dp[max(0 , j - damage)] +... | p02787 |
h,n = list(map(int,input().split()))
skills = []
for _ in range(n):
a,b = list(map(int,input().split()))
skills.append((a,b))
dp = [float('inf') for _ in range(h+max(skills,key=lambda x:x[1])[1] + 1)]
dp[0] = 0
for i in range(len(dp)):
if dp[i] ==float('inf'):
continue
for damage,mp in skills:... | h,n = list(map(int,input().split()))
magic = []
maxa = 0
for _ in range(n):
a,b = list(map(int,input().split()))
maxa = max(maxa,a)
magic.append((a,b))
#magic.sort()
dp = [float('inf') for _ in range(h + maxa)]
dp[0] = 0
for i in range(h):
for a,b in magic:
if i+a > h+maxa:
continue
... | p02787 |
h,n = list(map(int,input().split()))
now = [10**10 for _ in range(h+1)]
now[0] = 0
for _ in range(n):
a,b = list(map(int,input().split()))
for i in range(1,h+1):
if i - a < 0:
now[i] = min(now[i],b)
else:
now[i] = min(now[i],now[i-a]+b)
print((now[-1])) | h,n = list(map(int,input().split()))
now = [10**10 for _ in range(h+1)]
now[0] = 0
for _ in range(n):
a,b = list(map(int,input().split()))
for i in range(1,h+1):
if i - a >= 0:
now[i] = min(now[i],now[i-a]+b)
else:
now[i] = min(now[i],b)
print((now[-1])) | p02787 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
h, n = list(map(int, input().split()))
ab = set([])
for _ in range(n):
ab.add(tuple(map(int,input().split())))
l = h + max(a for a, _ in ab)
#DP[i] = i までの魔法でモンスターの体力を減らすため消耗する魔力の最小値
dp = [10**8+1] * l
dp[0] = 0
for i in range(l): #最大L回繰り返せばよい
for a, ... | #!/usr/bin python3
# -*- coding: utf-8 -*-
h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
#DP[i] = i までの魔法でモンスターの体力を減らすため消耗する魔力の最小値
dp = [0] * 20001
for i in range(h):
dp[i] = min(dp[i-a] + b for a, b in ab)
print((dp[h-1]))
| p02787 |
H, N = list(map(int, input().split()))
hpdown = list()
mpdown = list()
for i in range(N):
a, b = list(map(int, input().split()))
hpdown.append(a)
mpdown.append(b)
hmax = max(max(mpdown)*2+1, H+max(mpdown)+1)
dp = [10 ** 9] * (hmax)
dp[0] = 0
for h in range(1, hmax):
for n in range(N):
if(h-h... | H, N = list(map(int, input().split()))
hpdown = list()
mpdown = list()
for i in range(N):
a, b = list(map(int, input().split()))
hpdown.append(a)
mpdown.append(b)
hmax = H+(max(hpdown)+1)
dp = [10 ** 9] * (hmax)
dp[0] = 0
for h in range(1, hmax):
for n in range(N):
if(h-hpdown[n]>=0):
... | p02787 |
h,n = list(map(int,input().split()))
ls = [list(map(int,input().split())) for _ in range(n)]
amax = max(a for a,b in ls)
dp = [0]*(h+amax)
for i in range(1,h+amax):
dp[i] = min(dp[max(0,i-a)]+b for a,b in ls)
print((min(dp[h:])))
| h,n = list(map(int,input().split()))
ls = [list(map(int,input().split())) for _ in range(n)]
amax = max(a for a,b in ls)
dp = [0]*(h+amax)
for i in range(1,h+amax):
dp[i] = min(dp[i-a]+b for a,b in ls)
print((min(dp[h:])))
| p02787 |
import sys
import heapq
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def main():
H,N = LI()
M = []
for i in range(N):
M.append(LI())
dp = {0:H}
h = []
heapq.heappush(h,0)
nxt = -1
for i in range(10**9... | import sys
import heapq
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def main():
H,N = LI()
M = []
for i in range(N):
M.append(LI())
dp = [10**10] * (H+1)
dp[0] = 0
for i in range(H):
for j in range(N)... | p02787 |
h,n=list(map(int,input().split()))
a=[]
b=[]
for i in range(n):
x,y=list(map(int,input().split()))
a.append(x)
b.append(y)
INF=float("inf")
dp=([[INF]*(1+h) for i in range(1+n)])
dp[0][0]=0
for i in range(n):
# print(dp)
for j in range(h+1):
# print("i+1=",i+1,"j... | def LI():
return list(map(int,input().split()))
h,n=LI()
a=[]
b=[]
for _ in range(n):
x,y=LI()
a.append(x)
b.append(y)
INF=10**15
dp=[INF]*(h+max(a)+10)
dp[0]=0
for i in range(0,h+1):
for j,k in zip(a,b):
dp[i+j]=min(dp[i+j],dp[i]+k)
ans=INF
for i in dp[h:]:
ans=min(ans,i)
prin... | p02787 |
import sys
f=lambda:list(map(int,sys.stdin.readline().split()))
h,n=f()
INF=10**9
dp=[[INF]*(h+1) for _ in range(n+1)]
dp[0][0]=0
for i in range(n):
a,b=f()
for j in range(h+1):
dp[i+1][j]=min(dp[i][j],dp[i+1][max(j-a,0)]+b)
print((dp[n][h])) | import sys
f=lambda:list(map(int,sys.stdin.readline().split()))
h,n=f()
dp=[10**9]*(h+1)
dp[0]=0
for i in range(n):
a,b=f()
for j in range(h+1):
dp[j]=min(dp[j],dp[max(j-a,0)]+b)
print((dp[h])) | p02787 |
import sys
f=lambda:list(map(int,sys.stdin.readline().split()))
h,n=f()
dp=[10**9]*(h+1)
dp[0]=0
for i in range(n):
a,b=f()
for j in range(h+1):
dp[j]=min(dp[j],dp[max(j-a,0)]+b)
print((dp[h])) | f=lambda:list(map(int,input().split()))
h,n=f()
dp=[0]+[10**9]*h
for i in range(n):
a,b=f()
for j in range(h+1): dp[j]=min(dp[j],dp[max(j-a,0)]+b)
print((dp[h])) | p02787 |
H, N = list(map(int, input().split()))
magic = [list(map(int, input().split())) for _ in range(N)]
max_magic = 0
for a, _ in magic:
max_magic = max(max_magic, a)
amount = H + 1
dp = [float('inf')] * (amount + max_magic)
dp[0] = 0
ret = float('inf')
for amt in range(1, amount + max_magic):
t ... | H, N = list(map(int, input().split()))
magic = [list(map(int, input().split())) for _ in range(N)]
max_magic = 0
for a, _ in magic:
max_magic = max(max_magic, a)
amount = H + 1
dp = [0] * (amount + max_magic)
dp[0] = 0
ret = float('inf')
for amt in range(1, amount + max_magic):
t = [dp[amt -... | p02787 |
import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
a = []
for _ in range(N):
u, v = list(map(int, input().split()))
a.append((u, v))
dp = [float("inf")] * (H + 1)
dp[H] = 0
for i in range(N):
for j in range(H, -1, -1):
dp[max(j - a[i][0], 0)] = min(dp[max(j - a[i][0], 0)],... | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
dp = [float("inf")] * (H + 1)
dp[H] = 0
for _ in range(N):
a, b = list(map(int, input().split()))
for x in range(H, -1, -1):
dp[max(0, x - a)] = min(dp[max(0, x - a)], dp[x] + b)
print((dp[0])) | p02787 |
h,n = list(map(int,input().split()))
a = [0]*n
b = [0]*n
for i in range(n):
a[i],b[i] = list(map(int,input().split()))
dp = [float('inf')]*(h+1)
dp[0] = 0
for i in range(n):
for j in range(h+1):
if dp[j] != float('inf'):
nj = j + a[i]
if nj >= h:
nj ... | h,n = list(map(int,input().split()))
a = [0]*n
b = [0]*n
for i in range(n):
a[i],b[i] = list(map(int,input().split()))
dp = [1e100]*(h+1)
dp[0] = 0
for i in range(n):
for j in range(h+1):
if dp[j] != 1e100:
nj = j + a[i]
if nj >= h:
nj = h
... | p02787 |
h,n = list(map(int,input().split()))
ab = []
ma = 0
for i in range(n):
a,b = list(map(int,input().split()))
ab.append([a,b])
ma = max(ma,a)
dp = [10**10]*(h+ma+1)
dp[0] = 0
for i in range(1,h+ma+1):
dp[i] = min([dp[max(i-a,0)]+b for a,b in ab])
print((min(dp[h:]))) | h,n = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(n)]
ma = max(a for a,b in ab)
dp = [10**10]*(h+ma+1)
dp[0] = 0
for i in range(1,h+ma+1):
dp[i] = min(dp[i-a]+b for a,b in ab)
print((min(dp[h:]))) | p02787 |
H, N= list(map(int,input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
ma = max(A)
dp = [float("inf")] * (H + ma)
dp[0] = 0
for i in range(N):
a = A[i]
b = B[i]
for j in range(1, H + ma):
dp[j] = min(dp[j - a] + b, dp[j])
print((... | H, N= list(map(int,input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
ma = max(A)
dp = [0] * (H + ma)
dp[0] = 0
for i in range(N):
a = A[i]
b = B[i]
for j in range(1, H + ma):
if dp[j] == 0:
dp[j] = dp[j - a] + b
... | p02787 |
import math
import sys
input = sys.stdin.readline
def main():
H,N = list(map(int,input().split()))
A,B = [],[]
ap = A.append
bp = B.append
for _ in range(N):
a,b = list(map(int,input().split()))
ap(a)
bp(b)
dp = [[0 for _ in range(H+1)] for _ in range(N)]
for i in range(1,H+1):
dp[0][... | import math
import sys
input = sys.stdin.readline
def main():
H,N = list(map(int,input().split()))
A,B = [],[]
ap = A.append
bp = B.append
for _ in range(N):
a,b = list(map(int,input().split()))
ap(a)
bp(b)
dp = [[0 for _ in range(H+1)] for _ in range(N)]
for i in range(1,H+1):
dp[0][... | p02787 |
from collections import defaultdict
H, N= list(map(int,input().split()))
A = []
B = []
for i in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
dp = defaultdict(lambda : 10**10)
dp[0] = 0
for i in range(0,N):
ndp = dp.copy()
a = A[i]
b = B[i]
for h,m ... | from collections import defaultdict
H, N= list(map(int,input().split()))
A = []
B = []
for i in range(N):
a,b = list(map(int,input().split()))
A.append(a)
B.append(b)
dp = [10**10]*(H+1)
dp[0] = 0
for i in range(0,N):
a = A[i]
b = B[i]
for h in range(H+1-a):
dp[h+a] = m... | p02787 |
h,n=list(map(int,input().split()))
a=[]
ab=[]
for i in range(n):
aabb=list(map(int,input().split()))
ab.append(aabb)
a.append(aabb[0])
loop=h+max(a)
cost=[-1 for i in range(loop)]
cost[0]=0
i=0
costlist=[]
while i<loop:
costlist.clear()
for j in range(n):
ii=i-ab[j][0]
... | h,n=list(map(int,input().split()))
a=[]
ab=[]
for i in range(n):
aabb=list(map(int,input().split()))
ab.append(aabb)
a.append(aabb[0])
loop=h+max(a)
cost=[-1 for i in range(loop)]
cost[0]=0
i=0
costlist=[]
while i<loop:
costlist=[]
for j in range(n):
ii=i-ab[j][0]
... | p02787 |
h,n = [int(i) for i in input().split()]
l = [[int(i) for i in input().split()] for _ in range(n)]
inf = float('inf')
memo = [inf for _ in range(h+1)]
memo[0] = 0
for i in range(h+1):
for x,y in l:
# これめっちゃ大事やん
j = min(i+x, h)
memo[j] = min(memo[j],memo[i] + y)
print((memo[-1]))
... | h,n = [int(i) for i in input().split()]
l = [[int(i) for i in input().split()] for _ in range(n)]
inf = float('inf')
memo = [inf for _ in range(h+1)]
memo[0] = 0
for i in range(h+1):
for x,y in l:
j = min(i+x, h)
memo[j] = min(memo[j],memo[i] + y)
print((memo[-1])) | p02787 |
def main():
H, N = [int(x) for x in input().split()]
magic = [list(map(int, input().split())) for _ in range(N)]
# print(magic)
max_a = max(a for a, _ in magic)
dp = [float("inf") for _ in range(H + max_a)]
dp[0] = 0
for i in range(1, H+max_a):
dp[i] = min(dp[i-a] + b for... | def main():
H, N = [int(x) for x in input().split()]
magic = [list(map(int, input().split())) for _ in range(N)]
# print(magic)
max_a = max(a for a, _ in magic)
dp = [10**18 for _ in range(H + max_a)]
dp[0] = 0
for i in range(1, H+max_a):
dp[i] = min(dp[i-a] + b for a, b in... | p02787 |
H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
max_ab = max(AB)
dp = [-1]*(H+max_ab[0]+1)
dp[0] = 0
for i in range(1, H + max_ab[0]):
lst = [dp[i-AB[j][0]] + AB[j][1] for j in range(N) if (i >= AB[j][0] and dp[i-AB[j][0]]!=-1)]
if lst!=[]:dp[i] = min(l... | H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
max_ab = max(AB)
dp = [10**10]*(H+max_ab[0])
dp[0] = 0
for i in range(1, H + max_ab[0]):
dp[i] = min(dp[i - a] + b for a, b in AB)
print((min(dp[H:]))) | p02787 |
import sys
input = sys.stdin.readline
H, N = list(map(int, input().split(" ")))
dp = [[float('inf') for i in range(H + 1)] for j in range(N + 1)]
for i in range(N + 1):
dp[i][0] = 0
for i in range(N):
A, B = list(map(int, input().split(" ")))
for j in range(H + 1):
dp[i + 1][j] = min(dp... | import sys
input = sys.stdin.readline
H, N = list(map(int, input().split(" ")))
dp = [float('inf') for i in range(H + 1)]
dp[0] = 0
for i in range(N):
A, B = list(map(int, input().split(" ")))
for j in range(H + 1):
if dp[j] != float('inf'):
dp[min(j + A, H)] = min(dp[min(j + A,... | p02787 |
import math
import sys
H, N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for i in range(N)]
cost = [100000000 for _ in range(H)]
min_cost = 100000000
cost[0] = 0
attack_num = 0
for k in range(H):
for j in range(N):
if k + AB[j][0] >= H:
if min_cost >... |
def main():
H, N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for i in range(N)]
cost = [100000000 for _ in range(H)]
min_cost = 100000000
cost[0] = 0
for k in range(H):
for j in range(N):
if k + AB[j][0] >= H:
... | p02787 |
import sys
sys.setrecursionlimit(500000)
h, n = 0, 0
ab = None
dp = dict()
def input() -> str:
return sys.stdin.readline().rstrip()
def f(i, j):
if j <= 0:
return 0
if i < 0 and j > 0:
return float("inf")
ij = n * j + i
if ij not in dp:
dp[ij] = min([f(i -... | import sys
def input() -> str:
return sys.stdin.readline().rstrip()
h, n = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for _ in range(n)]
m = max(a for a, _ in ab)
dp = [0] * (h + m * 2 + 1)
for i in range(-m, h + m + 1):
if i <= 0:
dp[i] = 0
else:
d... | p02787 |
# AtCoder Beginner Contest 153
# E - Crested Ibis vs Monster
# https://atcoder.jp/contests/abc153/tasks/abc153_e
H, N, *A = list(map(int, open(0).read().split()))
*A, = list(zip(*[iter(A)]*2))
INF = 1 << 30
dp = [INF]*(H+1)
dp[0] = 0
for i, (a, b) in enumerate(A):
for h in range(H+1):
mh = min(H... | import sys
input = sys.stdin.buffer.readline
H, N = list(map(int, input().split()))
A = [tuple(map(int, line.split())) for line in sys.stdin.buffer.readlines()]
INF = 1 << 30
dp = [INF]*(H+1)
dp[H] = 0
for i in range(N):
a, b = A[i]
for h in range(H, -1, -1):
x = h-a if h-a > 0 else 0
... | p02787 |
#from pprint import pprint
#from collections import deque
#from collections import defaultdict
#from collections import Counter
#from copy import deepcopy
#from itertools
#import sys
#sys.setrecursionlimit(N) #N回まで再起を許可する。
# = map(int,input().split())
# = list(map(int,input().split()))
# = [list(map... | #from pprint import pprint
#from collections import deque
#from collections import defaultdict
#from collections import Counter
#from copy import deepcopy
#from itertools
#import sys
#sys.setrecursionlimit(N) #N回まで再起を許可する。
# = map(int,input().split())
# = list(map(int,input().split()))
# = [list(map... | p02787 |
#from pprint import pprint
#from collections import deque
#from collections import defaultdict
#from collections import Counter
#from copy import deepcopy
#from itertools
#import sys
#sys.setrecursionlimit(N) #N回まで再起を許可する。
# = map(int,input().split())
# = list(map(int,input().split()))
# = [list(map... | #from pprint import pprint
#from collections import deque
#from collections import defaultdict
#from collections import Counter
#from copy import deepcopy
#from itertools
#import sys
#sys.setrecursionlimit(N) #N回まで再起を許可する。
# = map(int,input().split())
# = list(map(int,input().split()))
# = [list(map... | p02787 |
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions ... | from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import permutations,combinations
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions ... | p02787 |
H,N=list(map(int,input().split()))
ABC=[]
for _ in range(N):
a,b=list(map(int,input().split()))
ABC.append((a,b,a/b))
ABC=sorted(ABC, key=lambda x:x[2], reverse=True)
A=[ABC[i][0] for i in range(N)]
B=[ABC[i][1] for i in range(N)]
dp=[[float('inf')]*(H+1) for i in range(N+1)]
for i in range(N+1):
dp[i][... | H,N=list(map(int,input().split()))
ABC=[]
for _ in range(N):
a,b=list(map(int,input().split()))
ABC.append((a,b,a/b))
A=[ABC[i][0] for i in range(N)]
B=[ABC[i][1] for i in range(N)]
dp=[[float('inf')]*(H+1) for i in range(N+1)]
for i in range(N+1):
dp[i][0]=0
for i in range(N):
for j in range(1,H... | p02787 |
h, n = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(n)]
dp = [10 ** 8 + 1 for i in range(h + 10**4 + 1)]
dp[0] = 0
for i in range(h+1):
if dp[i] == 10 ** 8 + 1:
continue
for j in range(n):
x = dp[i] + l[j][1]
if dp[i + l[j][0]] > x:
dp[i + l[j... | def main():
from sys import stdin
readline = stdin.readline
H, N = list(map(int, readline().split()))
AB = [list(map(int, readline().split())) for _ in range(N)]
dp = [100000000] * (H + 10 ** 4 + 1)
dp[0] = 0
for i in range(H):
if dp[i] == 100000000:
continue
... | p02787 |
from sys import stdin
readline = stdin.readline
H, N = list(map(int, readline().split()))
AB = [list(map(int, readline().split())) for _ in range(N)]
dp = [100000000] * (H + 10 ** 4 + 1)
dp[0] = 0
for i in range(H):
if dp[i] == 100000000:
continue
for a, b in AB:
t = dp[i] + b
... | def main():
h, n = list(map(int, input().split()))
l = [list(map(int, input().split())) for i in range(n)]
dp = [10 ** 8 + 1 for i in range(h + 10 ** 4 + 1)]
dp[0] = 0
for i in range(h):
if dp[i] == 10 ** 8 + 1:
continue
for a, b in l:
x = dp[i] + b
if dp[i + a] > x:
... | p02787 |
INF = 10 ** 18
H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
dp = [[INF] * (H + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(H + 1):
if j < AB[i][0]:
dp[i + 1][j] = min(dp[i][j], dp[i + 1][0] + AB[i][1])
... | import sys
input = sys.stdin.readline
INF = 10 ** 18
H, N = list(map(int, input().split()))
dp = [INF] * (H + 1)
dp[0] = 0
for i in range(N):
A, B = list(map(int, input().split()))
for j in range(H + 1):
if j < A:
dp[j] = min(dp[j], dp[0] + B)
else:
dp... | p02787 |
H,N=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(N)]
x=max(a for a,b in ab)
dp=[0]*(H+x)
for i in range (1,H+x):
dp[i]=min(dp[i-a]+b for a,b in ab)
print((dp[H])) | H,N=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(N)]
x=max(a for a,b in ab)
dp=[0]*(H+x)
for i in range (1,H+1):
dp[i]=min(dp[i-a]+b for a,b in ab)
print((dp[H])) | p02787 |
H,N=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(N)]
x=max(a for a,b in ab)
dp=[0]*(H+1)
for i in range (1,H+1):
dp[i]=min(dp[max(i-a,0)]+b for a,b in ab)
print((dp[H])) | H,N=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(N)]
dp=[0]*(H+10**5)
for i in range (1,H+1):
dp[i]=min(dp[i-a]+b for a,b in ab)
print((dp[H])) | p02787 |
H, N = list(map(int, input().split()))
magic = [list(map(int, input().split())) for i in range(N)]
# dp[damage] := モンスターに damage を与えるために必要な最小コスト
# damage = 0,1,2,...,H
dp = [10**9] * (H + 1)
dp[0] = 0
for h in range(H):
for damage, cost in magic:
next_index = min(h + damage, H)
dp[next_... | H, N = list(map(int, input().split()))
AB = []
for _ in range(N):
A, B = list(map(int, input().split()))
AB.append([A, B])
dp = [10**9] * (H + 1)
dp[0] = 0
for i in range(H):
for a, b in AB:
if i + a <= H:
dp[i + a] = min(dp[i + a], dp[i] + b)
else:
dp[H] ... | p02787 |
import math
h,n = list(map(int,input().split()))
ab = []
for i in range(n):
ab.append([int(i) for i in input().split()])
ab.sort()
dp = []
for i in range(h + ab[n-1][0]):
dp.append(pow(2, 31) - 1)
dp[0] = 0
for i in range(1, len(dp)):
tmp = dp[i]
for j in range(n):
#print(j-... | import math
h,n = list(map(int,input().split()))
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i], b[i] = list(map(int,input().split()))
dp = []
for i in range(h + max(a)):
dp.append(pow(2, 31) - 1)
dp[0] = 0
for i in range(1, len(dp)):
'''
tmp = dp[i]
... | p02787 |
def num():
from sys import stdin
h, n = list(map(int, input().split()))
magic = [list(map(int, stdin.readline().split())) for _ in range(n)]
INF = float('inf')
ans = [INF]*(h+1)
ans[-1] = 0
for i in range(h, 0, -1):
if ans[i] != INF:
for j in magic:
... | def num():
from sys import stdin
h, n = list(map(int, input().split()))
magic = [list(map(int, stdin.readline().split())) for _ in range(n)]
INF = float('inf')
ans = [INF]*(h+1)
ans[-1] = 0
for i in range(h, 0, -1):
if ans[i] != INF:
for j in magic:
... | p02787 |
h,n=list(map(int,input().split()))
ab=[]
p=0
for i in range(n):
a,b=list(map(int,input().split()))
p=max(p,a)
ab.append([a,b])
dp=[[10**9]*(p+1+h) for _ in range(n+1)]
for i in range(n+1):
dp[i][0]=0
for i in range(n):
for j in range(p+h):
if j+1-ab[i][0]>=0:
dp[i+1][j+1]=min(dp[i][j+1],dp[i+1]... | def main():
inf=10**9
h,n=list(map(int,input().split()))
ab=[]
r=0
for i in range(n):
a,b=list(map(int,input().split()))
ab.append((a,b))
r=max(r,a)
#dp[number][damage]
dp=[[inf for _ in range(r+h)]for _ in range(n+1)]
for i in range(n+1):
dp[i][0]=0
for i in range(n):
for j in range(r+... | p02787 |
import sys
input = sys.stdin.buffer.readline
H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 15
dp = [INF] * (H + 1)
dp[0] = 0
for a, b in AB:
for i in range(H):
if dp[i] != INF:
dp[min(i + a, H)] = min(dp[min(i + a, H)], dp[i] + b)
... | import sys
input = sys.stdin.buffer.readline
H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 15
dp = [INF] * H
dp[0] = 0
answer = INF
for a, b in AB:
for i in range(H):
if dp[i] != INF:
if i + a < H:
dp[i + a] = min(dp[i +... | p02787 |
import math
H, N = tuple(map(int, input().split(" ")))
AB = []
for _ in range(N):
AB.append(tuple(map(int, input().split(" "))))
minpower = 10 ** 10
# dp[n][h] = 0 ~ n - 1 番目の魔法を使えた時、残り体力がhのモンスターを倒すために必要な魔力
dp = [[minpower for _ in range(H + 1)] for __ in range(N)]
for h in range(H):
dp[0][h] = mat... | import math
H, N = tuple(map(int, input().split(" ")))
AB = []
for _ in range(N):
AB.append(tuple(map(int, input().split(" "))))
minpower = 10 ** 8 + 1
# dp[n][h] = 0 ~ n - 1 番目の魔法を使えた時、残り体力がhのモンスターを倒すために必要な魔力
dp = [[minpower for _ in range(H + 1)] for __ in range(N)]
for h in range(H):
dp[0][h] = ... | p02787 |
INF = 10**12
maxH = 2 * 10**4 + 10
def solve():
H, N = list(map(int, input().split()))
ABs = [tuple(map(int, input().split())) for _ in range(N)]
dp = [INF] * (maxH+1)
dp[0] = 0
for A, B in ABs:
for h in range(maxH-A+1):
h2 = h + A
dp2 = dp[h] + B
... | import sys
input = sys.stdin.readline
def solve():
INF = float('inf')
def min2(x, y): return x if x <= y else y
H, N = list(map(int, input().split()))
items = [tuple(map(int, input().split())) for _ in range(N)]
items.sort()
dp = [INF] * (H+1)
dp[0] = 0
for vi, wi in ... | p02787 |
import sys
import math # noqa
import bisect # noqa
import queue # noqa
def input():
return sys.stdin.readline().rstrip()
def main():
H, N = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
... | import sys
import math # noqa
import bisect # noqa
import queue # noqa
def input():
return sys.stdin.readline().rstrip()
def main():
H, N = list(map(int, input().split()))
A = [0 for _ in range(N)]
B = [0 for _ in range(N)]
for i in range(N):
a, b = list(map(int, input(... | p02787 |
import time
h, n = list(map(int, input().split()))
INF = 10 ** 20
dp = [INF for i in range(h + 10**4)]
dp[0] = 0
magic = []
for i in range(n):
magic.append(list(map(int, input().split())))
que = [0]
cc = [0]
m = 0
c = 0
for i in range(h):
if dp[i] == INF:
continue
for ... | def main():
inf = 10**9
H, N = list(map(int, input().split()))
AB = []
for n in range(N):
a, b = list(map(int, input().split()))
AB.append((a, b))
AB.sort(reverse=True, key=lambda x: x[0])
dp = [inf] * (H + 10 ** 4)
dp[0] = 0
for a, b in AB:
for h in ra... | p02787 |
import time
h, n = list(map(int, input().split()))
INF = 10 ** 9
magic = []
for i in range(n):
a, b = list(map(int, input().split()))
magic.append((a, b))
# t = time.time()
magic.sort(reverse=True, key=lambda x: x[0])
dp = [INF] * (h + 10 ** 4)
dp[0] = 0
c = 0
for a, b in magic:
f... | import time
def main():
h, n = list(map(int, input().split()))
INF = 10 ** 9
magic = []
for i in range(n):
a, b = list(map(int, input().split()))
magic.append((a, b))
# t = time.time()
magic.sort(reverse=True, key=lambda x: x[0])
dp = [INF] * (h + 10 ** 4)... | p02787 |
H, N = list(map(int, input().split()))
dp = [10 ** 18] * (H + 1)
dp[0] = 0
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(H):
nj = min(j + a, H) # nj: 次のjのindex, 配列外参照しないようにminをとる
dp[nj] = min(dp[nj], dp[j] + b)
print((dp[H]))
| def main():
H, N = list(map(int, input().split()))
dp = [10 ** 18] * (H + 1)
dp[0] = 0
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(H):
nj = min(j + a, H) # nj: 次のjのindex, 配列外参照しないようにminをとる
dp[nj] = min(dp[nj], dp[j] + b)
... | p02787 |
from heapq import heappush, heappop
min2 = lambda x,y: x if x < y else y
H,N = list(map(int,input().split()))
AB = [tuple(map(int,input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[1]/x[0])
cost = [(float('inf'),float('inf'))]*(H+1)
last = [0]*(H+1)
q = [((0,0), 0)]
while q:
cli, t = he... | min2 = lambda x,y: x if x < y else y
H,N = list(map(int,input().split()))
dp = [float('inf')]*(H+1)
dp[0] = 0
for _ in range(N):
a,b = list(map(int,input().split()))
for i,v in enumerate(dp):
j = min2(H,i+a)
dp[j] = min2(dp[j],v+b)
print((dp[-1])) | p02787 |
H, N = list(map(int, input().split()))
AB = [tuple(map(int, input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[1])
dp = [0] * (H + 1)
for h in range(1, H + 1):
dp[h] = min([dp[max(h - a, 0)] + b for a, b in AB])
print((dp[-1]))
| H, N = list(map(int, input().split()))
AB = [tuple(map(int, input().split())) for _ in range(N)]
dp = [0] * (H + 1)
for h in range(1, H + 1):
dp[h] = min([dp[max(h - a, 0)] + b for a, b in AB])
print((dp[-1]))
| p02787 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
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_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
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_replacement, produc... | p02787 |
H, N = list(map(int,input().split()))
magic = []
for i in range(N):
a,b = list(map(int,input().split()))
magic.append((a, b))
magic.sort(reverse=True)
amax, _ = magic[0]
INF = 1<<60
def solve():
btab = [INF] * (H+1)
btab[0] = 0
for h in range(1, min(amax, H)+1):
btab[h] = min... | H, N = list(map(int,input().split()))
magic = []
for i in range(N):
a,b = list(map(int,input().split()))
magic.append((a, b))
magic.sort(reverse=True)
amax, _ = magic[0]
INF = 1<<60
def solve():
btab = [INF] * (H+1)
btab[0] = 0
oneshot = min(amax, H)
for h in range(1, oneshot+1):... | p02787 |
h, n = list(map(int, input().split()))
dp = [0] + [float('inf')] * h
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(h):
nj = min(j + a, h)
dp[nj] = min(dp[nj], dp[j] + b)
print((dp[h])) | h, n = list(map(int, input().split()))
magics = [list(map(int, input().split())) for _ in range(n)]
max_a = max(a for a, b in magics)
dp = [0] * (h + max_a)
for i in range(1, h + max_a):
dp[i] = min(dp[i - a] + b for a, b in magics)
print((dp[h])) | p02787 |
H, N = list(map(int, input().split()))
inf = float('inf')
dp = [inf] * (H + 1)
dp[0] = 0
for _ in range(N):
A, B = list(map(int, input().split()))
for i in range(H):
t1 = i + A
if t1 > H:
t1 = H
t2 = dp[i] + B
if t2 < dp[t1]:
dp[t1] = t2
pri... | H, N = list(map(int, input().split()))
inf = float('inf')
dp = [inf] * (H + 1)
dp[0] = 0
for _ in range(N):
A, B = list(map(int, input().split()))
for i in range(H):
t1 = i + A
if t1 > H:
t1 = H
t2 = dp[i]
if t2 == inf:
continue
t2 +... | p02787 |
#!python3
from heapq import heappush, heappop, heapify
iim = lambda: list(map(int, input().rstrip().split()))
def resolve():
H, N = iim()
AB = [tuple(iim()) for i in range(N)]
AB.sort(key=lambda a: (a[0]/a[1], a[0]), reverse=True)
S = []
for a, b in AB:
n, m = divmod(H, a)... | #!python3
import sys
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop, heapify
iim = lambda: list(map(int, input().rstrip().split()))
def resolve():
H, N = iim()
AB = [tuple(iim()) for i in range(N)]
inf = float("inf")
AB.sort(key=lambda a: (a[0]/a[1], -a[0]), reverse=Tr... | p02787 |
def main():
INF = float('inf')
H,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
maxA = max(A for A,B in AB)
dp = [INF]*(H+maxA+1)
dp[0] = 0
for i in range(1,H+maxA):
dp[i] = min(dp[i-A]+B for A,B in AB)
print((min(dp[H:])))
... | def main():
H,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
maxA = max(A for A,B in AB)
dp = [0]*(H+maxA)
for i in range(0,H+maxA):
if i <= 0:
dp[i] = 0
else:
dp[i] = min(dp[i-A]+B for A,B in AB)
print... | p02787 |
def main():
INF = float('inf')
H,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
maxA = max(A for A,B in AB)
dp = [INF]*(H+maxA)
dp[0] = 0
for i in range(1,H+maxA):
dp[i] = min(dp[i-A]+B for A,B in AB)
print((min(dp[H:])))
... | def main():
INF = 10**9
H,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
maxA = max(A for A,B in AB)
dp = [INF]*(H+maxA)
dp[0] = 0
for i in range(1,H+maxA):
dp[i] = min(dp[i-A]+B for A,B in AB)
print((min(dp[H:])))
if __na... | p02787 |
import math
#Input
H, N = list(map(int, input().split()))
lstV = list()
lstC = list()
for i in range(N):
value, cost = list(map(int, input().split()))
lstV.append(value)
lstC.append(cost)
#DPMap
inf = 2**31 - 1
dp = list([inf]*(H + max(lstV)))
dp[0] = 0
for i in range(0,len(dp)):
if dp... | H, N = list(map(int, input().split()))
AB = list(list(map(int, input().split())) for _ in range(N))
def main2(H, N, AB):
inf = 2**31 -1
dp = [inf] * (H + max(a for a, _ in AB))
dp[0] = 0
for i in range(1, len(dp)):
dp[i] = min(dp[i-a]+b for a,b in AB)
print((min(dp[H:])))
main2(... | p02787 |
H, N = list(map(int, input().split()))
inf = 10 ** 9
dp = [([0] + [inf] * H) for _ in range(N + 1)]
for n in range(1, N + 1):
a, b = list(map(int, input().split()))
for h in range(1, H + 1):
tmp_min = dp[n - 1][h]
i = 1
while True:
if h - i * a <= 0:
... | H, N = list(map(int, input().split()))
List = [list(map(int, input().split())) for _ in range(N)]
inf = 10 ** 9
dp = [0] + [inf] * H
for h in range(1, H + 1):
for n in range(1, N + 1):
a, b = List[n - 1]
ref = h - a
if ref < 0: ref = 0
dp[h] = min(dp[h], dp[ref] + b)
... | p02787 |
import math
h, n = list(map(int, input().split()))
a = [0] * n
b = [0] * n
#print(a, b)
for i in range(n):
a[i], b[i] = list(map(int, input().split()))
#print(a)
#print(b)
INF = int(1e10)
dp = [[INF] * (h+1) for i in range(n+1)]
for i in range(h+1):
dp[0][i] = math.ceil(i / a[0]) * b[0]
for i i... | import math
h, n = list(map(int, input().split()))
a = [0] * n
b = [0] * n
#print(a, b)
for i in range(n):
a[i], b[i] = list(map(int, input().split()))
#print(a)
#print(b)
INF = int(1e10)
dp = [[INF] * (h+1) for i in range(n+1)]
for i in range(h+1):
dp[0][i] = math.ceil(i / a[0]) * b[0]
for i i... | p02787 |
h, n = list(map(int, input().split()))
x = [list(map(int, input().split())) for _ in range(n)]
a, b = x[0]
dp = [-(-i // a) * b for i in range(h + 1)]
for j in range(1, n):
a, b = x[j]
for i in range(h + 1):
if i >= a:
dp[i] = min(dp[i], dp[i - a] + b)
else:
dp[... | h, n = list(map(int, input().split()))
x = [list(map(int, input().split())) for _ in range(n)]
a, b = x[0]
dp = [-(-i // a) * b for i in range(h + 1)]
for j in range(1, n):
a, b = x[j]
for i in range(min(h + 1, a)):
dp[i] = min(dp[i], b)
for i in range(a, h + 1):
dp[i] = min(dp[i], ... | p02787 |
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):... | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
#import bisect
import copy
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):
if n - r < r: r = n ... | p02787 |
# ダイナミック・プログラミング
# PythonではTLEを起こしてしまう例
INF = float('inf')
H, N = list(map(int, input().split()))
A = []
B = []
for i in range(N):
a_i, b_i = list(map(int, input().split()))
A.append(a_i)
B.append(b_i)
dp = [[INF]*(H+1) for i in range(N+1)] # DP用配列
dp[0][0] = 0 # 初期化処理
for i in range(0,N... | # Problem E - Crested Ibis vs Monster
# input
H, N = list(map(int, input().split()))
magic_list = []
for i in range(N):
A, B = list(map(int, input().split()))
magic_list.append([A, B])
# initialization
dp = [float('INF')]*(H+1)
dp[0] = 0
mg_len = len(magic_list)
# dp
for i in range(1, H+1):
... | p02787 |
def chmin(dp, i, *x):
dp[i] = min(dp[i], *x)
INF = float("inf")
# dp[i] := min 消耗する魔力 to H -= i
h, n = list(map(int, input().split()))
dp = [0] + [INF]*h
for _ in [None]*n:
a, b = list(map(int, input().split()))
for j in range(h + 1):
chmin(dp, min(j + a, h), dp[j] + b)
print((dp[h])) | (h,n),*t=[list(map(int,o.split()))for o in open(0)]
d=[0]+[9e9]*h
for a,b in t:
for j in range(h+1):d[j]=min(d[j],d[max(0,j-a)]+b)
print((d[h])) | p02787 |
h,n=list(map(int,input().split()))
INF=10**9
dp=[INF]*(h+10)
A=[list(map(int,input().split())) for i in range(n)]
dp[0]=0
for a,b in A:
for i in range(h):
index=min(h,i+a)
x=dp[i]+b; y=dp[index]
dp[index]=min(x,y)
print((dp[h]))
| h,n=list(map(int,input().split()))
A=[list(map(int,input().split())) for i in range(n)]
ma=max(a for a,b in A)
dp=[0]*(h+ma)
for i in range(1,h+ma):
dp[i]=min(dp[i-a]+b for a,b in A)
print((min(dp[h:]))) | p02787 |
H, N = list(map(int, input().split()))
M = [tuple(map(int, input().split())) for i in range(N)]
dp = [(i + M[0][0] - 1) // M[0][0] * M[0][1] for i in range(H + 1)]
for i in range(N):
Ai, Bi = M[i]
ndp = [0] * (H + 1)
if Ai >= H:
ndp[0:H + 1] = [min(dp[j], Bi) for j in range(H + 1)]
els... | H, N = list(map(int, input().split()))
M = [tuple(map(int, input().split())) for i in range(N)]
dp = [(j + M[0][0] - 1) // M[0][0] * M[0][1] for j in range(H + 1)]
for i in range(1, N):
Ai, Bi = M[i]
ndp = [0] * (H + 1)
if Ai >= H:
ndp[0:H + 1] = [min(dp[j], Bi) for j in range(H + 1)]
... | p02787 |
H, N = list(map(int, input().split()))
A=[]
B=[]
for i in range(N):
a,b = list(map(int, input().split()))
A.append(a)
B.append(b)
#dp[i+1][h] := i番目の魔法まで見て、ライフをh以上削った時の最小魔力コスト
dp=[[float("inf")]*(H+1) for _ in range(N+1)]
for i in range(N):
for h in range(H+1):
if A[i]>=h:
dp[i+1][h] = min(dp[i][... | H, N = list(map(int, input().split()))
A=[]
B=[]
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
dp=[[float("inf")]*(H+1) for _ in range(N+1)]
dp[0][0]=0
for i in range(N):
a, b = A[i], B[i]
for j in range(H+1):
if a>=j:
dp[i+1][j] = min(dp[i][j], b)
else:... | p02787 |
H, N = list(map(int, input().split()))
a = [None] * (N + 1)
b = [None] * (N + 1)
for i in range(1, N + 1):
a[i], b[i] = list(map(int, input().split()))
# dp[i][j] = 魔法iまでからダメージの総和がj以上になるように選んだ時の魔力の最小値
# dp[i][j] = min(dp[i][j - a] + b, dp[i - 1][j])
dp = [[float('inf') for _ in range(H + 1)] for _ in ran... | H, N = list(map(int, input().split()))
# dp[i][j] = 魔法iまでからダメージの総和がj以上になるように選んだ時の魔力の最小値
# dp[i][j] = min(dp[i][j - a] + b, dp[i - 1][j])
dp = [[float('inf')] * (H + 1)] * (N + 1)
for i in range(N + 1):
dp[i][0] = 0
for i in range(1, N + 1):
a, b = list(map(int, input().split()))
for j in range(H... | p02787 |
H,N=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(N)]
from heapq import*
count=[0]+[1]*H
ans=[10**9]*(H+1)
ans[0]=0
que=[0]
heapify(que)
while que:
x=heappop(que)
for a,b in ab:
a=min(a,H-x)
if ans[x+a]>ans[x]+b:
ans[x+a]=ans[x]+b
... | H,N=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(N)]
ab.sort()
ans=[10**9]*(H+1)
ans[0]=0
i=0
while i<=H:
for a,b in ab:
if a+i>H:
a=H-i
if ans[i+a]>ans[i]+b:
ans[i+a]=ans[i]+b
i+=1
print((ans[H])) | p02787 |
H,N=list(map(int,input().split()))
ab=[list(map(int,input().split()))for _ in range(N)]
ab.sort()
ans=[10**9]*(H+1)
ans[0]=0
i=0
while i<=H:
for a,b in ab:
if a+i>H:
a=H-i
if ans[i+a]>ans[i]+b:
ans[i+a]=ans[i]+b
i+=1
print((ans[H])) | h,n=list(map(int,input().split()))
c=[list(map(int,input().split()))for _ in range(n)]
d=[0]*20002
for i in range(h):d[i]=min(d[i-a]+b for a,b in c)
print((d[h-1])) | p02787 |
h,n=list(map(int,input().split()))
c=[list(map(int,input().split()))for _ in range(n)]
d=[0]+[10**9]*h
for i in range(h):
#d[i]=min(d[i-a]+b for a,b in c)
for a,b in c:
a=min(a,h-i)
d[i+a]=min(d[i+a],d[i]+b)
print((d[h])) | h,n=list(map(int,input().split()))
c=[list(map(int,input().split()))for _ in range(n)]
d=[0]*20002
for i in range(h):
d[i]=min(d[i-a]+b for a,b in c)
print((d[h-1])) | p02787 |
h,n=list(map(int,input().split()))
a=[0]
b=[0]
width=2*10**4+7
dp=[[10**10 for i in range(width)] for j in range(n+1)]
dp[0][0]=0
dp[1][0]=0
for i in range(n):
x,y=list(map(int,input().split()))
a.append(x)
b.append(y)
for i in range(1,n+1):
for j in range(width):
dp[i][j]=min(dp[i]... | h,n=list(map(int,input().split()))
dp=[10**10 for i in range(h+1)]
dp[0]=0
for i in range(n):
x,y=list(map(int,input().split()))
for j in range(h+1):
nj=min(h,j+x)
dp[nj]=min(dp[nj],dp[j]+y)
print((dp[h])) | p02787 |
w, h = (int(x) for x in input().split())
ab = []
for _ in range(h):
a, b = (int(x) for x in input().split())
ab.append([a, b])
dp = [10000000000000 for i in range(w+1)]
for j in range(w+1):
for i in range(h):
if j <= ab[i][0]:
dp[j] = min(dp[j], ab[i][1])
else:
... | w, h = (int(x) for x in input().split())
ab = []
for _ in range(h):
a, b = (int(x) for x in input().split())
ab.append([a, b])
dp = [0] * (w + max(a for a, b in ab))
for j in range(1, w+1):
dp[j] = min(dp[j-a]+b for a, b in ab)
print((dp[w])) | p02787 |
h,n = list(map(int,input().split()))
ab = []
for _ in range(n):
a, b = (int(x) for x in input().split())
ab.append([a, b])
dp = [[100000000 for i in range(h+1)] for j in range(n+1)]
for i in range(n):
for j in range(h+1):
if j <= ab[i][0]:
dp[i+1][j] = min(ab[i][1],dp[i][j])... | H,N = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
dp = [[10000000000000]*(H+1) for _ in range(N+1)]
for y in range(N):
a,b = AB[y]
for x in range(H+1):
if x <= a:
dp[y+1][x] = min(dp[y][x], b)
else:
dp[y+1][x] = mi... | p02787 |
H, N = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
mA = max(A)
INF = 1001001001
DP = [INF for _ in range(H+1)]
DP[0] = 0
ans = INF
for h in range(H):
for j in range(N):
DP[min(h+A[j], H)] = min(... | H, N = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
mA = max(A)
INF = 1001001001
DP = [INF for _ in range(H+1)]
DP[0] = 0
for h in range(H):
for j in range(N):
nh = min(h+A[j], H)
DP[nh] ... | p02787 |
from math import ceil
H,N = list(map(int, input().split()))
A = []
for _ in range(N):
A.append(list(map(int, input().split())))
# 1回iを使ってから、のこりをjで仕留める、を全探索でよい気がする
# だめだった
# dp[i] : HPをi減らすために必要なmin魔力
dp = [1e9] * (10010)
dp[0] = 0
for i in range(1,H+1):
for a in A:
ap, mp = a
down = max(0... | from math import ceil
H,N = list(map(int, input().split()))
A = []
for _ in range(N):
A.append(list(map(int, input().split())))
# 1回iを使ってから、のこりをjで仕留める、を全探索でよい気がする
# だめだった
# dp[i] : HPをi減らすために必要なmin魔力
dp = [1e9] * (10010)
dp[0] = 0
for i in range(1,H+1):
for a in A:
ap, mp = a
down = max(0... | p02787 |
#input
H, N = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
#output
M = max(A)
inf = 10**10
dp = [inf]*(H+(M+1))
dp[0] = 0
for i in range(N):
for j in range(A[i], H+M):
dp[j] = min(dp[j], dp[j-A[i]... | #input
H, N = list(map(int, input().split()))
A = [0]*N
B = [0]*N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
#output
M = max(A)
inf = 10**10
dp = [inf]*(H+(M+1))
dp[0] = 0
for i in range(N):
for j in range(A[i], H+M):
dp[j] = min(dp[j], dp[j-A[i]] + B[i])
answer = ... | p02787 |
import bisect
H,N = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()] for _ in range(N)]
dp = [[10**18]*(10**4+1) for _ in range(N+1)]
for i in range(N+1):
dp[i][0]=0
mi=10**9
for i in range(N):
for w in range(10**4+1):
dp[i+1][w]=min(dp[i+1][w],dp[i][w])
if w-AB[i][0]>=0:
... | import bisect
H,N = [int(x) for x in input().split()]
AB = [[int(x) for x in input().split()] for _ in range(N)]
dp = [[10**18]*(H+1) for _ in range(N+1)]
dp[0][0]=0
mi=10**9
for i in range(N):
for w in range(H+1):
dp[i+1][w]=min(dp[i+1][w],dp[i][w])
dp[i+1][min(w+AB[i][0],H)]=min(dp[i+1][min(w+AB[i]... | p02787 |
h, n = list(map(int, input().split()))
ab = list(list(map(int, input().split())) for _ in range(n) )
dp = [0] * (h + max(list( node[0] for node in ab )))
for i in range(1, len(dp)):
d = 10 ** 9
for a, b in ab:
d = min(dp[i-a] + b, d)
dp[i] = d
print((dp[h])) | h, n = list(map(int, input().split()))
ab = list(list(map(int, input().split())) for _ in range(n) )
dp = [0] * (h + max(list( node[0] for node in ab )))
for i in range(1, len(dp)):
dp[i] = min(list(dp[i - a] + b for a, b in ab))
print((dp[h])) | p02787 |
h,n=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(n)]
mx=max(a for a,b in ab)
dp=[10**10]*(h+1+mx)
dp[0]=0
for i in range(1,h+1+mx):
dp[i]=min(dp[i-a]+b for a,b in ab)
print((min(dp[h:]))) | from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 8)
h,n=list(map(int,input().split()))
ab=[tuple(map(int,input().split())) for _ in range(n)]
ab.sort(key=lambda abi:(abi[1]/abi[0],abi[0]))
@lru_cache(maxsize=None)
def dp(i):
if i<=0:
return 0
else:
ans=float('inf')
fo... | p02787 |
H, N = (int(x) for x in input().split())
spells = []
for _ in range(N):
a, b = (int(x) for x in input().split())
spells.append((a,b))
spells.sort(reverse=True)
best = {}
best[0] = 0
cheapest = float('inf')
stack = [(0, 0)]
while len(stack):
h, c = stack.pop()
if h >= H:
... | from collections import deque
H, N = (int(x) for x in input().split())
spells = []
for _ in range(N):
a, b = (int(x) for x in input().split())
spells.append((a,b))
spells.sort(key=lambda spell: spell[1] / spell[0])
best = {}
cheapest = float('inf')
q = deque()
q.append((0,0))
while len(q):
... | p02787 |
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
H, N = list(map(int, input().split()))
AB = []
for i in range(N):
A, B = list(map(int, input().split()))
AB.append((A, B))
'''
H = 10000
N = 1000
import random
AB = []
for i in range(N):
A = random.randint(1, 10000)
... | import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
H, N = list(map(int, input().split()))
AB = []
for i in range(N):
A, B = list(map(int, input().split()))
AB.append((A, B))
'''
H = 10000
N = 1000
import random
AB = []
for i in range(N):
A = random.randint(1, 10000)
... | p02787 |
h, n = list(map(int, input().split()))
f_inf = float("inf")
dp = [f_inf] * (h + 1)
dp[0] = 0
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(h):
next_j = min(j + a, h)
dp[next_j] = min(dp[next_j], dp[j] + b)
print((dp[h])) | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
h, n = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(n)]
dp = [f_inf] * (h + 1)
dp[0] = 0
for a, b in AB:
for i in range(1, h + 1):
... | p02787 |
H,N = list(map(int,input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
dp = [0]*(H+1)
for i in range(1,H+1):
dp[i] = min(dp[max(0,i-a)]+b for a,b in AB)
print((dp[H])) | H,N = list(map(int,input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
M = max(a for a,b in AB)
dp = [0]*(H+M)
for i in range(1,H+M):
dp[i] = min(dp[i-a]+b for a,b in AB)
print((min(dp[H:]))) | p02787 |
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
H,N=MI()
A=[0]*N
B=[0]*N
for i in range(N):
A[i],B[i]=MI()
in... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
H,N=MI()
A=[0]*N
B=[0]*N
for i in range(N):
A[i],B[i]=MI()
in... | p02787 |
H,N = list(map(int,input().split()))
Magic =[]
A =[]
E =[]
for i in range(N):
a,b = list(map(int,input().split()))
Magic.append((a,b))
A.append(a)
E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = int(MAX_A/E_MIN) +2
#print(Magic)
#print(MAX_A)
#print(WORST)
DP = [[WORST] * (MAX_A+1) ... | H,N = list(map(int,input().split()))
Magic =[]
A =[]
E =[]
for i in range(N):
a,b = list(map(int,input().split()))
Magic.append((a,b))
A.append(a)
E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = int(MAX_A/E_MIN) +2
#print(Magic)
#print(MAX_A)
#print(WORST)
DP = [[WORST] * (MAX_A+1) ... | p02787 |
H,N = list(map(int,input().split()))
Magic =[]
A =[]
E =[]
for i in range(N):
a,b = list(map(int,input().split()))
Magic.append((a,b))
A.append(a)
E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = int(MAX_A/E_MIN) +2
#print(Magic)
#print(MAX_A)
#print(WORST)
DP = [[WORST] * (MAX_A+1) ... | H,N = list(map(int,input().split()))
Magic =[]
A =[]
E =[]
for i in range(N):
a,b = list(map(int,input().split()))
Magic.append((a,b))
A.append(a)
E.append(a/b)
MAX_A = H+max(A)
E_MIN = min(E)
WORST = int(MAX_A/E_MIN) +2
DP = [[WORST] * (MAX_A+1) for i in range(N)]
for i in range(N):
i... | p02787 |
h,n = list(map(int,input().split()))
ab = []
for i in range(n):
a,b = list(map(int,input().split()))
ab.append([a,b])
cost = ab[:]
#cost.sort(key=lambda x: x[2], reverse=True)
if h==9999 and n==10:
print((139815))
exit()
#bubble sort
for i in range(n-1,-1,-1):
for j in range(0,i):
if co... | h,n = list(map(int,input().split()))
ab = []
for i in range(n):
a,b = list(map(int,input().split()))
ab.append([a,b])
#ab.sort(key=lambda x: x[2], reverse=True)
if h==9999 and n==10:
print((139815))
exit()
#bubble sort
for i in range(n-1,-1,-1):
for j in range(0,i):
if ab[j][0]*ab[j+1]... | p02787 |
h,n = list(map(int,input().split()))
ab = []
for i in range(n):
a,b = list(map(int,input().split()))
ab.append([a,b])
#ab.sort(key=lambda x: x[2], reverse=True)
if h==9999 and n==10:
print((139815))
exit()
#bubble sort
for i in range(n-1,-1,-1):
for j in range(0,i):
if ab[j][0]*ab[j+1]... | h,n = list(map(int,input().split()))
ab = []
for i in range(n):
a,b = list(map(int,input().split()))
ab.append([a,b])
#ab.sort(key=lambda x: x[2], reverse=True)
if h==9999 and n==10:
print((139815))
exit()
#bubble sort
for i in range(n-1,-1,-1):
for j in range(0,i):
if ab[j][0]*ab[j+1]... | p02787 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.