input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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[0]/x[1], 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]*... | p02787 |
h, n = list(map(int, input().split()))
ab = []
for i in range(n):
ab.append(list(map(int, input().split())))
dp = [100000000] * (h+1)
dp[0] = 0
for i in range(1, h+1):
for j in range(n):
a = ab[j][0]
b = ab[j][1]
# print(i, j)
temp = i - a
if temp < 0:
... | h, n = list(map(int, input().split()))
ab = []
for i in range(n):
ab.append(list(map(int, input().split())))
###一次元DP
dp = [100000000] * (h+1)
dp[0] = 0
for i in range(1, h+1):
for j in range(n):
a = ab[j][0]
b = ab[j][1]
# print(i, j)
temp = i - a
if temp < ... | p02787 |
h, n = list(map(int, input().split()))
ab = []
for i in range(n):
ab.append(list(map(int, input().split())))
###一次元DP
dp = [100000000] * (h+1)
dp[0] = 0
for i in range(1, h+1):
for j in range(n):
a = ab[j][0]
b = ab[j][1]
# print(i, j)
temp = i - a
if temp < ... | h, n = list(map(int, input().split()))
dp = [1000000000] * (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)
if j + a < h: nj = j + a
else: nj = h
# dp[nj] = min(dp[nj], dp[j] + b)
if dp[nj] > dp[j]... | p02787 |
h, ｎ = list(map(int, input().split()))
dp = [10**10] * (h + 1)
dp[0]=0
ab = []
for i in range(n):
temp = list(map(int, input().split()))
ab.append(temp)
for i in range(h):
t = 10 ** 10
for j in ab:
ht = i + j[0]
if ht >= h: ht = h
dp[ht] = min(dp[ht], dp[i] + j[1])
print((dp[h]))... | h, ｎ = list(map(int, input().split()))
dp = [-1] * (h + 1)
dp[0]=0
ab = []
for i in range(n):
temp = list(map(int, input().split()))
ab.append(temp)
for i in range(h):
if dp[i] == -1: continue
for j in ab:
ht = i + j[0]
if ht >= h: ht = h
if dp[ht] != -1:
dp[ht] = min(dp[ht], ... | p02787 |
from sys import stdin
input = stdin.readline
def main():
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 = [[0]*(H+1) for _ in range(N+1)]
for j in range(H+1):
dp[0][j] = float('inf')
dp[0][0] = 0
f... | from sys import stdin
input = stdin.readline
def main():
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 = [[0]*(H+1) for _ in range(N+1)]
dp = [0]*(H+1)
for j in range(H+1):
dp[j] = float('inf')
dp... | p02787 |
import copy
H,N=list(map(int,input().split()))
A=[]
B=[]
for _ in range(N):
a,b=list(map(int,input().split()))
A.append(copy.copy(a))
B.append(copy.copy(b))
inf=float('inf')
component=[0]
for i in range(H):
component.append(inf)
DP=[]
for j in range(N+1):
DP.append(copy.copy(comp... | 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)
inf=float('inf')
component=[0]
for i in range(H):
component.append(inf)
DP=[]
for j in range(N+1):
DP.append(component)#DPは(N+1)×(H+1)
for k in range(1,N+1... | p02787 |
import sys
h, n = list(map(int, input().split()))
# A = [0] * n
# B = [0] * n
AB = [list(map(int, input().split())) for _ in range(n)]
# for i in range(n):
# A[i], B[i] = map(int, input().split())
min_hp = h
dp = [sys.maxsize] * (min_hp + 1)
dp[0] = 0
for i in range(0, min_hp + 1):
for ab in AB: ... | H, N = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
max_a = max(a for a, b in ab)
dp = [0]*(H+max_a)
for i in range(1, H+max_a):
dp[i] = min(dp[i-a]+b for a, b in ab)
print((dp[H])) | p02787 |
import sys
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()))
min_hp = h
max_hp = h + max(A)
dp = [sys.maxsize] * (max_hp + 1)
dp[0] = 0
for i in range(1, max_hp + 1):
dp[i] = min(dp[i - A[j]] + B[j] for j in range(n))
p... | import sys
h, n = list(map(int, input().split()))
# A = [0] * n
# B = [0] * n
# for i in range(n):
# A[i], B[i] = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(n)]
min_hp = h
max_hp = h + max(a for a, b in (AB))
dp = [sys.maxsize] * (max_hp + 1)
dp[0] = 0
for i in ran... | p02787 |
h,n = list(map(int,input().split()))
ab_input = [[int(j) for j in input().split()] for i in range(n)]
#配るdp
dp =[10**10]*(h+1)
dp[0]=0
for i in range(h):
for a,b in ab_input:
next_index=min(h,i+a)
dp[next_index]=min(dp[next_index],dp[i]+b)
print((dp[-1]))
| h,n = list(map(int,input().split()))
ab_input = [list(map(int,input().split())) for i in range(n)]
max_d = max(a for a,b in ab_input)
#配るdp
dp =[0]*(h+max_d)
for i in range(1,h+max_d):
dp[i]=min(dp[i-a]+b for a,b in ab_input)
print((dp[h])) | p02787 |
h, n = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF for _ in range(2*10**4)]
AB = [tuple(map(int, input().split())) for _ in range(n)]
dp[0] = 0
for a, b in AB:
for i in range(h):
dp[i + a] = min(dp[i + a], dp[i] + b)
print((min(dp[h:]))) | def main():
h, n = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF for _ in range(2*10**4)]
AB = [tuple(map(int, input().split())) for _ in range(n)]
dp[0] = 0
for a, b in AB:
for i in range(h):
dp[i + a] = min(dp[i + a], dp[i] + b)
print((min(dp[h:])))
... | p02787 |
#H = int(input())
H,N = list(map(int,input().split()))
#H = sorted(list(map(int,input().split())))
AB = [list(map(int,input().split())) for i in range(N)]
dp = [[float('inf') for i in range(H)] for j in range(N)]
for i in range(N):
dp[i][0] = 0
for j in range(H):
if j-AB[0][0] >= 0:
dp[0][j] = ... | #H = int(input())
H,N = list(map(int,input().split()))
#H = sorted(list(map(int,input().split())))
AB = sorted([list(map(int,input().split())) for i in range(N)])
dp = [float('inf') for i in range(H)]
dp[0] = 0
for i in range(N):
for j in range(H):
if j-AB[i][0] >= 0:
dp[j] = min(dp[j],... | 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配列を作成
dp = [100000000] * (H + 10 ** 4 + 1)
dp[0] = 0
for i in range(H):
if dp[i] == 100000000:
continue
for a, b in AB:
... | 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 |
H, N = list(map(int, input().split()))
# hitpoint H
# waza N
As = [] # damage
Bs = [] # MP comsumptions
for i in range(N):
a,b = list(map(int, input().split()))
As.append(a)
Bs.append(b)
"""
dp[i][j] = i番目までの魔法を見たとき、ダメージがちょうどjになる最小値
"""
INF = 10**10
M = 21000
dp = [[INF]*M for i in range(N+... | H, N = list(map(int, input().split()))
# hitpoint H
# waza N
As = [] # damage
Bs = [] # MP comsumptions
for i in range(N):
a,b = list(map(int, input().split()))
As.append(a)
Bs.append(b)
INF = 10**10
M = 21000
dp = [INF]*M
dp[0] = 0
for i,(a,b) in enumerate(zip(As,Bs)):
# update
fo... | p02787 |
H, N = list(map(int, input().split()))
da, cost = [0] * N, [0] * N
for i in range(N):
da[i],cost[i]=list(map(int, input().split()))
max_da=max(da)*10
dp = [float("inf") for i in range(H+max_da)]
dp[0]=0
for j in range(N):
for i in range(H+max_da):
if i-da[j]>=0:
dp[i]=min(dp[... | H, N = list(map(int, input().split()))
da, cost = [0] * N, [0] * N
for i in range(N):
da[i],cost[i]=list(map(int, input().split()))
max_da=max(da)
dp = [float("inf") for i in range(H+max_da)]
dp[0]=0
for i in range(H+max_da):
for j in range(N):
if i-da[j]>=0:
dp[i]=min(dp[i],d... | p02787 |
#n=int(input())
h,n=list(map(int,input().split()))
#a=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
#l=[list(input().split()) for i in range(n)]
amax=0
for i in range(n):
if amax<l[i][0]:
amax=l[i][0]
ldp=[[0 for j in range(h+amax)]for i in range(n)... | #n=int(input())
h,n=list(map(int,input().split()))
#a=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
#l=[list(input().split()) for i in range(n)]
ldp=[[0 for j in range(h)]for i in range(n)]
for i in range(n):
for j in range(h):
if i==0:
... | 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=float("inf")
dp=[inf]*(h+1)
dp[0]=0
for a,b in AB:
for i in range(h):
if dp[i]!=float("inf"):
dp[min(i+a,h)]=min(dp[min(i+a,h)],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)
Ama = max(A)
dp=[float("inf")]*(h+Ama+1)
dp[0]=0
for i in range(h+1):
for j in range(n):
dp[i+A[j]]=min(dp[i+A[j]],dp[i]+B[j])
print((min(dp[h:... | 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)
Ama = max(A)
dp=[float("inf")]*(h+Ama+1)
dp[0]=0
for i in range(h+1):
for j in range(n):
dp[i+A[j]]=min(dp[i+A[j]],dp[i]+B[j])
print((min(dp[h:... | import sys
input = sys.stdin.readline
h,n=list(map(int,input().split()))
A=[]
AB=[]
for i in range(n):
a,b=list(map(int,input().split()))
A.append(a)
AB.append((a,b))
maA=max(A)
dp=[float("inf")]*(h+maA+1)
dp[0]=0
for i in range(h+1):
for a,b in AB:
dp[i+a]=min(dp[i+a],dp... | p02787 |
h,n=list(map(int,input().split()))
AB=[]
maA=0
inf=float("inf")
for i in range(n):
a,b=list(map(int,input().split()))
maA=max(maA,a)
AB.append((a,b))
dp=[inf]*(h+maA+1)
dp[0]=0
for i in range(h+1):
for aj,bj in AB:
dp[i+aj]=min(dp[i+aj],dp[i]+bj)
print((min(dp[h:]))) | h,n=list(map(int,input().split()))
L=[]
maA=0
inf=float("inf")
for i in range(n):
a,b=list(map(int,input().split()))
L.append((a,b))
maA=max(maA,a)
dp=[inf]*(h+maA+1)
dp[0]=0
for i in range(h):
for j in L:
dp[i+j[0]]=min(dp[i+j[0]],dp[i]+j[1])
print((min(dp[h:]... | p02787 |
# coding: utf-8
H, N = list(map(int, input().split()))
L = []
for i in range(N):
L.append(list(map(int, input().split())))
dp = [float("inf") for _ in range(H+1)]
dp[0] = 0
for i in range(1, H+1):
for j in range(N):
a, b = L[j]
if i <= a:
dp[i] = min(dp[i], b)
el... | # coding: utf-8
H, N = list(map(int, input().split()))
L = []
for i in range(N):
L.append(list(map(int, input().split())))
dp = [float("inf") for _ in range(H+1)]
dp[0] = 0
top = 10**9
for i in range(1, H+1):
for j in range(N):
a, b = L[j]
if i <= a:
dp[i] = min(dp[i], b... | p02787 |
def resolve():
INF = 1<<60
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 = [[INF]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in r... |
def resolve():
INF = 1<<60
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 = [[INF]*(H+1) for _ in range(N+1)]
for i in range(N):
dp[i][0] = 0
for i ... | p02787 |
h,n = list(map(int, input().split()))
ab = []
a = []
b = []
for _ in range(n):
t_ab = list(map(int, input().split()))
ab.append(t_ab)
a.append(t_ab[0])
b.append(t_ab[1])
maxa = max(a)
hmaxa = h+maxa
dp = [float("inf") for _ in range(hmaxa)]
dp[0] = 0
for i in range(hmaxa):
ab_child... | h,n = list(map(int, input().split()))
ab = []
a = []
b = []
for _ in range(n):
t_ab = list(map(int, input().split()))
ab.append(t_ab)
a.append(t_ab[0])
b.append(t_ab[1])
maxa = max(a)
hmaxa = h+maxa
dp = [0 for _ in range(hmaxa)]
for i in range(1, hmaxa):
ab_child = [dp[i-a]+b for a... | p02787 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02787 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02787 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02787 |
def solve():
H,N = list(map(int, input().split()))
# Aが消費HP, Bが消費MP
ABs = [list(map(int, input().split())) for _ in range(N)]
dp_table = [[0]*(H+1) for _ in range(N+1)]
# dp_table[i][j] : i番目の魔法から消化HPがj以上となる、MPの最小値
for j in range(1,H+1): dp_table[0][j] = 10**9
for i in range(N):
... | def solve():
H,N = list(map(int, input().split()))
# Aが消費HP, Bが消費MP
ABs = [list(map(int, input().split())) for _ in range(N)]
# dp_table = [[10**9]*(H+1)]+[[0]*(H+1) for _ in range(N)]
dp_table = [[0]*(H+1) for _ in range(N+1)]
# dp_table[i][j] : i番目の魔法から消化HPがj以上となる、MPの最小値
for j in ra... | p02787 |
H,N = list(map(int,input().split()))
MAXH = H+10000
DP = [float("inf")]*MAXH
DP[0] = 0
a = [0]*N
b = [0]*N
for i in range(N):
a[i],b[i] = list(map(int,input().split()))
for i in range(MAXH):
if DP[i] == float("inf"):
continue
for j in range(N):
DP[min(i+a[j],H)] = min(DP[min(i+a[j],H)]... | H,N = list(map(int,input().split()))
MAXH = H+1
DP = [float("inf")]*MAXH
DP[0] = 0
a = [0]*N
b = [0]*N
for i in range(N):
a[i],b[i] = list(map(int,input().split()))
for i in range(MAXH):
if DP[i] == float("inf"):
continue
for j in range(N):
DP[min(i+a[j],H)] = min(DP[min(i+a[j],H)],DP[... | p02787 |
import sys
import math
input=sys.stdin.readline
INF=1000000000
# A Dynamic Programming based Python Program for 0-1 Knapsack problem
# Returns the maximum value that can be put in a knapsack of capacity W
def knapSack(W,l, n):
min_cost = [[0 for i in range(W+1)] for j in range(n+1)]
... |
INF=1000000000
# A Dynamic Programming based Python Program for 0-1 Knapsack problem
# Returns the maximum value that can be put in a knapsack of capacity W
def knapSack(W,l, n):
min_cost = [[0 for i in range(W+1)] for j in range(n+1)]
# fill 0th row with infinity
for i in rang... | p02787 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, N = lr()
INF = 10 ** 15
limit = H + 100
dp = [INF] * limit
dp[0] = 0
for _ in range(N):
a, b = lr()
for i in range(limit):
index = i+a
if in... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, N = lr()
INF = 10 ** 15
limit = H + 100
dp = [INF] * limit
dp[0] = 0
for _ in range(N):
a, b = lr()
for i in range(H):
index = i+a
if index ... | p02787 |
from math import ceil,floor,comb,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator impo... | from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import it... | p02787 |
INF = float("inf")
H, N, *AB = list(map(int, open(0).read().split()))
dp = [0] * (H + 10 ** 4 + 10)
for i in range(1, len(dp)):
dp[i] = min(dp[i - a] + b for a, b in zip(*[iter(AB)] * 2))
print((min(dp[H:]))) | H, N, *AB = list(map(int, open(0).read().split()))
dp = [0] * (H + max(AB[::2]))
for i in range(1, len(dp)):
dp[i] = min(dp[i - a] + b for a, b in zip(*[iter(AB)] * 2))
print((min(dp[H:]))) | p02787 |
def rec_z():
for i in range(N):
for j in range(Hmax+1):
if j >= a[i]:
dp[j] = min(dp[j], dp[j-a[i]] + b[i])
return min(dp[H:Hmax+1])
H, N = list(map(int,input().split()))
a = []
b = []
for i in range(N):
aa, bb = list(map(int, input().split()))
a.appe... | from sys import stdin
def rec_z():
for i in range(N):
for j in range(Hmax+1):
if j >= a[i]:
dp[j] = min(dp[j], dp[j-a[i]] + b[i])
return min(dp[H:Hmax+1])
readline=stdin.readline
H, N = list(map(int,readline().split()))
a = []
b = []
for i in range(N):
... | p02787 |
H, N = list(map(int,input().split()))
M = [list(map(int,input().split())) for k in range(N)]
dp = [10**10]*(10**5)
dp[0] = 0
for e in M:
for k in range(e[0],10**5):
dp[k] = min(dp[k],dp[k-e[0]]+e[1])
print((min(dp[H:])))
| H, N = list(map(int,input().split()))
M = []
for k in range(N):
M.append(list(map(int,input().split())))
dp = [10**9]*(10**5)
dp[0] = 0
for A, B in M:
for k in range(A+1):
dp[k] = min(dp[k],B)
for k in range(A+1,H+1):
dp[k] = min(dp[k],dp[k-A]+B)
print((dp[H]))
| p02787 |
# -*- coding: utf-8 -*-
h,n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
inf = 10**9
dp = [[inf]*(h+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(h+1):
k = 0
while ab[i][0]*k<=h:
d = j+ab[i][0]*k
... | # -*- coding: utf-8 -*-
h,n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
inf = 10**9
dp = [inf]*(h+1)
dp[0] = 0
for i in range(n):
for j in range(h+1):
d = min(j+ab[i][0], h)
dp[d] = min(dp[d], dp[j]+ab[i][1])
res = dp[h]
print(res)
| p02787 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
*a,=map(int,open(0))
def... | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from functools import *
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def Golf():
*a,=map(int,open(0))
def... | p02787 |
import sys
sys.setrecursionlimit(10**9)
H, N = list(map(int, input().split()))
magic = [_ for _ in range(N)]
for k in range(N):
magic[k] = list(map(int, input().split()))
magic[k].append(magic[k][0]/magic[k][1])
magic.sort(key = lambda x: x[2], reverse=True)
ans = [0 for _ in range(H+1)]
visited = [0... | import sys
sys.setrecursionlimit(10**9)
H, N = list(map(int, input().split()))
magic = [_ for _ in range(N)]
for k in range(N):
magic[k] = list(map(int, input().split()))
magic[k].append(magic[k][0]/magic[k][1])
magic.sort(key = lambda x: x[2], reverse=True)
ans = [0 for _ in range(H+1)]
visited = [0... | p02787 |
import sys
sys.setrecursionlimit(10**9)
H, N = list(map(int, input().split()))
magic = [_ for _ in range(N)]
for k in range(N):
magic[k] = list(map(int, input().split()))
magic[k].append(magic[k][0]/magic[k][1])
magic.sort(key = lambda x: x[2], reverse=True)
ans = [0 for _ in range(H+1)]
visited = [0... | import sys
sys.setrecursionlimit(10**9)
H, N = list(map(int, input().split()))
magic = [_ for _ in range(N)]
for k in range(N):
magic[k] = list(map(int, input().split()))
magic[k].append(magic[k][0]/magic[k][1])
magic.sort(key = lambda x: x[2], reverse=True)
ans = [0 for _ in range(H+1)]
visited = [0... | p02787 |
H,N = list(map(int,input().split()))
spells = sorted([tuple(map(int,input().split())) for _ in range(N)])
max_a = spells[-1][0]
dp = [10000000000 for _ in range(H + max_a + 1)]
dp[0] = 0
for i in range(1, H + max_a + 1):
for spell in spells:
if spell[0] > i:
break
else:
dp[i] = min(d... | H,N = list(map(int,input().split()))
spells = [tuple(map(int,input().split())) for _ in range(N)]
max_a = max(spells)[0]
dp = [0]
for i in range(1, H + max_a + 1):
try:
dp.append(min([dp[i - a] + b for a,b in spells if a <= i]))
except ValueError:
dp.append(10**8)
print((min(dp[H:])))
| p02787 |
HP,n = list(map(int,input().split()))
s = [tuple(map(int,input().split())) for i in range(n)]
dp = [float('inf')]*(HP+1) #0~HP
dp[0] = 0
for damage, cost in s:
for hp in range(HP):
next_idx = min(hp+damage, HP)
dp[next_idx] = min(dp[next_idx], dp[hp]+cost)
print((dp[-1])) | HP,n = list(map(int,input().split()))
s = [tuple(map(int,input().split())) for i in range(n)]
#dp[damage] := モンスターにdamageを与える最小コスト
dp = [float('inf')]*(HP+1) #0~HP
dp[0] = 0
for damage, cost in s:
for hp in range(HP):
next_idx = min(hp+damage, HP)
dp[next_idx] = min(dp[next_idx], dp[hp]+co... | p02787 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def MI(): return map(int, input().s... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def MI(): return map(int, input().s... | p02787 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def MI(): return map(int, input().s... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def MI(): return map(int, input().s... | p02787 |
H,N = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]
A.insert(0,[0,0])
INFTY = 10**9
dp = [[INFTY for _ in range(H+1)] for _ 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] = dp[i-1][j]
dp[i]... | H,N = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]
INFTY = 10**8
dp = [[INFTY for _ in range(H+1)] for _ 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] = dp[i-1][j]
if j>=A[i-1][0]:
... | p02787 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.rea... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | p02787 |
def solve():
H,N = list(map(int,input().split()))
attack = []
mp = []
for i in range(N):
a,b = list(map(int,input().split()))
attack.append(a)
mp.append(b)
max_attack = max(attack)
dp = [[float('inf')] * (H+max_attack) for _ in range(N+1)]
for i in r... | def solve():
H,N = list(map(int,input().split()))
ap = []
mp = []
for _ in range(N):
a,b = list(map(int,input().split()))
ap.append(a)
mp.append(b)
ap_max = max(ap)
dp = [[float('inf')] * (H+ap_max+1) for _ in range(N+1)]
for i in range(N+1):
... | p02787 |
import sys
input = sys.stdin.buffer.readline
def main():
H,N = list(map(int,input().split()))
x = []
ma = 0
for _ in range(N):
a,b = list(map(int,input().split()))
ma = max(ma,a)
x.append((a,b))
INF = 10**10
dp = [INF for _ in range(H+ma+1)]
dp[0] ... | import sys
input = sys.stdin.buffer.readline
def main():
H,N = list(map(int,input().split()))
x = []
ma = 0
for _ in range(N):
a,b = list(map(int,input().split()))
ma = max(ma,a)
x.append((a,b))
INF = 10**18
dp = [INF for _ in range(H+ma+1)]
dp[0] ... | p02787 |
import math
#import numpy as np
#"""
h,n=list(map(int,input().split()))
#a=list(map(int,input().split()))
ma=[]
for _ in range(n):
tmp=list(map(int,input().split()))
ma.append(tmp)
#"""
#h=10**4
#n=10**3
#ma=[[i,i+1] for i in range(n)]
#ma=sorted(ma,key=lambda x:x[1])
#ma.reverse()
dp=[[flo... | import math
#import numpy as np
#"""
h,n=list(map(int,input().split()))
#a=list(map(int,input().split()))
#"""
dp=[[float("inf") for _ in range(h+1)] for _ in range(n)]
dp[0][0]=0
ma=list(map(int,input().split()))
for i in range(1,h+1):
dp[0][i]=math.ceil(i/ma[0])*ma[1]
#print(np.array(ma))
for i in... | p02787 |
# E - Crested Ibis vs Monster
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()
DP = [float('inf') for i in range(2* 10**4+1)]
DP[0] = 0
for i in range(10**4):
for ab in AB:
DP[i+ab[0]] = min(DP[i+ab[0]], ... | # E - Crested Ibis vs Monster
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()
DP = [float('inf') for i in range(2*10**4 + 1)]
DP[0] = 0
for i in range(H):
for ab in AB:
DP[i+ab[0]] = min(DP[i+ab[0]], DP[... | p02787 |
# E - Crested Ibis vs Monster
H, N = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append((a,b))
max_a = max(AB[i][0] for i in range(N))
DP = [float('inf') for i in range(H + max_a + 1)]
DP[0] = 0
for i in range(1, H + max_a):
DP[i] = min(DP... | # E - Crested Ibis vs Monster
H, N = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append((a,b))
max_a = max(AB[i][0] for i in range(N))
DP = [10**18 for i in range(H + max_a + 1)]
DP[0] = 0
for i in range(1, H + max_a):
DP[i] = min(DP[i - a... | 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()))
#i番目までの魔法を使い, モンスターの体力をj以上減らすのに必要な魔力の最小値(個数制限なしナップザック)
dp = [[float("inf")]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
for j in range(H+1):
if j... |
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()))
"""
# i番目までの魔法を使い, モンスターの体力をj以上減らすのに必要な魔力の最小値(個数制限なしナップザック)
dp = [[float("inf")]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
for j in range(H+1):
... | p02787 |
h,n,*L=list(map(int,open(0).read().split()))
dp=[0]+[9e9]*h
ov=9e9
for a,b in zip(*[iter(L)]*2):
for i in range(h):
if a+i>h:
ov=min(min(dp[i:])+b,ov)
break
t=dp[i]+b
if t<dp[i+a]:
dp[i+a]=t
print((min(ov,dp[h]))) | h,n,*L=list(map(int,open(0).read().split()))
dp=[0]*(h+10100)
for i in range(1,h+1):dp[i]=min(dp[i-a]+b for a,b in zip(*[iter(L)]*2))
print((dp[h])) | p02787 |
import sys
H, N = list(map(int, input().split()))
AB = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
magics = {}
for a, b in AB:
for i in range(H // a + 2):
if min(i * a, H) not in magics:
magics[min(i * a, H)] = i * b
else:
magics[min(i * a, H... | import sys
H, N = list(map(int, input().split()))
AB = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
dp = [0 for _ in range(H + max(AB, key=lambda x: x[0])[0])]
for h in range(1, len(dp)):
dp[h] = min(dp[h-a] + b for a, b in AB)
print((dp[H]))
| p02787 |
import sys
H, N = list(map(int, input().split()))
AB = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
dp = [[float('inf') for _ in range(H + max(AB)[0] + 1)] for _ in range(N + 1)]
dp[0][0] = 0
for n in range(N):
for h in range(H + max(AB)[0] + 1):
if h - AB[n][0] >= 0:
... | import sys
H, N = list(map(int, input().split()))
AB = [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
dp = [float('inf') for _ in range(H + max(AB)[0] + 1)]
dp[0] = 0
for h in range(H + max(AB)[0] + 1):
for n in range(N):
if h - AB[n][0] >= 0:
dp[h] = min(dp[h - AB[... | p02787 |
H, N = list(map(int, input().split()))
a, b = list(zip(*(list(map(int, input().split())) for _ in range(N))))
maxA = max(a)
inf = float("inf")
dp = [inf for _ in range(H+maxA+1)]
dp[0] = 0
for j in range(N):
for i in range(a[j], H+maxA+1):
dp[i] = min(dp[i], dp[i-a[j]]+b[j])
print((min(dp[H:]... | H, N = list(map(int, input().split()))
a, b = list(zip(*(list(map(int, input().split())) for _ in range(N))))
maxA = max(a)
inf = float("inf")
dp = [inf] * (H+maxA+1)
dp[0] = 0
for j in range(N):
for i in range(a[j], H+maxA+1):
dp[i] = min(dp[i], dp[i-a[j]]+b[j])
print((min(dp[H:]))) | p02787 |
h, n = list(map(int, input().split()))
inf = 10**12
data = []
for i in range(n):
data.append(list(map(int, input().split())))
dp = [[inf for i in range(h+1 + 10**4)] for j in range(n+1)]
for i in range(n):
dp[i][0] = 0
for i in range(n):
a, b = data[i]
for j in range(h+1+10**4):
if j ... | h, n = list(map(int, input().split()))
inf = 10**10
dp = [[inf for i in range(h+1)] for j in range(n+1)]
#dp[i][j] := i番目の魔法まで考えたとき、hpをh減らす最小コスト
dp[0][0] = 0
for i in range(1,n+1):
damage, cost = list(map(int, input().split()))
for j in range(h+1):
if j - damage < 0:
dp[i][j] = min(... | p02787 |
INF = 2**60 # 無限大を表す値
H, N = list(map(int, input().split()))
AB = []
for i in range(N):
A, B = list(map(int, input().split()))
AB.append((A, B))
dp = [INF] * (H + 1)
dp[0] = 0
for A, B in AB:
for j in range(H+1):
dp[j] = min(dp[j], dp[max(j-A, 0)] + B)
print((dp[H])) | INF = 2**60 # 無限大を表す値
H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
dp = [INF] * (H + 1)
dp[0] = 0
for A, B in AB:
for j in range(H+1):
dp[j] = min(dp[j], dp[max(j-A, 0)] + B)
print((dp[H])) | p02787 |
import sys
input=sys.stdin.readline
def dp(i):
for a,b in AB:
T=C[i-a if i>a else 0]+b
C[i]=T if T<C[i] else C[i]
H,N=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(N)]
C=[0]+[10**8]*H
for i in range(1,H+1):
dp(i)
print((C[H]))
| import sys
input=sys.stdin.readline
def main():
def dp(i):
for a,b in AB:
T=C[i-a if i>a else 0]+b
C[i]=T if T<C[i] else C[i]
H,N=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(N)]
C=[0]+[10**8]*H
for i in range(1,H+1):
dp(i)
print((C... | p02787 |
#import numpy as np
h, n = list(map(int, input().split()))
a = []
b = []
m = []
for i in range(n):
at, bt = list(map(int, input().split())) # a_tmp, b_tmp
a.append(at)
b.append(bt)
#dp = np.zeros((n+1,h+1))
dp = [[0]*(h+1) for _ in range(n+1)]
for i in range(n):
for j in range(h):
... | h, n = list(map(int, input().split()))
a = []
b = []
m = []
for i in range(n):
at, bt = list(map(int, input().split())) # a_tmp, b_tmp
a.append(at)
b.append(bt)
dp = [[0]*(h+1) for _ in range(n+1)]
for i in range(n):
for j in range(h):
if j - a[i] < 0:
o = b[i]
... | p02787 |
h,n=list(map(int,input().split()))
dp=[10**9]*(h+1)
dp[0]=0
for i in range(n):
a,b=list(map(int,input().split()))
for j in range(h):
k=min(j+a,h)
dp[k]=min(dp[k],dp[j]+b)
print((dp[h]))
#写経ABC153E | h,n=list(map(int,input().split()))
dp=[10**9]*(h+1)
dp[0]=0
for i in range(n):
a,b=list(map(int,input().split()))
for j in range(h):
k=min(j+a,h)
dp[k]=min(dp[k],dp[j]+b)
print((dp[h])) | 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)
dp=[0]
AM=max(A)
BM=max(B)
for i in range(1,H+AM):
dcand=dp[-1]+BM
for j in range(N):
dcand=min(dcand,B[j]+min(dp[i-A[j]:]))
dp.append(dcand)
pr... | 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 |
inf = 10 ** 18
h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
max_a = max(a for a, _ in ab)
dp = [inf for _ in range(h + max_a)]
dp[0] = 0
for i in range(1, h + max_a):
min_dp = inf
for a, b in ab:
if 0 > i - a:
continue
m... | inf = 10 ** 18
h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
max_a = max(a for a, _ in ab)
dp = [inf] * (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 ab)
print((min(dp[h:])))
| 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)
# 個数制限なしナップサック
# i番目までの魔法を使ったときにHダメージを実現できるときの最小の魔力
dp = [[float('inf')]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(H+1):
... | 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)
# 個数制限なしナップサック
# i番目までの魔法を使ったときにHダメージを実現できるときの最小の魔力
dp = [[10**10]*(H+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
for j in range(H+1):
... | p02787 |
h, n = list(map(int, input().split()))
magics = sorted([list(map(int, input().split())) for _ in range(n)])
max_cost = max(magic[1] for magic in magics)
dp = [float('inf')] * (h+max_cost)
dp[0] = 0
for i in range(len(dp)):
for at, cost in magics:
if at <= i:
dp[i] = min(dp[i], dp[i-a... | h, n = list(map(int, input().split()))
magics = sorted(list(map(int, input().split())) for _ in range(n))
max_cost = max(magic[1] for magic in magics)
dp = [float('inf')] * (h+max_cost)
dp[0] = 0
for i in range(h+max_cost):
for at, cost in magics:
if at <= i:
dp[i] = min(dp[i], dp[i-at... | p02787 |
h, n = list(map(int, input().split()))
magics = sorted(list(map(int, input().split())) for _ in range(n))
max_cost = max(magic[1] for magic in magics)
dp = [float('inf')] * (h+max_cost)
dp[0] = 0
for i in range(h+max_cost):
for at, cost in magics:
if at <= i:
dp[i] = min(dp[i], dp[i-at... | import sys
input = sys.stdin.readline
h, n = list(map(int, input().split()))
magics = []
max_cost = 0
for _ in range(n):
at, cost = list(map(int, input().split()))
max_cost = max(max_cost, cost)
magics.append((at, cost))
dp = [float('inf')] * (h+max_cost)
dp[0] = 0
for i in range(len(dp))... | p02787 |
H, N = [int(s) for s in input().split()]
dec = []
cost = []
for i in range(N):
a, b = [int(s) for s in input().split()]
dec.append(a)
cost.append(b)
memo = [None]*(H+1)
memo[0] = 0
for h in range(1,H+1):
memo[h] = memo[max(0,h-dec[0])]+cost[0]
for i in range(1,N):
memo[h] = min(m... | H, N = [int(s) for s in input().split()]
dec = []
cost = []
for i in range(N):
a, b = [int(s) for s in input().split()]
dec.append(a)
cost.append(b)
bar = ((H-1)//dec[0]+1)*cost[0]
memo = [bar]*(H+1)
memo[0] = 0
for h in range(1,H+1):
for i in range(N):
memo[h] = min(memo[h], memo[ma... | p02787 |
H,N = list(map(int,input().split()))
dp = [float("inf")] * (H+1)
for i in range(N):
a,b = list(map(int,input().split()))
for h in range(1, H+1):
if h - a <= 0:
dp[h] = min(dp[h], b)
else:
dp[h] = min(dp[h], b + dp[h - a])
print((dp[-1]))
| H,N = list(map(int,input().split()))
INF = float('inf')
# dp[i] = 攻撃がh以上となるときに考えられる最小の体力消耗
dp = [INF] * (H+1)
for _ in range(N):
a,b = list(map(int,input().split()))
for h in range(1, H+1):
if h <= a:
dp[h] = min(dp[h],b)
else:
dp[h] = min(dp[h],dp[h-a]+b)
print((dp[-1])) | p02787 |
#coding:utf-8
def main():
h, n = list(map(int, input().split()))
ab = []
for _ in range(n):
ab.append(list(map(int, input().split())))
inf = 100000000000
# indexがモンスターに与えたダメージで、中身がトキのダメージ
damages = [0] + [inf] * h
for i in range(1, h + 1):
for j in range(n):... | #coding:utf-8
def main():
h, n = list(map(int, input().split()))
ab = []
for _ in range(n):
ab.append(list(map(int, input().split())))
inf = 100000000000
# indexがモンスターに与えたダメージで、中身がトキのダメージ
damages = [inf for _ in range(100000)]
damages[0] = 0
pre_damage = -1
... | p02787 |
def main():
import sys
readline = sys.stdin.readline
# readlines = sys.stdin.readlines
H, N = list(map(int, input().split()))
M = [tuple(map(int, readline().split())) for _ in range(N)]
INF = 10 ** 9
dp = [INF] * (H + 1)
dp[0] = 0
for i in range(N):
a, b = M[i... | def main():
import sys
# readline = sys.stdin.readline
readlines = sys.stdin.readlines
H, N = list(map(int, input().split()))
M = [tuple(map(int, s.split())) for s in readlines()]
INF = 10 ** 9
dp = [INF] * (H + 1)
dp[0] = 0
for i in range(N):
a, b = M[i]
... | p02787 |
import sys
H, N = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
a, b = list(map(int, sys.stdin.readline().rstrip().split()))
A[i] = a
B[i] = b
max_A = max(A)
INF = 10**18
dp = [INF] * (H + max_A)
dp[0] = 0
for i in range(0, H):
for j in range(N):
... | import sys
H, N = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
a, b = list(map(int, sys.stdin.readline().rstrip().split()))
A[i] = a
B[i] = b
max_A = max(A)
INF = 10**18
dp = [INF] * (H + max_A)
dp[0] = 0
for i in range(H):
for j in range(N):
d... | p02787 |
H, N = list(map(int, input().split()))
AB = [tuple(map(int, input().split()))for _ in range(N)]
DP = [10**10] * (H+1)
DP[H] = 0
for h in range(H, 0, -1):
for a, b in AB:
x = max(0, h - a)
DP[x] = min(DP[x], DP[h] + b)
print((DP[0])) | import sys
input=sys.stdin.readline
def main():
H, N = list(map(int, input().split()))
AB = [tuple(map(int, input().split()))for _ in range(N)]
DP = [10**10] * (H+1)
DP[H] = 0
for h in range(H, 0, -1):
for a, b in AB:
x = max(0, h - a)
DP[x] = min(DP[x], D... | p02787 |
H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
INF = 10**10+1
dp = [[INF]*(H+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
dp[i][0] = 0
A = AB[i-1][0]
for j in range(1, H+1):
if j-AB[i-1][0]>=0:
dp[i][j] = min(... | H, N = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
INF = 10**10+1
dp = [[INF]*(H+1) for i in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
dp[i][0] = 0
A = AB[i-1][0]
for j in range(1, H+1):
if j-AB[i-1][0]>=0:
dp[i][j] = min(... | p02787 |
H,N = list(map(int,input().split()))
magic = [list(map(int,input().split())) for i in range(N)]
INF = 10**10
#print(magic)
AM = 0
for i in range(N):
AM = max(AM,magic[i][0])
#print(AM)
dp = [INF for i in range(H+AM+1)]
dp[0] = 0
for i in range(1,H+AM+1):
for j in range(N):
if magic... | H,N = list(map(int,input().split()))
magic = [list(map(int,input().split())) for i in range(N)]
INF = 10**10
#print(magic)
AM = 0
for i in range(N):
AM = max(AM,magic[i][0])
#print(AM)
dp = [INF for i in range(H+AM+1)]
dp[0] = 0
for i in range(1,H+AM+1):
for j in range(N):
if magic... | p02787 |
h,n= list(map(int, input().split()))
p = [list(map(int, input().split())) for _ in range(n)]
dp = [0]*(h+10**4)
for i in range(1,h+10**4):
dp[i] = min(dp[i-a] + b for a,b in p)
print((min(dp[h:]))) | h,n= list(map(int, input().split()))
p = [list(map(int, input().split())) for _ in range(n)]
m = 10**4
dp = [0]*(h+m+1)
for i in range(m+1,h+m+1):
dp[i] = min(dp[i-a] + b for a,b in p)
print((dp[h+m])) | p02787 |
def resolve():
h, n = list(map(int, input().split()))
w = []
v = []
for i in range(n):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [[0 for i in range(h + 1)] for j in range(n + 1)]
for i in range(1, h + 1):
# dp[0][i] = v[0] * ((w... | def resolve():
h, n = list(map(int, input().split()))
w = []
v = []
for i in range(n):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [[0 for i in range(h + 1)] for j in range(n + 1)]
for i in range(1, h + 1):
dp[0][i] = float("inf")... | p02787 |
def main():
h, n = list(map(int, input().split()))
magic_list = []
for _ in range(n):
a, b = list(map(int, input().split()))
magic_list.append((a, b))
ans = solve(h, magic_list)
print(ans)
def solve(h, magic_list):
# 1-origin
inf = 1 << 40
max_attack = ... | def main():
h, n = list(map(int, input().split()))
magic_list = []
for _ in range(n):
a, b = list(map(int, input().split()))
magic_list.append((a, b))
ans = solve(h, magic_list)
print(ans)
def solve(h, magic_list):
# 1-origin
max_attack = max(magic_list)[0]
... | p02787 |
h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [0] * (h+max(a for a,b in ab))
for i in range(1, len(dp)):
dp[i] = min([float('inf')] + [(dp[i-a]+b) for a, b in ab if i-a >= 0])
print((min(dp[h:])))
| h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [0] * (h+max(a for a,b in ab))
for i in range(1, len(dp)):
dp[i] = min(dp[i-a]+b for a, b in ab)
print((min(dp[h:])))
| p02787 |
#!/usr/bin/env python3
import sys
def solve(H: int, N: int, A: "List[int]", B: "List[int]"):
hmax = H + max(A)
cost = [0] * hmax
intmax = 99999
magics = [(a, b) for a, b in zip(A,B)]
for i in range(1, hmax):
for a, b in magics:
if i >= a:
cost[i] = m... | #!/usr/bin/env python3
import sys
def solve(H: int, N: int, A: "List[int]", B: "List[int]"):
hmax = H + max(A)
cost = [0] * hmax
magics = [(a, b) for a, b in zip(A,B)]
for i in range(1, hmax):
for a, b in magics:
if i >= a:
cost[i] = min(cost[i-a]+b, cost... | p02787 |
h, n = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(n)]
dp = [10**18] * (h + 1 + 10 ** 5)
dp[h + 10 ** 5] = 0
for i in range(n):
a, b = info[i]
for j in range(h + 1 + 10 ** 5)[::-1]:
if j - a >= 0:
dp[j - a] = min(dp[j] + b, dp[j - a])
pri... | h, n = list(map(int, input().split()))
info = [list(map(int, input().split())) for i in range(n)]
INF = 10**18
dp = [INF] * (h + 1)
dp[h] = 0
for i in range(n):
a, b = info[i]
for j in range(h + 1)[::-1]:
dp[max(j - a, 0)] = min(dp[j] + b, dp[max(j - a, 0)])
print((dp[0]))
| p02787 |
h, n = list(map(int, input().split()))
attack = []
magic = []
for i in range(n):
a, b = list(map(int, input().split()))
attack.append(a)
magic.append(b)
dp = [[float('inf') for _ in range(h+1)] for _ in range(n+1)]
dp[0][0] = 0
#print(attack, magic)
for i in range(n):
for j in range(h+1):... | h, n = list(map(int, input().split()))
magic = [tuple(map(int, input().split())) for _ in range(n)]
#magic = [list(map(int, input().split())) for _ in range(n)]
dp = [float('inf')] * (h+1)
dp[0] = 0
for i in range(h):
for d, c in magic:
next_index = min(i+d, h)
dp[next_index] = min(dp[ne... | p02787 |
import sys
input = sys.stdin.readline
H, N = list(map(int, input().split()))
magic = [list(map(int, input().split())) for _ in range(N)]
dp = [0] * (H + 1)
for i in range(1, H + 1):
dp[i] = min(dp[max(i - damage, 0)] + cost for damage, cost in magic)
ans = dp[H]
print(ans)
| 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 i in range(1, H + max_damage):
dp[i] = min(dp[i - damage] + cost for damage, cost i... | p02787 |
from sys import stdin
f_i = stdin
H, N = list(map(int, f_i.readline().split()))
dp = [10 ** 8] * (H + 10 ** 4)
dp[0] = 0
for i in range(N):
A, B = list(map(int, f_i.readline().split()))
for j, t in enumerate(zip(dp, dp[A:H+A]), start=A):
dp_i, dp_j = t
if dp_i + B < dp_j:
... | def solve():
from sys import stdin
f_i = stdin
H, N = list(map(int, f_i.readline().split()))
dp = [10 ** 8] * (H + 10 ** 4)
dp[0] = 0
for i in range(N):
A, B = list(map(int, f_i.readline().split()))
for j, t in enumerate(zip(dp, dp[A:H+A]), start=A):
... | p02787 |
import sys
sys.setrecursionlimit(1000000) # 再帰上限を増やす
def main():
input = sys.stdin.readline # 文字列に対してinputした場合は、rstripするのを忘れずに！
H, N = list(map(int, input().rstrip().split()))
magic_list = []
for _ in range(N):
A, B = list(map(int, input().rstrip().split()))
magic_list.append(... | import sys
sys.setrecursionlimit(1000000) # 再帰上限を増やす
def main():
input = sys.stdin.readline # 文字列に対してinputした場合は、rstripするのを忘れずに！
H, N = list(map(int, input().rstrip().split()))
magic_list = []
for _ in range(N):
A, B = list(map(int, input().rstrip().split()))
magic_list.append(... | p02787 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
h,n=list(map(int, input().split()))
ab=[list(map(int, input().split())) for i in range(n)]
ans=[0]*(h+1)
for i in range(1,h+1):
li = [ans[max(i-j[0],0)]+j[1] for j in ab]
ans[i]=min(li)
print((ans[h])... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
h,n=list(map(int, input().split()))
ab=[list(map(int, input().split())) for i in range(n)]
ans=[0]*(4*10**4)
for i in range(1,h+1):
li = [ans[i-j[0]]+j[1] for j in ab]
ans[i]=min(li)
print((ans[h]))
... | p02787 |
H, N = list(map(int, input().split()))
A, B = [0] * N, [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
dp = [[10**9]*(H+1)]*(N+1)
dp[0][0] = 0
for i in range(N):
for j in range(H+1):
nj = min(j+A[i], H)
dp[i+1][nj] = min(dp[i][nj], dp[i+1][j] + B[i])
... | H, N = list(map(int, input().split()))
A, B = [0] * N, [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
dp = [10**9] * (H+1)
dp[0] = 0
for i in range(N):
for j in range(H+1):
nj = min(j+A[i], H)
dp[nj] = min(dp[nj], dp[j]+B[i])
print((dp[H])) | p02787 |
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()
@lru_cache(maxsize=None)
def dp(h):
if h <= 0:
return 0
else:
return min(b + dp(h - a) for a, b ... | 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 ab: (ab[1] / ab[0], ab[0]))
@lru_cache(maxsize=None)
def dp(h):
if h <= 0:
... | p02787 |
# -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | p02787 |
H,N=list(map(int, input().split()))
AB=[list(map(int, input().split())) for _ in range(N)]
INF=10**9
dp=[INF for _ in range(H+1)]
dp[H]=0
for h in range(H,0,-1):
for n in range(N):
A,B=AB[n]
newH=max(0,h-A)
dp[newH]=min(dp[newH], dp[h]+B)
print((dp[0])) | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(H, N, AB):
INF = 10**9
dp = [INF] * (H + 1)
dp[H] = 0
for h in reversed(list(range(H + 1))):
for i, (a, b) in enumerate(AB):
nh = max(0, h - a)
dp[nh] = min(dp[nh], dp[h] + b)
print((dp[0]))
... | p02787 |
import sys
input = sys.stdin.readline
def main():
h, n = (int(x) for x in input().split())
ab = []
for _ in range(n):
a, b = (int(x) for x in input().split())
ab.append([a, b])
dp = [float('inf')] * (h)
for a, b in ab:
for i in range(h):
if i < a:
... | h, n = (int(x) for x in input().split())
ab = []
for _ in range(n):
a, b = (int(x) for x in input().split())
ab.append([a, b])
max_a = max(a for a, _ in ab)
dp = [0] * (h + max_a)
for i in range(1, h + 1):
dp[i] = min(dp[i - a] + b for a, b in ab)
print((dp[h])) | p02787 |
import sys
H, N = list(map(int, input().split()))
magic = [list(map(int, input().split())) for _ in range(N)]
dp = [0] * (H + 1)
for x in range(1, H + 1):
dp[x] = min(dp[max(x - damage, 0)] + cost for damage, cost in magic)
print((dp[H])) | 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 in magic)
print((min(dp[H:])))
| p02787 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | p02787 |
h, n = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(n)]
#(a,b):=(ダメージ,消費魔力)
dp = [float('inf')] * (h + 1)
dp[0] = 0
for i in range(h + 1):
for j in range(n):
if dp[i] == float('inf'):continue
temp_a = i + ab[j][0] if i + ab[j][0] < h else h
... | 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=[float('inf')]*(h+1)
dp[0]=0
for i in range(h):
for j in range(n):
next=i+a[j] if i+a[j]<=h else h
dp[next]=min(dp[next],dp[i]+b[j])
pr... | p02787 |
h, n = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(n)]
#(a,b):=(ダメージ,消費魔力)
dp = [float('inf')] * (h + 1)
dp[0] = 0
for i in range(h + 1):
for j in range(n):
if dp[i] == float('inf'):continue
temp_a = i + ab[j][0] if i + ab[j][0] < h else h
... | h,n=list(map(int,input().split()))
ab = [list(map(int,input().split())) for i in range(n)]
dp=[float('inf')]*(h+1)
dp[0]=0
for i in range(h):
for j in range(n):
next=i+ab[j][0] if i+ab[j][0]<=h else h
dp[next]=min(dp[next],dp[i]+ab[j][1])
print((dp[-1]))
| p02787 |
hh,n = list(map(int,input().split(' ')))
spells = [list(map(int, input().split(' '))) for _ in range(n)]
h = {}
h[0] = 0
#h[health] = cost in points
for health in range(1, hh+1):
for u,v in spells:
h[health] = min(h[health] if health in h else +float('inf'), h[max(0,health - u)] + v)
print(h[hh]) | hh,n = list(map(int,input().split(' ')))
spells = [list(map(int, input().split(' '))) for _ in range(n)]
h = [+float('inf')] * (hh+1)
h[0] = 0
for health in range(1, hh+1):
for u,v in spells: h[health] = min(h[health], h[max(0,health - u)] + v)
print(h[hh]) | p02787 |
h,n = list(map(int, input().split()))
magic = []
INF = 10**8
for i in range(n):
a,b = list(map(int, input().split()))
magic.append([a, b])
dp = [[INF for j in range(h+1)] for i in range(n+1)] #体力がjのモンスターをi番目の魔法までを使って倒せる消費魔力の最小値
for i in range(n):
for j in range(h):
if j+1 > magic[i][0... | h,n = list(map(int, input().split()))
magic = []
INF = 10**8
dp = [[INF for j in range(h+1)] for i in range(n+1)] #体力がjのモンスターをi番目の魔法までを使って倒せる消費魔力の最小値
for i in range(n):
a,b = list(map(int, input().split()))
magic.append([a, b])
for i in range(n):
for j in range(h):
if j+1 > magic[i][0... | p02787 |
h,n = list(map(int, input().split()))
magic = []
INF = 10**8
dp = [[INF for j in range(h+1)] for i in range(n+1)] #体力がjのモンスターをi番目の魔法までを使って倒せる消費魔力の最小値
for i in range(n):
a,b = list(map(int, input().split()))
magic.append([a, b])
for i in range(n):
for j in range(h):
if j+1 > magic[i][0... | inf = 10**15
mod = 10**9+7
h,n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(n)]
dp = [[inf for j in range(h+1)] for i in range(n+1)]
for i in range(n):
dp[i][0] = 0
a,b = ab[i]
for j in range(h):
if j+1-a>=0:
dp[i+1][j+1] = min(dp[i+1][... | p02787 |
#!/usr/bin/env python3
import sys
import heapq
from collections import defaultdict
def solve(H: int, N: int, A: "List[int]", B: "List[int]"):
MAX = 10**16
minCurrent = defaultdict(lambda :MAX)
minCurrent[0] = 0
currentPos = [0]
heapq.heapify(currentPos)
visited = set()
while len... | #!/usr/bin/env python3
import sys
import heapq
def solve(H: int, N: int, A: "List[int]", B: "List[int]"):
dp = [10**16]*(H+1)
dp[0] = 0
positions = [0]
for i in range(len(dp)):
c = dp[i]
for j in range(N):
ni = min(H, i+A[j])
dp[ni] = min(dp[ni], c+... | p02787 |
H, N = list(map(int, input().split()))
magic = [tuple(map(int, input().split())) for _ in range(N)]
DP = [0] + [10**9]*H
for h in range(H):
if DP[h] == 10**9:
continue
for damage, mp in magic:
DP[min(h + damage, H)] = min(DP[min(h + damage, H)], DP[h] + mp)
print((DP[H])) | H, N = list(map(int, input().split()))
magic = [tuple(map(int, input().split())) for _ in range(N)]
DP = [0] * (H+10**4)
for h in range(1, H+1):
DP[h] = min(DP[h - damage] + mp for damage, mp in magic)
print((DP[H])) | p02787 |
import sys
import re
import math
import collections
import decimal
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 10
MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.re... | import sys
# import re
# import math
# import collections
# import decimal
# import bisect
# import itertools
# import fractions
# import functools
# import copy
# import heapq
# import decimal
# import statistics
# import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 10
MOD = 10 ** 9 + 7
ni ... | p02787 |
MAX_LIMIT = 1e30
H, N = list(map(int, input().split()))
A, B = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
A.append(a) # HP
B.append(b) # power
# dp[i] means minimum power used to reduce HP i
dp = [MAX_LIMIT] * (H + max(A))
dp[0] = 0
for i in range(1, H + max(A)):
c... | h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp =[0]*(h+max(a for a,b in ab))
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)]
dp = [[float("inf")] * (h + 1) for _ in range(n + 1)]
dp[0][0] = 0
for i in range(n + 1):
dp[i][0] = 0
for i in range(1, n + 1):
for j in range(1, h + 1):
a, b = ab[i-1]
dp[i][j] = min(dp... | h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [[float("inf")] * (h + 1) for _ 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):
a, b = ab[i-1]
dp[i][j] = min(dp[i-1][j], dp[i... | p02787 |
h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [[float("inf")] * (h + 1) for _ 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):
a, b = ab[i-1]
dp[i][j] = min(dp[i-1][j], dp[i... | h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [[float("inf")] * (h + 1) for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0] = 0
for i, (a, b) in enumerate(ab, 1):
for j in range(h + 1):
dp[i][j] = min(dp[i-1][j], dp[i][max(j-a, 0)] + b... | p02787 |
# coding: utf-8
import re
import math
import fractions
import random
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range... | # coding: utf-8
import re
import math
import fractions
import random
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
#import numpy as np
mod=int(10**9+7)
inf=int(10**20)
class union_find():
def __init__(self,n):
self.n=n
self.P=[a for a in range... | p02787 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.