input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import Counter
h,w = li()
cnt = Counter([])
for _ in range(h):
tmp = lc()
for c in tmp:
cnt[c] += 1
exist = True
if h%2 == 0 and w%2 == 0:
for key,value in list(cnt.items()):
if value%4 != 0:
exist = False
break
elif h%2 == 1 and w%2 == 1:
odd = 0
mod4_2 = 0
for key,value in list(cnt.items()):
if value % 2 == 1:
odd += 1
elif value % 4 == 2:
mod4_2 += 1
if odd > 1:
exist = False
elif mod4_2 > (h+w-2)//2:
exist = False
else:
odmax = 0
if h%2 == 0:
odmax = h//2
else:
odmax = w//2
mod4_2 = 0
for key, value in list(cnt.items()):
if value%2 != 0:
exist = False
break
elif value%4 == 2:
mod4_2 +=1
if mod4_2 > odmax:
exist = False
if exist:
print("Yes")
else:
print("No") | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import defaultdict
def judge(cnts, h, w):
odd_cnt = 0
mod4_2_cnt = 0
mod4_0_cnt = 0
for key, val in list(cnts.items()):
if val % 2 == 1:
odd_cnt += 1
elif val % 4 == 2:
mod4_2_cnt += 1
else:
mod4_0_cnt += 1
if h == 1 and w == 1:
return True
elif h == 1:
if w % 2 == 1:
return True if odd_cnt == 1 else False
else:
return True if odd_cnt == 0 else False
elif w == 1:
if h % 2 == 1:
return True if odd_cnt == 1 else False
else:
return True if odd_cnt == 0 else False
elif h % 2 == 1 and w % 2 == 1:
return True if mod4_2_cnt == (w//2 + h//2) and odd_cnt == 1 else False
elif h%2 == 1:
return True if mod4_2_cnt == (w//2) and odd_cnt == 0 else False
elif w%2 == 1:
return True if mod4_2_cnt == (h//2) and odd_cnt == 0 else False
else:
return True if mod4_2_cnt == 0 and odd_cnt == 0 else False
h, w = li()
a = [ns() for _ in range(h)]
char_cnt = defaultdict(int)
for ai in a:
for aij in ai:
char_cnt[aij] += 1
print(("Yes" if judge(char_cnt, h, w) else "No")) | p03593 |
t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
a=b=c=0
if h%2and w%2:
a=h//2*(w//2)
c=1
b=(h*w-a*4-c)//2
elif h%2or w%2:
a=h//2*(w//2)
b=(h*w-a*4)//2
else:
a=h*w//4
l=[]
for i in set(s.replace('\n','')):
l.append(s.count(i))
for i in l:
if i>3:
while i>3and a:
i-=4
a-=1
if i>1:
while i>1and b:
i-=2
b-=1
if i and c:
i-=1
c-=1
if all(not t for t in(a,b,c)):
print('Yes')
else:
print('No') | t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
a=h//2*(w//2)
c=h%2and w%2
b=(h*w-a*4-c)//2
l=[]
for i in set(s.replace('\n','')):
l.append(s.count(i))
for i in l:
if i>3:
while i>3and a:
i-=4
a-=1
if i>1:
while i>1and b:
i-=2
b-=1
if i and c:
i-=1
c-=1
if all(not t for t in(a,b,c)):
print('Yes')
else:
print('No') | p03593 |
t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
d={}
d[4]=a=h//2*(w//2)
d[1]=b=h%2and w%2
d[2]=(h*w-a*4-b)//2
for i in map(s.count,set(s)-{'\n'}):
for j in(4,2,1):
while d[j]and i>=j:
i-=j
d[j]-=1
print(('YNeos'[any(t for t in list(d.values()))::2])) | t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
d={}
d[4]=a=h//2*(w//2)
d[1]=b=h%2and w%2
d[2]=(h*w-a*4-b)//2
for i in map(s.count,set(s)-{'\n'}):
for j in(4,2,1):
while d[j]and i>=j:
i-=j
d[j]-=1
print(('YNeos'[sum(d.values())>0::2])) | p03593 |
t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
d={}
d[4]=a=h//2*(w//2)
d[1]=b=h%2and w%2
d[2]=(h*w-a*4-b)//2
for i in map(s.count,set(s)-{'\n'}):
for j in(4,2,1):
while d[j]and i>=j:
i-=j
d[j]-=1
print(('YNeos'[sum(d.values())>0::2])) | t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
a,b=h//2*(w//2),h%2and w%2
d=[b,(h*w-a*4-b)//2,0,a]
for i in map(s.count,set(s)-{'\n'}):
for j in(3,1,0):
while d[j]and i>j:
i-=j+1
d[j]-=1
print(('YNeos'[sum(d)>0::2])) | p03593 |
t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
a,b,c,d=h//2,h%2,w//2,w%2
l=[b&d,d*a+b*c,0,a*c]
for i in map(s.count,set(s)-{'\n'}):
for j in(3,1,0):
while l[j]and i>j:
i-=j+1
l[j]-=1
print(('YNeos'[sum(l)>0::2])) | t,_,s=open(0).read().partition('\n')
h,w=list(map(int,t.split()))
d=[h%2&w%2,w%2*h//2+h%2*w//2,0,h//2*(w//2)]
for i in map(s.count,set(s)-{'\n'}):
for j in(3,1,0):
while d[j]and i>j:
i-=j+1
d[j]-=1
print(('YNeos'[sum(d)>0::2])) | p03593 |
from collections import*
h,*t=open(0)
h,w=list(map(int,h.split()))
f,o=1,0
for i in list(Counter(''.join(t[:-1]for t in t)).values()):
f+=i//4
o+=i&1
print(('YNeos'[o>h%2*w%2or h//2*(w//2)>=f::2])) | from collections import*
h,*t=open(0)
h,w=list(map(int,h.split()))
f,o=1,0
for i in list(Counter(''.join(t)).values()):
f+=i//4
o+=i&1
print(('YNeos'[o-h%2>h%2*w%2or f-h//4<=h//2*(w//2)::2])) | p03593 |
from collections import*
h,*t=open(0)
h,w=list(map(int,h.split()))
f,o=1,0
for i in list(Counter(''.join(t)).values()):
f+=i//4
o+=i&1
print(('YNeos'[o-h%2>h*w%2or f-h//4<=h//2*(w//2)::2])) | from collections import*
h,*t=open(0)
h,w=list(map(int,h.split()))
f=o=0
for i in list(Counter(''.join(t)).values()):f+=i//4;o+=i&1
print(('YNeos'[o-h%2>h*w%2or f-h//4<h//2*(w//2)::2])) | p03593 |
from heapq import*;X,Y,Z=list(map(int,input().split()));N=X+Y+Z;A=[];q1=[];q2=[];L=[0];R=[0]
for _ in[0]*N:A.append([int(e)for e in input().split()])
A.sort(key=lambda a:a[0]-a[1])
for i in range(N):
L+=[L[i]+A[i][1]];heappush(q1,A[i][1]-A[i][2]);R+=[R[i]+A[-1-i][0]];heappush(q2,A[~i][0]-A[~i][2])
if i>=Y:L[i+1]-=heappop(q1)
if i>=X:R[i+1]-=heappop(q2)
print((max(L[i]+R[~i]for i in range(Y,N-X+1)))) | from heapq import*
X,Y,Z=list(map(int,input().split()));N=X+Y+Z;A=[];p=[];q=[];L=[0];R=[0]
for _ in[0]*N:A.append([int(e)for e in input().split()])
A.sort(key=lambda a:a[0]-a[1])
for i in range(N):
L+=[L[i]+A[i][1]];heappush(p,A[i][1]-A[i][2]);R+=[R[i]+A[-1-i][0]];heappush(q,A[~i][0]-A[~i][2])
if i>=Y:L[i+1]-=heappop(p)
if i>=X:R[i+1]-=heappop(q)
print((max(L[i]+R[~i]for i in range(Y,N-X+1)))) | p03653 |
import heapq
if __name__ == '__main__':
X, Y, Z = list(map(int, input().split()))
A = []
B = []
C = []
N = X + Y + Z
for i in range(N):
tmp_a, tmp_b, tmp_c = list(map(int, input().split()))
A.append(tmp_a)
B.append(tmp_b)
C.append(tmp_c)
gold_minus_silver = [(a - b, a, b, c) for (a, b, c) in zip(A, B, C)]
gold_minus_silver.sort()
# print(gold_minus_silver)
# 左側
left_side = []
for i in range(0, Y):
heapq.heappush(left_side, (
gold_minus_silver[i][2] - gold_minus_silver[i][3], gold_minus_silver[i][2], gold_minus_silver[i][3]))
left_max = [0 for i in range(Z + 1)]
for i in range(0, Y):
left_max[0] += left_side[i][1]
left_bronze = []
for K in range(1, Z + 1):
heapq.heappush(left_side, (gold_minus_silver[K + Y - 1][2] - gold_minus_silver[K + Y - 1][3],
gold_minus_silver[K + Y - 1][2],
gold_minus_silver[K + Y - 1][3]))
left_bronze.append(heapq.heappop(left_side))
tmp_max = 0
for i in range(0, Y):
tmp_max += left_side[i][1]
for i in range(0, len(left_bronze)):
tmp_max += left_bronze[i][2]
left_max[K] = tmp_max
# print(left_max)
# 右側
right_side = []
for i in range(Y + Z, N):
heapq.heappush(right_side, (gold_minus_silver[i][1] - gold_minus_silver[i][3], gold_minus_silver[i][1],
gold_minus_silver[i][3]))
right_max = [0 for i in range(Z + 1)]
for i in range(0, X):
right_max[Z] += right_side[i][1]
right_bronze = []
for K in range(Z - 1, -1, -1):
heapq.heappush(right_side, (gold_minus_silver[K + Y][1] - gold_minus_silver[K + Y][3],
gold_minus_silver[K + Y][1],
gold_minus_silver[K + Y][3]))
right_bronze.append(heapq.heappop(right_side))
tmp_max = 0
for i in range(0, X):
tmp_max += right_side[i][1]
for i in range(0, len(right_bronze)):
tmp_max += right_bronze[i][2]
right_max[K] = tmp_max
# print(right_max)
ans = 0
for i in range(0, Z + 1):
if ans < left_max[i] + right_max[i]:
ans = left_max[i] + right_max[i]
print(ans)
| import heapq
if __name__ == '__main__':
X, Y, Z = list(map(int, input().split()))
A = []
B = []
C = []
N = X + Y + Z
for i in range(N):
tmp_a, tmp_b, tmp_c = list(map(int, input().split()))
A.append(tmp_a)
B.append(tmp_b)
C.append(tmp_c)
gold_minus_silver = [(a - b, a, b, c) for (a, b, c) in zip(A, B, C)]
gold_minus_silver.sort()
# print(gold_minus_silver)
# 左側
left_side = []
for i in range(0, Y):
heapq.heappush(left_side, (
gold_minus_silver[i][2] - gold_minus_silver[i][3], gold_minus_silver[i][2], gold_minus_silver[i][3]))
left_max = [0 for i in range(Z + 1)]
for i in range(0, Y):
left_max[0] += left_side[i][1]
left_bronze = []
for K in range(1, Z + 1):
heapq.heappush(left_side, (gold_minus_silver[K + Y - 1][2] - gold_minus_silver[K + Y - 1][3],
gold_minus_silver[K + Y - 1][2],
gold_minus_silver[K + Y - 1][3]))
left_max[K] = left_max[K - 1] + gold_minus_silver[K + Y - 1][2]
bronze = heapq.heappop(left_side)
left_max[K] += (bronze[2] - bronze[1])
# print(left_max)
# 右側
right_side = []
for i in range(Y + Z, N):
heapq.heappush(right_side, (gold_minus_silver[i][1] - gold_minus_silver[i][3], gold_minus_silver[i][1],
gold_minus_silver[i][3]))
right_max = [0 for i in range(Z + 1)]
for i in range(0, X):
right_max[Z] += right_side[i][1]
right_bronze = []
for K in range(Z - 1, -1, -1):
heapq.heappush(right_side, (gold_minus_silver[K + Y][1] - gold_minus_silver[K + Y][3],
gold_minus_silver[K + Y][1],
gold_minus_silver[K + Y][3]))
right_max[K] = right_max[K + 1] + gold_minus_silver[K + Y][1]
bronze = heapq.heappop(right_side)
right_max[K] += (bronze[2] - bronze[1])
# print(right_max)
ans = 0
for i in range(0, Z + 1):
if ans < left_max[i] + right_max[i]:
ans = left_max[i] + right_max[i]
print(ans)
| p03653 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
X,Y,Z = LI()
xyz = []
for _ in range(X+Y+Z):
x,y,z = LI()
xyz.append((x,y,z,x-y,y-z,z-x))
xyz.sort(key=lambda _: _[3] - _[2])
xs = xyz[Y+Z:]
yz = xyz[:Y+Z]
yz.sort(key=lambda _: _[4])
ys = yz[Z:]
zs = yz[:Z]
f = True
while f:
f = False
xs.sort(key=lambda _: _[3])
ys.sort(key=lambda _: -_[3])
for i in range(min(X,Y)):
if xs[i][3] - ys[i][3] >= 0:
break
# print('xy', xs[i],ys[i])
xs[i],ys[i] = ys[i],xs[i]
f = True
ys.sort(key=lambda _: _[4])
zs.sort(key=lambda _: -_[4])
for i in range(min(Y,Z)):
if ys[i][4] - zs[i][4] >= 0:
break
# print('yz', ys[i],zs[i])
ys[i],zs[i] = ys[i],zs[i]
f = True
zs.sort(key=lambda _: _[5])
xs.sort(key=lambda _: -_[5])
for i in range(min(Z,X)):
if zs[i][5] - xs[i][5] >= 0:
break
# print('zx', zs[i],xs[i])
zs[i],xs[i] = zs[i],xs[i]
f = True
xs.sort(key=lambda _: _[3])
ys.sort(key=lambda _: _[4])
zs.sort(key=lambda _: _[5])
for i in range(min([X,Y,Z])):
if xs[i][3] + ys[i][4] + zs[i][5] >= 0:
break
# print('xyz1', xs[i],ys[i],zs[i])
xs[i],ys[i],zs[i] = zs[i],xs[i],ys[i]
f = True
for i in range(min([X,Y,Z])):
if xs[-i-1][5] + ys[-i-1][3] + zs[-i-1][4] <= 0:
break
# print('xyz2', xs[-i-1],ys[-i-1],zs[-i-1])
xs[-i-1],ys[-i-1],zs[-i-1] = ys[-i-1],zs[-i-1],xs[-i-1]
f = True
r = 0
# print(xs)
# print(ys)
# print(zs)
for c in xs:
r += c[0]
for c in ys:
r += c[1]
for c in zs:
r += c[2]
return r
print(main())
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
X,Y,Z = LI()
xyz = sorted([LI() for _ in range(X+Y+Z)], key=lambda x: x[0]-x[1])
ys = xyz[:Y]
yq = []
tr = 0
for x,y,z in ys:
heapq.heappush(yq, y-z)
tr += y
ya = [tr]
for i in range(Z):
x,y,z = xyz[Y+i]
tr += y
heapq.heappush(yq, y-z)
t = heapq.heappop(yq)
tr -= t
ya.append(tr)
xs = xyz[Y+Z:]
xq = []
tr = 0
for x,y,z in xs:
heapq.heappush(xq, x-z)
tr += x
xa = [tr]
for i in range(Z):
x,y,z = xyz[-X-i-1]
tr += x
heapq.heappush(xq, x-z)
t = heapq.heappop(xq)
tr -= t
xa.append(tr)
r = 0
for a,b in zip(ya, xa[::-1]):
tr = a+b
if r < tr:
r = tr
return r
print(main())
| p03653 |
from heapq import*
f=lambda*z:list(map(int,input().split()))
X,Y,Z=f()
P=[]
Q=[]
L=[0]
R=[0]
r=list(range(X+Y+Z))
A=sorted(map(f,r),key=lambda a:a[0]-a[1])
for i in r:L+=[L[i]+A[i][1]];heappush(P,A[i][1]-A[i][2]);R+=[R[i]+A[~i][0]];heappush(Q,A[~i][0]-A[~i][2]);L[-1]-=i>=Y and heappop(P);R[-1]-=i>=X and heappop(Q)
print(max(L[i]+R[~i]for i in range(Y,Y+Z+1))) | from heapq import*
f=lambda*z:list(map(int,input().split()))
X,Y,Z=f()
P=[]
Q=[]
L=[0]
R=[0]
r=list(range(X+Y+Z))
A=sorted(map(f,r),key=lambda a:a[0]-a[1])
for i in r:L[i]-=i>Y and heappop(P);a=A[i];L+=[L[i]+a[1]];heappush(P,a[1]-a[2]);R[i]-=i>X and heappop(Q);a=A[~i];R+=[R[i]+a[0]];heappush(Q,a[0]-a[2])
print(max(L[i]+R[~i]for i in range(Y,Y+Z+1))) | p03653 |
N=int(input())
s=[0]*N
for _ in[0]*(N*~-N//2):
a,b,c,d=map(int,input().split())
s[a-1]+=3*(c>d)+(c==d)
s[b-1]+=3*(d>c)+(d==c)
b=[[]for _ in[0]*N*3]
for i in range(N):
b[s[i]]+=[i]
r=1
for x in b[::-1]:
for y in x:
s[y]=r
if x:r+=len(x)
print(*s,sep='\n')
| def f():
N=int(input())
s=[0]*N
for _ in[0]*(N*~-N//2):
a,b,c,d=map(int,input().split())
s[a-1]+=3*(c>d)+(c==d)
s[b-1]+=3*(d>c)+(d==c)
b=[[]for _ in[0]*N*3]
for i in range(N):b[s[i]]+=[i]
r=1
for x in b[::-1]:
for y in x:s[y]=r
if x:r+=len(x)
print(*s,sep='\n')
f()
| p00489 |
n=int(eval(input()));score=[list([int(x)-1 for x in input().split()]) for _ in range(int(n*(n-1)/2))];points= [0]*n
for a,b,c,d in score:
if c>d:points[a]+=3
elif c<d:points[b]+=3
else:points[a]+=1;points[b]+=1
rank=sorted(points,reverse=True)
for p in points:print((rank.index(p)+1)) | n=int(eval(input()));s=[list(map(int,input().split())) for _ in range(int(n*(n-1)/2))];p=[0]*n
for a,b,c,d in s:
if c>d:p[a-1]+=3
elif c<d:p[b-1]+=3
else:p[a-1]+=1;p[b-1]+=1
r=sorted(p,reverse=True)
for q in p:print((r.index(q)+1)) | p00489 |
from decimal import *
l=list(map(int, input().split(' ')))
a=l[0]
v=l[1]
l=list(map(int, input().split(' ')))
b=l[0]
w=l[1]
s=int(eval(input()))
ans=True
if a>b:
ans=Decimal(a)-Decimal(v*s)<=Decimal(b)-Decimal(w*s)
else:
ans=Decimal(a)+Decimal(v*s)>=Decimal(b)+Decimal(w*s)
if ans:
print("YES")
else:
print("NO")
|
l=list(map(int, input().split(' ')))
a=l[0]
v=l[1]
l=list(map(int, input().split(' ')))
b=l[0]
w=l[1]
s=int(eval(input()))
ans=True
if a>b:
ans=a-v*s<=b-w*s
else:
ans=a+v*s>=b+w*s
if ans:
print("YES")
else:
print("NO")
| p02646 |
A,V=list(map(int,input().split()))
B,W=list(map(int,input().split()))
K=int(eval(input()))
Apos=A
Bpos=B
count=0
rev=False
if B>A:
pass
else:
rev=True
if rev==False:
while K>count:
Apos=Apos+V
Bpos=Bpos+W
if Apos>=Bpos:
print("YES")
exit()
count+=1
else:
while K>count:
Apos=Apos-V
Bpos=Bpos-W
if Apos<=Bpos:
print("YES")
exit()
count+=1
print("NO") | A,V=list(map(int,input().split()))
B,W=list(map(int,input().split()))
K=int(eval(input()))
Apos=A
Bpos=B
count=0
rev=False
if B>A:
pass
else:
rev=True
if rev==False:
A=A+V*K
B=B+W*K
if A>=B:
print("YES")
exit()
else:
A=A-V*K
B=B-W*K
if A<=B:
print("YES")
exit()
print("NO") | p02646 |
import sys
from pprint import pprint
A, V = list(map(int, sys.stdin.readline().strip().split()))
B, W = list(map(int, sys.stdin.readline().strip().split()))
T = int(sys.stdin.readline().strip())
d = abs(A - B)
if d == 0:
print("YES")
elif V < W:
print("NO")
else:
if d <= T * (V - W):
print("YES")
else:
print("NO") | import sys
A, V = list(map(int, sys.stdin.readline().split()))
B, W = list(map(int, sys.stdin.readline().split()))
T = int(sys.stdin.readline())
if W < V and abs(A - B) <= (V - W) * T:
print("YES")
else:
print("NO") | p02646 |
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
sa = abs(a - b)
sas = abs(v - w)
if w >= v:
print("NO")
exit(0)
for i in range(t):
sa -= sas
if sa <= 0:
print("YES")
else:
print("NO")
| a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
sa = abs(a - b)
sas = abs(v - w)
if w >= v:
print("NO")
exit(0)
d = sa // sas
if d >t:
print("NO")
if d == t:
if sa % sas == 0:
print("YES")
else:
print("NO")
if d < t:
if sa - (d*sas) -sas <=0:
print("YES")
else:
print("NO")
| p02646 |
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(eval(input()))
while T > 0:
if A > B:
A -= V
B -= W
else:
A += V
B += W
if A == B:
print("YES")
exit()
T -= 1
print("NO") | A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(eval(input()))
if V <= W:
print("NO")
exit()
dis = abs(A - B)
step = abs(W - V)
print(("YES" if dis <= step * T else "NO")) | p02646 |
import sys
input = sys.stdin.readline
a, v = list(map(int,input().split()))
b, w = list(map(int,input().split()))
t = int(eval(input()))
for i in range(t):
a = a + v
b = b + w
if a >= b :
print("YES")
else:
print("NO") |
a, v = list(map(int,input().split()))
b, w = list(map(int,input().split()))
t = int(eval(input()))
if a > b:
v = -v
if w > 0:
w = -w
if a < b and w < 0:
w = -w
A = t * v + a
B = t * w + b
if A > B:
if a < b:
print("YES")
else:
print("NO")
elif A == B:
print("YES")
elif A < B :
if a < b:
print("NO")
else:
print("YES") | p02646 |
A,V=list(map(int, input().split()))
B,W=list(map(int, input().split()))
T = int(eval(input()))
k = abs(A-B)
d = V-W
if d <= 0:
print("NO")
else:
for i in range(T):
k -= d
if k <= 0:
print("YES")
break
else:
print("NO")
| A,V=list(map(int, input().split()))
B,W=list(map(int, input().split()))
T = int(eval(input()))
k = abs(A-B)
d = V-W
if d <= 0:
print("NO")
else:
if (k / d) > T:
print("NO")
else:
print("YES")
| p02646 |
a,v,b,w,t=list(map(int,open(0).read().split()))
print((['NO','YES'][abs(b-a)<=(v-w)*t])) | a,v,b,w,t=list(map(int,open(0).read().split()))
print(('YNEOS'[abs(b-a)>(v-w)*t::2])) | p02646 |
A,V=list(map(int,input().split()))
B,W=list(map(int,input().split()))
T=int(eval(input()))
if W>=V:
print("NO")
else:
if abs(A-B)/(V-W)<=T:
print("YES")
else:
print("NO") | A,V=list(map(int,input().split()))
B,W=list(map(int,input().split()))
T=int(eval(input()))
if W>=V:
print("NO")
else:
if abs(A-B)<=(V-W)*T:
print("YES")
else:
print("NO") | p02646 |
def onigokko():
A,V = list(map(int, input().split()))
B,W = list(map(int, input().split()))
T = int(eval(input()))
if B < A:
swap = A
A = B
B = swap
for i in range(T):
# Aから一番遠い所へ移動
B += W
# Aを動かす
# 一番遠い所へ移動
A += V
# もし、A>=Bなら鬼の勝ち
if A >= B:
print('YES')
return
print('NO')
onigokko() | def onigokko():
A,V = list(map(int, input().split()))
B,W = list(map(int, input().split()))
T = int(eval(input()))
if B < A:
swap = A
A = B
B = swap
tikaduku = V - W
# 遠ざかったらアウト
if tikaduku < 1:
return 'NO'
kyori = B - A
if kyori <= tikaduku * T:
return 'YES'
return 'NO'
print((onigokko())) | p02646 |
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if v <= w:
print('NO')
else:
if 1 <= (abs(b - a) / (v - w)) <= t:
print('YES')
else:
print('NO') | a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if v <= w:
print('NO')
else:
if -1 < ((b - a) / (v - w)) < 1:
print('NO')
elif 1 <= (abs(b - a) / (v - w)) <= t:
print('YES')
else:
print('NO') | p02646 |
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if v <= w:
print('NO')
else:
if -1 < ((b - a) / (v - w)) < 1:
print('NO')
elif 1 <= (abs(b - a) / (v - w)) <= t:
print('YES')
else:
print('NO') | # ac
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if v <= w:
print('NO')
else:
if 1 <= (abs(b - a) / (v - w)) <= t:
print('YES')
else:
print('NO') | p02646 |
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(eval(input()))
flg = 0
for _ in range(t):
if a < b:
if v <= w:
break
if a+v >= b+w:
flg = 1
break
a = a+v
b= b+w
else:
if v <= w:
break
if a-v <= b-w:
flg = 1
break
a = a-v
b=b-w
if flg == 0:
print("NO")
else:
print("YES") | import sys
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(eval(input()))
if v<=w:
print("NO")
sys.exit()
if a<b:
if a+t*v>=b+t*w:
print("YES")
else:
print("NO")
else:
if a-t*v<=b-t*w:
print("YES")
else:
print("NO")
| p02646 |
a,v=list(map(int,input().split()))
b,w=list(map(int,input().split()))
t=int(eval(input()))
k=abs(a-b)
if w-v>0:
print("NO")
elif w==v:
if k==0:
print("YES")
else:
print("NO")
else:
if k<=(v-w)*t:
print("YES")
else:
print("NO") | a,v=list(map(int,input().split()))
b,w=list(map(int,input().split()))
t=int(eval(input()))
k=abs(a-b)
if 0<=k<=(v-w)*t and v!=w:
print("YES")
else:
print("NO") | p02646 |
# -*- coding: utf-8 -*-
def main():
import sys
input = sys.stdin.readline
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if v == w:
print('NO')
exit()
if a <= b:
if 0 < ((b - a) / (v - w)) <= t:
print('YES')
else:
print('NO')
else:
if 0 < ((b - a) / (w - v)) <= t:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
def main():
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if v <= w:
print('NO')
exit()
if a <= b:
if 0 <= (b - a) <= t * (v - w):
print('YES')
else:
print('NO')
else:
if 0 <= (a - b) <= t * (v - w):
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
| p02646 |
import sys
readline = sys.stdin.buffer.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a, v = list(map(int, readline().split()))
b, w = list(map(int, readline().split()))
t = int(eval(input()))
dist = abs(b - a)
vel = v - w
if vel * t >= dist:
print("YES")
else:
print("NO")
if __name__ == '__main__':
main()
| a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
dist = abs(b - a)
r_vel = v - w
if r_vel * t >= dist:
print("YES")
else:
print("NO") | p02646 |
if __name__ == '__main__':
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if w>= v:
print("NO")
else:
flag = False
if a == b:
flag = True
for i in range(t):
if b>a:
a+=v
b+=w
else:
a-=v
b-=w
if a==b:
flag=True
if flag:
print("YES")
else:
print("NO")
| if __name__ == '__main__':
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
l =abs(a - b)
s=abs(v - w)
if w >= v or l / s > t:
print("NO")
else:
print("YES")
| p02646 |
# tokiomarine2020_b.py
A,V = list(map(int,input().split()))
B,W = list(map(int,input().split()))
T = int(eval(input()))
if V<=W:
print('NO')
exit()
if A<B:
for i in range(T):
A += V
B += W
if A>=B:
print('YES')
exit()
else:
for i in range(T):
A -= V
B -= W
if A<=B:
print('YES')
exit()
print("NO")
| # tokiomarine2020_b.py
A,V = list(map(int,input().split()))
B,W = list(map(int,input().split()))
T = int(eval(input()))
if V<=W:
print('NO')
exit()
if A<B:
A = A+T*V
B = B+T*W
if A>=B:
print('YES')
exit()
else:
A = A-T*V
B = B-T*W
if A<=B:
print('YES')
exit()
print("NO")
| p02646 |
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(eval(input()))
# if (v-w)*t>=(b-a):print("YES")
# else:print("NO")
q = abs(a-b)
e = (v-w)*t
if q<=e:
print("YES")
else:
print("NO") | a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(eval(input()))
if (v-w)*t>=abs(b-a):print("YES")
else:print("NO") | p02646 |
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(eval(input()))
# print(a,v)
# print(b,w)
# print(t)
dl = abs(a-b)
dv = v-w # 鬼のほうが速い？＋
# print(dl,dv)
if dl == 0:
print('YES')
else:
if dv > 0:
# print(dl//dv)
if (dl+dv-1)//abs(dv) <= t:
# if dl//dv <= t:
print('YES')
else:
print('NO')
else:
print('NO')
| a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
dl = abs(a - b)
dv = v - w
if dv > 0 and (dl+dv-1) // abs(dv) <= t: print('YES')
else: print('NO')
| p02646 |
def main():
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(eval(input()))
if A == B:
print('YES')
return
d = abs(A - B)
dv = V - W
if d <= dv * T:
print('YES')
else:
print('NO')
return
if __name__ == '__main__':
main()
# import sys
# input = sys.stdin.readline
#
# sys.setrecursionlimit(10 ** 7)
#
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
# while abs(ok - ng) > 1:
# mid = (ok + ng) // 2
# if func(mid):
# ok = mid
# else:
# ng = mid
# return ok
| def main():
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(eval(input()))
d = abs(A - B)
s = V - W
print(('YES' if T * s >= d else 'NO'))
if __name__ == '__main__':
main()
| p02646 |
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
ans = 'NO'
for i in range(t):
if a < b:
a += v
b += w
else:
a -= v
b -= w
if a == b:
ans = 'YES'
break
print(ans)
| a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if abs(a - b) <= (v -w) * t:
print('YES')
else:
print('NO')
| p02646 |
from sys import stdin
input = stdin.readline
A,V = input().rstrip().split()
B,W = input().rstrip().split()
T = int(input().rstrip())
A,V,B,W = int(A),int(V),int(B),int(W)
s=0
if V<=W:
print('NO')
s=1
else:
for t in range(T):
if B<A:
A-=V
B-=W
if B>=A:
print('YES')
s=1
break
else:
A+=V
B+=W
if B<=A:
print('YES')
s=1
break
if s!=1:
print('NO') | from sys import stdin
input = stdin.readline
A,V = input().rstrip().split()
B,W = input().rstrip().split()
T = int(input().rstrip())
A,V,B,W = int(A),int(V),int(B),int(W)
s=0
L1=A-B
L2=B-A
S=V-W
if V<=W:
print('NO')
s=1
else:
if B<A:
if L1/S<=T:
print('YES')
else:print('NO')
else:
if L2/S<=T:
print('YES')
else:print('NO') | p02646 |
import sys
import itertools
from math import gcd
from math import sqrt
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
return list(map(int,input().split()))
def ii():
return int(eval(input()))
sys.setrecursionlimit(10**9)
A,VA = mips()
B,VB = mips()
T = ii()
if A <= B:
d1 = A + VA * T
d2 = B + VB * T
if d1 >= d2:
print("YES")
else:
print("NO")
else:
d2 = B - VB * T
d1 = A - VA * T
if d1 <= d2:
print("YES")
else:
print("NO") | import sys
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
return list(map(int,input().split()))
def ii():
return int(eval(input()))
sys.setrecursionlimit(10**9)
A,VA = mips()
B,VB = mips()
T = ii()
if A <= B:
d1 = A + VA * T
d2 = B + VB * T
if d1 >= d2:
print("YES")
else:
print("NO")
else:
d2 = B - VB * T
d1 = A - VA * T
if d1 <= d2:
print("YES")
else:
print("NO") | p02646 |
A, V = [int(n) for n in input().split()]
B, W = [int(n) for n in input().split()]
T = int(eval(input()))
if V <= W:
print('NO')
exit()
va = [A + V * t for t in range(1, T+1)]
va.extend([A - V * t for t in range(1, T+1)])
vb = [B + W * t for t in range(1, T+1)]
vb.extend([B - W * t for t in range(1, T+1)])
for a in va:
for b in vb:
if a == b:
print('YES')
exit()
print('NO')
| A, V = [int(n) for n in input().split()]
B, W = [int(n) for n in input().split()]
T = int(eval(input()))
if V <= W:
print('NO')
exit()
d = abs(A - B)
if V > W and d <= (V - W) * T:
print('YES')
else:
print('NO')
| p02646 |
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
from decimal import Decimal
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if a == b:
print("YES")
elif v <= w:
print("NO")
elif a < b and w*t + b > v*t + a:
print("NO")
elif a < b and -(w*t) + b < -(v*t) + a:
print("NO")
else:
now_a = a
now_b = b
for i in range(1, t+1):
if now_a < now_b:
now_a += v
now_b += w
else:
now_a -= v
now_b -= w
if now_a == now_b:
print("YES")
exit()
else:
pass
print("NO") | a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
if (v-w)*t >= abs(a-b):
print("YES")
else:
print("NO") | p02646 |
a,v = list(map(int, input().split()))
b,w = list(map(int, input().split()))
T = int(eval(input()))
if v == w:
print("NO")
exit()
for i in range(0,T+1):
if a == b:
print("YES")
exit()
else:
if a < b:
a = a+v
b = b+w
else:
a = a-v
b = b-w
print("NO") | a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
T = int(eval(input()))
if abs((b-a))<=(v-w)*T:
print("YES")
else:
print("NO") | p02646 |
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
dist = abs(b - a)
mys = v - w
for i in range(t):
dist -= mys
if dist <= 0:
print("YES")
exit()
print("NO") | a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(eval(input()))
dist = abs(b - a)
mys = v - w
if mys * t >= dist:
print("YES")
else:
print("NO") | p02646 |
A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(eval(input()))
ok = False
for i in range(T+1):
if A + (V*T) >= B + (W*T):
ok = True
if ok:
print("YES")
else:
print("NO")
| A, V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(eval(input()))
if V<=W:
print("NO")
import sys
sys.exit()
import math
if abs(B-A)/(V-W) <= T:
print("YES")
else:
print("NO")
| p02646 |
table= {}
def solve(dict,key):
global table
if key in table:
# print('key=',key)
return table[key]
ret = []
#print(key)
for i in dict[key]:
if i[0] == '[':
ret.append(i[1:-1])
else:
ret += (solve(dict, i))
if len(ret) > 200:
for i in list(table.keys()):
table[i]=''
return ''
table[key] = ret
#print(key)
return ret
Na, Nt, Ng, Nc = [int(i) for i in input().split()]
m = int(eval(input()))
dict = {}
for i in range(m):
key, value = [i for i in input().split(': ')]
if i == 0:
aa = key
value = value.split()
dict[key] = value
lis = solve(dict, aa)
if len(lis)==Na+Nt+Ng+Nc:
DP = [[[[0 for i in range(Ng+1)]for j in range(Nt+1)]for k in range(Na+1)]for l in range(len(lis)+1)]
#print(DP[4])
DP[0][0][0][0] = 1
#print(DP)
for i in range(len(lis)):
str = lis[i]
for a in range(i+1):
if a > Na:
break
for t in range(i-a+1):
if t > Nt:
break
for g in range(i-a-t+1):
if g > Ng:
break
# print(i,a,t,g)
if i-a-t-g > Nc:
continue
ans = DP[i][a][t][g] % 1000000007
# print(ans)
for char in str:
# print(i,a,t,g)
if char == 'A':
if a+1 > Na:
continue
# print(i,a,t,g)
DP[i+1][a+1][t][g] += ans
# print(DP[i+1][a+1][t][g])
elif char == 'T':
if t+1 > Nt:
continue
# print(i)
DP[i+1][a][t+1][g] += ans
elif char == 'G':
if g+1 > Ng:
continue
#print(i)
DP[i+1][a][t][g+1] += ans
elif char == 'C':
if i-a-t-g+1> Nc:
continue
#print(i)
DP[i+1][a][t][g] += ans
# print(DP)
#DP[i][a][t][g] = ans % 1000000007
print((DP[len(lis)][Na][Nt][Ng]%1000000007))
else:
print((0))
| table= {}
def solve(dict,key):
global table
if key in table:
# print('key=',key)
return table[key]
ret = []
#print(key)
for i in dict[key]:
if i[0] == '[':
ret.append(i[1:-1])
else:
ret += (solve(dict, i))
if len(ret) > 200:
for i in list(table.keys()):
table[i]=''
return ''
table[key] = ret
#print(key)
return ret
Na, Nt, Ng, Nc = [int(i) for i in input().split()]
m = int(eval(input()))
dict = {}
for i in range(m):
key, value = [i for i in input().split(': ')]
if i == 0:
aa = key
value = value.split()
dict[key] = value
lis = solve(dict, aa)
if len(lis)==Na+Nt+Ng+Nc:
DPC = [[[0 for j in range(Ng+1)]for k in range(Nt+1)]for l in range(Na+1)]
DPN = [[[0 for j in range(Ng+1)]for k in range(Nt+1)]for l in range(Na+1)]
#print(DP[4])
DPC[0][0][0] = 1
#print(DP)
for i in range(len(lis)):
str = lis[i]
for a in range(i+1):
if a > Na:
break
for t in range(i-a+1):
if t > Nt:
break
for g in range(i-a-t+1):
if g > Ng:
break
# print(i,a,t,g)
if i-a-t-g > Nc:
continue
ans = DPC[a][t][g] % 1000000007
# print(ans)
for char in str:
# print(i,a,t,g)
if char == 'A':
if a+1 > Na:
continue
# print(i,a,t,g)
DPN[a+1][t][g] += ans
# print(DP[i+1][a+1][t][g])
elif char == 'T':
if t+1 > Nt:
continue
# print(i)
DPN[a][t+1][g] += ans
elif char == 'G':
if g+1 > Ng:
continue
#print(i)
DPN[a][t][g+1] += ans
elif char == 'C':
if i-a-t-g+1> Nc:
continue
#print(i)
DPN[a][t][g] += ans
# print(DP)
#DP[i][a][t][g] = ans % 1000000007
DPC = DPN
DPN = [[[0 for j in range(Ng+1)]for k in range(Nt+1)]for l in range(Na+1)]
print((DPC[Na][Nt][Ng]%1000000007))
else:
print((0))
| p01551 |
table= {}
def solve(dict,key):
global table
if key in table:
# print('key=',key)
return table[key]
ret = []
#print(key)
for i in dict[key]:
if i[0] == '[':
ret.append(i[1:-1])
else:
ret += (solve(dict, i))
if len(ret) > 200:
for i in list(table.keys()):
table[i]=''
return ''
table[key] = ret
#print(key)
return ret
Na, Nt, Ng, Nc = [int(i) for i in input().split()]
m = int(eval(input()))
dict = {}
for i in range(m):
key, value = [i for i in input().split(': ')]
if i == 0:
aa = key
value = value.split()
dict[key] = value
lis = solve(dict, aa)
if len(lis)==Na+Nt+Ng+Nc:
DP = [[[[0 for i in range(Ng+1)]for j in range(Nt+1)]for k in range(Na+1)]for l in range(len(lis)+1)]
#print(DP[4])
DP[0][0][0][0] = 1
#print(DP)
for i in range(len(lis)):
str = lis[i]
for a in range(i+1):
if a > Na:
break
for t in range(i-a+1):
if t > Nt:
break
for g in range(i-a-t+1):
if g > Ng:
break
# print(i,a,t,g)
if i-a-t-g > Nc:
continue
ans = DP[i][a][t][g] % 1000000007
# print(ans)
for char in str:
# print(i,a,t,g)
if char == 'A':
if a+1 > Na:
continue
# print(i,a,t,g)
DP[i+1][a+1][t][g] += ans
# print(DP[i+1][a+1][t][g])
elif char == 'T':
if t+1 > Nt:
continue
# print(i)
DP[i+1][a][t+1][g] += ans
elif char == 'G':
if g+1 > Ng:
continue
#print(i)
DP[i+1][a][t][g+1] += ans
elif char == 'C':
if i-a-t-g+1> Nc:
continue
#print(i)
DP[i+1][a][t][g] += ans
# print(DP)
#DP[i][a][t][g] = ans % 1000000007
print((DP[len(lis)][Na][Nt][Ng]%1000000007))
else:
print((0))
| table= {}
def solve(dict,key):
global table
if key in table:
# print('key=',key)
return table[key]
ret = []
#print(key)
for i in dict[key]:
if i[0] == '[':
ret.append(i[1:-1])
else:
ret += (solve(dict, i))
if len(ret) > 200:
for i in list(table.keys()):
table[i]=''
return ''
table[key] = ret
#print(key)
return ret
Na, Nt, Ng, Nc = [int(i) for i in input().split()]
m = int(eval(input()))
dict = {}
for i in range(m):
key, value = [i for i in input().split(': ')]
if i == 0:
aa = key
value = value.split()
dict[key] = value
lis = solve(dict, aa)
if len(lis)==Na+Nt+Ng+Nc:
DP = [[[[0 for i in range(Nc+1)] for j in range(Ng+1)]for k in range(Nt+1)]for l in range(Na+1)]
#DPN = [[[0 for j in range(Ng+1)]for k in range(Nt+1)]for l in range(Na+1)]
#print(DP[4])
DP[0][0][0][0] = 1
# print(DPC)
#print(DP)
for i in range(len(lis)):
hA=hT=hG=hC=False
#print(i)
for char in lis[i]:
if char == 'A':
hA = True
elif char == 'G':
hG = True
elif char == 'T':
hT = True
else:
hC = True
# print(hA,hT,hG,hC)
for a in range(i+1):
if a > Na:
break
for t in range(i-a+1):
if t > Nt:
break
for g in range(i-a-t+1):
if g > Ng:
break
# print(i,a,t,g)
c = i-a-t-g
if c > Nc:
continue
ans = DP[a][t][g][c] % 1000000007
# print(ans)
if hA and a+1 <= Na:
DP[a+1][t][g][c] += ans
# print(DP[i+1][a+1][t][g])
if hT and t+1 <= Nt:
# print(i)
DP[a][t+1][g][c] += ans
if hG and g+1 <= Ng:
#print(i)
DP[a][t][g+1][c] += ans
if hC and c+1 <= Nc:
#print(i)
DP[a][t][g][c+1] += ans
# print(DPC)
#DP[i][a][t][g] = ans % 1000000007
#DPC = DPN
#DPN = [[[0 for j in range(Ng+1)]for k in range(Nt+1)]for l in range(Na+1)]
print((DP[Na][Nt][Ng][Nc]%1000000007))
else:
print((0))
| p01551 |
n=int(eval(input()))
nn=n
l=len(str(n))
k=0
for i in range(n):
k+=n%10
n=n//10
print((['No','Yes'][nn%k==0])) | n=int(eval(input()))
nn=n
l=len(str(n))
k=0
for i in range(n):
k+=n%10
n=n//10
if(n == 0):
break
print((['No','Yes'][nn%k==0])) | p03316 |
N = int(eval(input()))
S = str(N)
total = 0
for s in S:
total += int(s)
print(("Yes" if N%total==0 else "No")) | N = int(eval(input()))
S,N2 = 0,N
while N2 >= 1:
S += N2%10
N2 //= 10
print(("Yes" if N%S==0 else "No")) | p03316 |
# -*- coding: utf-8 -*-
# 標準入力を取得
N = int(eval(input()))
# 求解処理
def S(n: int) -> int:
return sum(map(int, str(n)))
ans = str()
if N % S(N) == 0:
ans = "Yes"
else:
ans = "No"
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
N = int(eval(input()))
return N
def S(n: int) -> int:
"""
各桁の和を取得する.
Args:\n
n (int): 整数
Returns:\n
int: 各桁の和
"""
return sum(map(int, str(n)))
def main(N: int) -> None:
"""
メイン処理.
Args:\n
N (int): 整数(1 <= N <= 10**9)
"""
# 求解処理
ans = str()
if N % S(N) == 0:
ans = "Yes"
else:
ans = "No"
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N = get_input()
# メイン処理
main(N)
| p03316 |
def sum_digit(num):
sum = 0
while num > 0:
sum += num % 10
num //= 10
return sum
N = int(eval(input()))
S = sum_digit(N)
if N % S == 0:
print("Yes")
else:
print("No") | def sum_digit(num):
sum = 0
while num > 0:
sum += num % 10
num //= 10
return sum
N = int(eval(input()))
print(("Yes" if N % sum_digit(N) == 0 else "No")) | p03316 |
n = int(eval(input()))
a = list(str(n))
s = sum([int(a[i]) for i in range(len(a))])
if n%s==0:
print('Yes')
else:
print('No') | n = int(eval(input()))
a = list(str(n))
c = 0
for i in range(len(a)):
c+=int(a[i])
if n%c==0:
print('Yes')
else:
print('No') | p03316 |
N = int(eval(input()))
sum = 0
a = N
while a > 0:
sum += a % 10
a = a // 10
if N % sum == 0:
print('Yes')
else:
print('No')
| n = str(eval(input())); print(("Yes" if int(n) % sum([int(n[i]) for i in range(len(n))]) == 0 else "No")) | p03316 |
N = int(eval(input()))
L = len(str(N))
S = sum([N // 10**i for i in range(1, N+1)])
if N % S == 0:
print("Yes")
else:
print("No") | N = str(eval(input()))
S = sum([int(i) for i in N])
if int(N) % S == 0:
print("Yes")
else:
print("No") | p03316 |
N = int(eval(input()))
if(N%sum(map(int,str(N))) == 0):
print("Yes")
else:
print("No") | N = int(eval(input()))
if(N%sum(list(map(int,str(N)))) == 0):
print("Yes")
else:
print("No") | p03316 |
import queue
while 1:
n,k=list(map(int,input().split()))
if n==0:break
a=queue.deque(int(eval(input())) for _ in range(k))
m=sum(a)
for i in range(n-k):
a.popleft()
a.append(int(eval(input())))
m=max(m,sum(a))
print(m) | import queue
while 1:
n,k=list(map(int,input().split()))
if n==0:break
a=queue.deque(int(eval(input())) for _ in range(k))
m=b=sum(a)
for i in range(n-k):
c=a.popleft()
d=int(eval(input()))
a.append(d)
b+=d-c
m=max(b,m)
print(m) | p00439 |
while True:
n,k=list(map(int,input().split()))
if n==k==0:break
L=[eval(input()) for i in range(n)]
maxInt=-100000
for i in range(n-k):
maxInt=max(maxInt,sum(L[i:i+k]))
print(maxInt) | while True:
n,k=list(map(int,input().split()))
if n==k==0:break
L=[eval(input()) for i in range(n)]
maxInt=-10000000
temp=sum(L[:k])
for i in range(k,n):
maxInt=max(maxInt,temp)
temp=temp+L[i]-L[i-k]
print(maxInt) | p00439 |
while True:
n,k = list(map(int,input().split()))
if n == 0 and k == 0:
break
lst = []
for i in range(n):
lst.append(int(eval(input())))
count = 0
for i in range(k):
count += lst[i]
ans = count
for i in range(k, n):
count += lst[i]
count -= lst[i - k]
ans = max(ans,count)
print(ans)
| def main():
while True:
n,k = list(map(int,input().split()))
if n == 0 and k == 0:
break
lst = []
for i in range(n):
lst.append(int(eval(input())))
count = 0
for i in range(k):
count += lst[i]
ans = count
for i in range(k, n):
count += lst[i]
count -= lst[i - k]
ans = max(ans,count)
print(ans)
if __name__ == '__main__':
main()
| p00439 |
from collections import deque
while True:
n, k = list(map(int, input().split()))
if n==0:break
a = deque(int(eval(input())) for _ in range(k))
ans = sum(a)
for _ in range(n-k):
a.popleft()
a.append(int(eval(input())))
tmp = sum(a)
if ans < tmp: ans = tmp
print(ans) | from collections import deque
while True:
n, k = list(map(int, input().split()))
if n==0:break
a = deque(int(eval(input())) for _ in range(k))
ans=tmp=sum(a)
for _ in range(n-k):
x = a.popleft()
y = int(eval(input()))
a.append(y)
tmp += y - x
ans = max(ans, tmp)
print(ans) | p00439 |
import sys
#fp = open("input.txt", "r")
fp = sys.stdin
while True:
req = list(map(int, fp.readline()[:-1].split(" ")))
if req[0] + req[1] == 0:
break
n = req[0]
k = req[1]
sum_max = 0
num_list = []
for i in range(n):
num = int(fp.readline()[:-1])
num_list.append(num)
if k > 0:
sum_max += num
k -= 1
continue
else:
num_list.pop(0)
sum_tmp = sum(num_list)
if sum_tmp > sum_max:
sum_max = sum_tmp
print(sum_max) | import sys
#fp = open("input.txt", "r")
fp = sys.stdin
while True:
req = list(map(int, fp.readline()[:-1].split(" ")))
if req[0] + req[1] == 0:
break
n = req[0]
k = req[1]
sum_max = 0
sum_prev = 0
num_list = []
for i in range(n):
num = int(fp.readline()[:-1])
num_list.append(num)
if k > 0:
sum_max += num
k -= 1
sum_prev = sum_max
continue
else:
sum_tmp = sum_prev + num - num_list.pop(0)
sum_prev = sum_tmp
if sum_tmp > sum_max:
sum_max = sum_tmp
print(sum_max) | p00439 |
# coding: utf-8
# Your code here!
n,H=list(map(int,input().split()))
S=[]
for i in range(n):
S.append(list(map(int,input().split())))
a=[]
b=[]
for i in range(n):
a.append(S[i][0])
for i in range(n):
if(max(a)<S[i][1]):
b.append(S[i][1])
b.sort()
b.reverse()
k=0
count=0
while H>0:
if len(b)>k:
H-=b[k]
k+=1
count+=1
else:
count+=H//max(a)
if(H%max(a)!=0):
count+=1
H=0
print(count)
| # coding: utf-8
# Your code here!
n,H=list(map(int,input().split()))
S=[]
for i in range(n):
S.append(list(map(int,input().split())))
a=[]
b=[]
for i in range(n):
a.append(S[i][0])
maxa=max(a)
for i in range(n):
if(maxa<S[i][1]):
b.append(S[i][1])
b.sort()
b.reverse()
k=0
count=0
lenb=len(b)
while H>0:
if lenb>k:
H-=b[k]
k+=1
count+=1
else:
count+=H//maxa
if(H%maxa!=0):
count+=1
H=0
print(count)
| p03472 |
n,h=list(map(int,input().split()))
ab=[list(map(int,input().split())) for i in range(n)]
a_max=0
b=[]
ans=0
kaisuu=0
for i in range(n):
if a_max<ab[i][0]:
a_max=ab[i][0]
for i in range(n):
b.append(ab[i][1])
b.sort(reverse=True)
i=0
while True:
if len(b)>i and a_max<b[i]:
h-=b[i]
kaisuu+=1
else:
if h%a_max==0:
kaisuu+=(h//a_max)
else:
kaisuu+=((h//a_max)+1)
break
if h<=0:
break
i+=1
print(kaisuu) | n,h=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)
A=max(A)
B.sort(reverse=True)
count=0
for i in B:
if A>i:
break
else:
if h>0:
h-=i
count+=1
else:
break
if h%A==0 and h>0:
print((count+h//A))
elif h%A!=0 and h>0:
print((count+h//A+1))
else:
print(count) | p03472 |
n,h=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
a=[l[i][0] for i in range(n)]
maxA=max(a)
b=[l[i][1] for i in range(n)]
b.sort()
b.reverse()
damage=0
count=0
f=0
for i in range(n):
if damage>=h:
f=1
break
else:
if b[i]>max(a):
damage+=b[i]
count+=1
else:
break
if f==1:
print(count)
else:
count+=((h-damage-1)//maxA)+1
print(count) | n,h=list(map(int,input().split()))
l=[list(map(int,input().split())) for i in range(n)]
a=set()
for i in range(n):
a.add(l[i][0])
maxA=max(a)
b=[]
for i in range(n):
if l[i][1]>maxA:
b.append(l[i][1])
b.sort()
b.reverse()
damage=0
count=0
f=0
for i in range(len(b)):
if damage>=h:
f=1
break
else:
if b[i]>maxA:
damage+=b[i]
count+=1
else:
break
if f==1:
print(count)
else:
count+=((h-damage-1)//maxA)+1
print(count) | p03472 |
N, H = list(map(int,input().split()))
L = []
maxi = 0
for _ in range(N):
a,b = list(map(int,input().split()))
maxi = max(maxi, a)
L.append((a,b))
L = [x for x in L if x[1] > maxi]
L = sorted(L,key = lambda x:x[1],reverse=True)
throw = 0
for i in range(len(L)):
throw += L[i][1]
if throw >= H:
print((i + 1))
quit()
from math import ceil
print((ceil((H - throw) / maxi) + len(L)))
| N, H = list(map(int,input().split()))
L = []
maxi = 0
for _ in range(N):
a,b = list(map(int,input().split()))
maxi = max(maxi, a)
L.append(b)
L = sorted([x for x in L if x > maxi],reverse=True)
throw = 0
for i in range(len(L)):
throw += L[i]
if throw >= H:
print((i + 1))
quit()
from math import ceil
print((ceil((H - throw) / maxi) + len(L)))
| p03472 |
import sys
N, H = list(map(int, sys.stdin.readline().split()))
katanas = []
for i in range(N):
a, b = list(map(int, sys.stdin.readline().split()))
katanas.append((a, b, i))
sk = sorted(katanas, reverse=True)
max_k = sk[0][0]
katanas.sort(key = lambda x:x[1], reverse=True)
ans = 0
i = 0
while H > 0:
if i < N and katanas[i][1] > max_k:
H -= katanas[i][1]
i += 1
ans += 1
else:
tmp = (H - 1) // max_k + 1
H -= tmp * max_k
ans += tmp
print(ans) | import sys
input = sys.stdin.readline
N, H = list(map(int, input().split()))
katanas = []
for _ in range(N):
a, b = list(map(int, input().split()))
katanas.append((a, b))
max_a = sorted(katanas, reverse=True)[0][0]
throws = []
for a, b in katanas:
if max_a < b:
throws.append(b)
ans = 0
for b in sorted(throws, reverse=True):
H -= b
ans += 1
if H <= 0:
print(ans)
sys.exit()
print((ans + (H - 1) // max_a + 1)) | p03472 |
n,h=list(map(int,input().split()))
A=[]
B=[]
C=[]
for i in range(n):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
amax=max(A)
for i in range(n):
if amax<=B[i]:
C.append(B[i])
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
cnt=0
ans=0
for i in range(len(C)):
if ans<h:
ans+=C[i]
else:
break
cnt+=1
if ans<h:
if ((h-ans)//amax)*amax>=h-ans:
cnt+=(h-ans)//amax
else:
cnt+=(h-ans)//amax+1
print(cnt) | n,h=list(map(int,input().split()))
A=[]
B=[]
C=[]
for i in range(n):
a,b=list(map(int,input().split()))
A.append(a)
B.append(b)
amax=max(A)
for i in range(n):
if amax<=B[i]:
C.append(B[i])
A.sort(reverse=True)
B.sort(reverse=True)
C.sort(reverse=True)
cnt=0
ans=0
for i in range(len(C)):
if ans<h:
ans+=C[i]
else:
break
cnt+=1
if ans<h:
if ((h-ans)//amax)*amax<h-ans:
cnt+=(h-ans)//amax+1
else:
cnt+=(h-ans)//amax
print(cnt)
| p03472 |
N, H = ( int(i) for i in input().split() )
ka = []
kb = []
for i in range(N):
a, b = ( int(i) for i in input().split() )
ka.append(a)
kb.append(b)
kb.sort()
kb.reverse()
hp = H
res = 0
for b in kb:
if b < max(ka):
continue
hp = hp - b
res += 1
if hp <= 0:
break
else:
res += (hp + max(ka) - 1)//max(ka)
print(res)
| N, H = ( int(i) for i in input().split() )
ka = []
kb = []
for i in range(N):
a, b = ( int(i) for i in input().split() )
ka.append(a)
kb.append(b)
kb.sort()
kb.reverse()
ma = max(ka)
hp = H
res = 0
for b in kb:
if b < ma:
continue
hp = hp - b
res += 1
if hp <= 0:
break
else:
res += (hp + ma - 1)//ma
print(res)
| p03472 |
from math import ceil
n, h = list(map(int, input().split()))
a = []
b = []
for i in range(n):
p, q = list(map(int, input().split()))
a.append(p)
b.append(q)
b.sort(reverse=1)
ans=0
m=max(a)
while(h>0 and len(b) != 0):
if b[0] < m:
break
h-=b[0]
b.pop(0)
ans+=1
if h>0:
ans+=ceil(h/m)
print(ans) | from math import ceil
n, h = list(map(int, input().split()))
a = []
b = []
for i in range(n):
p, q = list(map(int, input().split()))
a.append(p)
b.append(q)
b.sort(reverse=1)
ans=0
m=max(a)
for i in b:
if i < m or h<=0:
break
h-=i
ans+=1
if h>0:
ans+=ceil(h/m)
print(ans) | p03472 |
N, H = list(map(int, input().split()))
slash = 0
Throw = []
for _ in range(N):
a, b = list(map(int, input().split()))
slash = max(slash, a)
if b > a: Throw.append(b)
#slash=斬撃最大ダメージ、投げてslash超のダメージが出るならばその剣をダメージが大きい順に投げる
import heapq as hq
Throw = [-th for th in Throw if th > slash]
hq.heapify(Throw)
dmg, cnt = 0, 0
while len(Throw) != 0:
if dmg >= H: break
dmg += -hq.heappop(Throw)
cnt += 1
if dmg < H:
from math import ceil
cnt += ceil((H-dmg)/slash)
print(cnt) | N, H = list(map(int, input().split()))
slash = 0
Throw = []
for _ in range(N):
a, b = list(map(int, input().split()))
slash = max(slash, a)
if b > a: Throw.append(b)
#slash=斬撃最大ダメージ、投げてslash超のダメージが出るならばその刀をダメージが大きい順に投げる
Throw = sorted([th for th in Throw if th > slash], reverse=True)
dmg, cnt = 0, 0
for throw in Throw:
if dmg >= H: break
dmg += throw
cnt += 1
if dmg < H:
from math import ceil
cnt += ceil((H-dmg)/slash)
print(cnt) | p03472 |
N, H = list(map(int, input().split()))
slash = 0
Throw = []
for _ in range(N):
a, b = list(map(int, input().split()))
slash = max(slash, a)
if b > a: Throw.append(b)
#slash=斬撃最大ダメージ、投げてslash超のダメージが出るならばその刀をダメージが大きい順に投げる
Throw = sorted([th for th in Throw if th > slash], reverse=True)
dmg, cnt = 0, 0
for throw in Throw:
if dmg >= H: break
dmg += throw
cnt += 1
if dmg < H:
from math import ceil
cnt += ceil((H-dmg)/slash)
print(cnt) |
def main():
with open(0) as f:
N, H = list(map(int, f.readline().split()))
ab = list(map(int, f.read().split()))
max_slash = max(ab[0::2])
throw = sorted([x for x in ab[1::2] if x > max_slash], reverse=True)
cnt = 0
for t in throw:
if H <= 0:
break
H += -t
cnt += 1
if H > 0:
cnt += (H+max_slash-1)//max_slash
print(cnt)
main()
| p03472 |
import math
N, H = 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)
amax = max(A)
# 最強の振り刀より強い攻撃力を持つものを抽出
B = list([x for x in B if x > amax])
B.sort(reverse=True)
ans = 0
while H > 0:
# まだ投げれる
if not B == []:
H -= B[0]
del B[0]
# もう投げれない
else:
ans += math.ceil(H/amax)
break
ans += 1
print(ans)
| import math
N, H = 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)
amax = max(A)
# 最強の振り刀より強い攻撃力を持つものを抽出
B = list([x for x in B if x > amax])
B.sort()
ans = 0
while H > 0:
# まだ投げれる
if B:
H -= B.pop()
# もう投げれない
else:
ans += math.ceil(H/amax)
break
ans += 1
print(ans)
| p03472 |
import sys
input=sys.stdin.readline
import math
def main():
N,H = list(map(int, input().split()))
X = []
k = 0 # 切る刀
for _ in range(N):
a,b = list(map(int, input().split()))
X.append((a,b))
k = max(k,a)
TK = [] # 強い投げ刀
for x in X:
if x[1] > k:
TK.append(x)
TK.sort(key=lambda x: x[1])
ans = 0
while H>0:
if TK:
H -= TK.pop()[1]
ans += 1
else:
ans += math.ceil(H/k)
break
print(ans)
if __name__ == '__main__':
main()
| import sys
input=sys.stdin.readline
import math
def main():
N,H = list(map(int, input().split()))
X = []
k = 0 # （最強の）振り刀（の攻撃力）
for _ in range(N):
a,b = list(map(int, input().split()))
X.append((a,b))
k = max(k,a)
TK = [x for x in X if x[1] > k] # 強い投げ刀のリスト
TK.sort(key=lambda x: x[1])
ans = 0
while H > 0:
if TK:
H -= TK.pop()[1]
ans += 1
else:
ans += math.ceil(H/k)
break
print(ans)
if __name__ == '__main__':
main()
| p03472 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right,bisect_left
from itertools import accumulate
def main():
N, H = 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()))
a.sort()
b.sort()
i = bisect_left(b,a[N-1])
c = list(accumulate(b[i:][::-1]))
# print(c)
M = len(c)
count = bisect_left(c,H)
if count < M:
print((count+1))
else:
print((count + (H-c[M-1] + a[N-1]-1)//a[N-1]))
if __name__ == "__main__":
main()
| from heapq import heappop, heappush
N, H = 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()))
a.sort()
b.sort()
q = []
for i in range(N):
if b[i] > a[-1]:
heappush(q, -b[i])
ans = 0
while q:
H += heappop(q)
ans += 1
if H <= 0:
print(ans)
exit()
print((ans + (H+a[-1]-1)//a[-1])) | p03472 |
#!/usr/bin/env python3
n, h, *A = list(map(int, open(0).read().split()))
a = max(A[::2])
b = sorted(A[1::2])[::-1]
for i in range(n):
if h <= 0:
print(i)
exit()
if b[i] < a:
print((i - (-h // a)))
exit()
h -= b[i]
print((n - (-h // a)))
| n, h, *A = list(map(int, open(0).read().split()))
a = max(A[::2])
b = sorted(A[1::2])[::-1]
for i in range(n):
if h <= 0:
n = i
h = 0
break
if b[i] < a:
n = i
break
h -= b[i]
print((n - (-h // a)))
| p03472 |
import math
N,H = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a,b = list(map(int, input().split()))
A.append(a)
B.append(b)
nage_count = 0
huri_count = 0
for i in range(N):
if B[i] > max(A):
nage_count += 1
H -= B[i]
if H <= 0:
break
# 今度は一番強いやつを振り続ける.
if H>0:
huri_count = math.ceil(H/max(A))
print((huri_count + nage_count)) | import math
N,H = list(map(int, input().split()))
A = []
B = []
for _ in range(N):
a,b = list(map(int, input().split()))
A.append(a)
B.append(b)
nage_count = 0
huri_count = 0
A_max = max(A)
for b in sorted(B, reverse = True):
if b > A_max:
nage_count += 1
H -= b
if H <= 0:
break
else:
break
# 今度は一番強いやつを振り続ける.
if H>0:
huri_count = math.ceil(H/A_max)
print((huri_count + nage_count)) | p03472 |
T=0
N,H=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)
A.sort(reverse=True)
B.sort(reverse=True)
for i in range(N):
if A[0]<=B[i]:
H-=B[i]
T+=1
if H<=0:
break
if H>0:
T+=int(H/A[0])
if H%A[0]>0:
T+=1
print(T)
| import math
N,H=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)
ans=0
B.sort(reverse=True)
Am=max(A)
for i in range(N):
if B[i]>=Am:
H-=B[i]
ans+=1
if H<=0:
break
if H>0:
ans+=math.ceil(H/Am)
print(ans)
| p03472 |
# -*- coding:utf-8 -*-
n, h = 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)
a.sort()
b.sort()
x = a[-1]
count = 0
while(h > 0):
if b[-1] > x:
h -= b.pop()
count += 1;
if not b:
b.append(-100)
else:
if a[-1] == 1:
count += h
break
else:
h -= a[-1]
count += 1;
print(count)
| # -*- coding:utf-8 -*-
n, h = 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)
a.sort()
b.sort()
x = a[-1]
count = 0
while(h > 0):
if b[-1] > x:
h -= b.pop()
count += 1;
if not b:
b.append(-100)
else:
#h -= a[-1]
#count += 1;
count += (h // a[-1])
h -= a[-1] * (h//a[-1])
break
if h > 0:
count += 1
print(count)
| p03472 |
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def S(): return sys.stdin.readline().rstrip()
N,H = list(map(int,S().split()))
ab = [LI() for i in range(N)]
A = [(ab[i][0],1) for i in range(N)]
B = [(ab[i][1],2) for i in range(N)]
from operator import itemgetter
C = sorted(A+B,key = itemgetter(0),reverse=True)
damage = 0 # 与ダメージ
ans = 0 # 攻撃回数
for i in range(2*N):
if C[i][1] == 1:
ans += (H-damage+C[i][0]-1)//C[i][0]
break
else:
ans += 1
damage += C[i][0]
if damage >= H:
break
print(ans) | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,H = MI()
X = []
for i in range(N):
a,b = MI()
X.append((a,0))
X.append((b,1))
X.sort(reverse=True)
i = 0
ans = 0
while H > 0:
x,y = X[i]
if y == 1:
H -= x
i += 1
ans += 1
else:
ans += (H+x-1)//x
break
print(ans)
| p03472 |
def main():
from collections import deque
from math import ceil
n, h, *ab = list(map(int, open(0).read().split()))
a = ab[::2]
*b, = [-x for x in ab[1::2]]
c = a + b
c.sort(key=lambda x: abs(x), reverse=True)
q = deque(c)
cnt = 0
while h > 0:
cnt += 1
x = q.popleft()
h -= abs(x)
if x > 0:
cnt += ceil(h / x)
break
print(cnt)
if __name__ == '__main__':
main()
| def main():
from math import ceil
from itertools import accumulate
from bisect import bisect_left
n, h, *ab = list(map(int, open(0).read().split()))
x = max(ab[::2])
*y, = [i for i in ab[1::2] if i >= x]
y.sort(reverse=True)
*z, = accumulate(y)
if z[-1] <= h:
print((len(y) + ceil((h - z[-1]) / x)))
else:
print((bisect_left(z, h) + 1))
if __name__ == '__main__':
main()
| p03472 |
def main():
from math import ceil
from itertools import accumulate
from bisect import bisect_left
n, h, *ab = list(map(int, open(0).read().split()))
x = max(ab[::2])
*y, = [i for i in ab[1::2] if i >= x]
y.sort(reverse=True)
*z, = accumulate(y)
if z[-1] <= h:
print((len(y) + ceil((h - z[-1]) / x)))
else:
print((bisect_left(z, h) + 1))
if __name__ == '__main__':
main()
| def main():
from math import ceil
from itertools import accumulate
from bisect import bisect_left
n, h, *ab = list(map(int, open(0).read().split()))
x = max(ab[::2])
*y, = [i for i in ab[1::2] if i >= x]
y = sorted(y, reverse=True)
*z, = accumulate(y)
if z[-1] <= h:
print((len(y) + ceil((h - z[-1]) / x)))
else:
print((bisect_left(z, h) + 1))
if __name__ == '__main__':
main()
| p03472 |
import math
N, H = list(map(int, input().split()))
sword =[list(map(int, input().split())) for _ in range(N)]
def f1(l):
a, b = l
return a
def f2(l):
a, b = l
return b
sword.sort(key = f2)
sword.sort(key = f1)
amax, b1 = sword[-1]
sword.sort(key = f2)
dam = 0
ans = 0
while sword:
a, b = sword.pop()
if b < amax:
break
else:
dam += b
ans += 1
if dam >= H:
break
if dam < H:
dam -= b1
ans -= 1
ans += max(math.ceil((H-dam-b1)/amax), 0) + 1
print(ans) | import math
N, H = list(map(int, input().split()))
As = []
Bs = []
for i in range(N):
a, b = list(map(int, input().split()))
As.append(a)
Bs.append(b)
As.sort()
Bs.sort()
amax = As[-1]
ans = 0
dam = 0
while Bs:
b = Bs.pop()
if b < amax or dam >= H:
break
else:
ans += 1
dam += b
if dam < H:
ans += math.ceil((H-dam)/amax)
print(ans) | p03472 |
from heapq import heappop, heappush
n, h = list(map(int, input().split()))
T = []
for i in range(n):
a, b = list(map(int, input().split()))
T.append((a, -b))
max_a, min_b_of_max_a = max(T)
min_b_of_max_a = - min_b_of_max_a
T.remove((max_a, -min_b_of_max_a))
H = []
for i in range(n-1):
a, minus_b = T[i]
heappush(H, (minus_b, a))
cnt = 0
while h > 0:
if min_b_of_max_a >= h:
h -= min_b_of_max_a
cnt += 1
break
if H:
b, a = heappop(H)
b = -b
else:
break
if b <= max_a:
break
else:
h -= b
cnt += 1
if h > 0:
h -= min_b_of_max_a
cnt += 1
if h > 0:
cnt += (h + max_a-1)//max_a
print(cnt)
| from heapq import heappop, heappush
n, h = list(map(int, input().split()))
T = []
for i in range(n):
a, b = list(map(int, input().split()))
T.append((a, -b))
max_a, minus_min_b_of_max_a = max(T)
min_b_of_max_a = -minus_min_b_of_max_a
T.remove((max_a, minus_min_b_of_max_a))
H = []
for i in range(n-1):
a, minus_b = T[i]
heappush(H, (minus_b, a))
cnt = 0
while h > 0 and H:
if min_b_of_max_a >= h:
h -= min_b_of_max_a
cnt += 1
break
minus_b, a = heappop(H)
b = -minus_b
if b <= max_a:
break
else:
h -= b
cnt += 1
if h > 0:
h -= min_b_of_max_a
cnt += 1
if h > 0:
cnt += (h + max_a-1)//max_a
print(cnt)
| p03472 |
n, h = 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()))
A.sort(reverse=True)
B.sort(reverse=True)
c = 0
for j in range(n):
if B[j] >= A[0]:
c += 1
h -= B[j]
if h <= 0:
print(c)
exit()
else:
break
if h%A[0] == 0:
c += h//A[0]
else:
c += h//A[0]+1
print(c)
| n, h = list(map(int, input().split()))
#AB = []
A = []
B = []
for i in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
#AB.append((a, b))
x = max(A)
B.sort(reverse=True)
ans = 0
for i, b in enumerate(B):
if b > x:
h -= b
ans += 1
else:
break
if h <= 0:
print(ans)
exit()
ans += (h+x-1)//x
print(ans)
| p03472 |
N,H = list(map(int,input().split()))
Ma = 1
B = []
for i in range(N):
a,b = list(map(int,input().split()))
B.append(b)
if a > Ma:
Ma = a
B.sort()
B.reverse()
C = 0
while H > 0:
if B == []:
C += int(-(-H//Ma))
H = 0
else:
if Ma >= B[0]:
C += int(-(-H//Ma))
H = 0
else:
C += 1
H -= B[0]
B = B[1:]
print(C) | N,H = list(map(int,input().split()))
Ma = 1
B = []
for i in range(N):
a,b = list(map(int,input().split()))
B.append(b)
if a > Ma:
Ma = a
B.sort()
B.reverse()
i = 0
Mb = B[0]
while Mb > Ma and H > 0:
i += 1
H -= Mb
if i == N:
Mb = 0
else:
Mb = B[i]
if H <= 0:
print(i)
else:
print((i+int(-(-H//Ma)))) | p03472 |
import math
Num,HP = (list(map(int,input().split())))
Katanas = [list(map(int,input().split())) for x in range(Num)]
amax = max([x[0] for x in Katanas])
bpower = sorted([x[1] for x in Katanas if x[1] > amax],reverse=True)
attake=0
if len(bpower):
while HP > 0:
attake += 1
HP -= bpower[0]
if len(bpower) == 1:
break
bpower = bpower[1:]
attake += math.ceil(HP/amax) if HP > 0 else 0
print(attake) | import math
Num,HP = (list(map(int,input().split())))
#Katanas = [list(map(int,input().split())) for _ in range(Num)]
CKatanaMax = 0
katanas = []
for _ in range(Num):
a,b = list(map(int,input().split()))
CKatanaMax = max(CKatanaMax,a)
katanas.append(b)
Tkatanas = sorted([x for x in katanas if x > CKatanaMax],reverse=True)
attake = 0
for Tkatana in Tkatanas:
HP -= Tkatana
attake += 1
if HP <= 0:
break
else:
attake += math.ceil(HP/CKatanaMax)
print(attake) | p03472 |
n, h = list(map(int, input().split()))
a, b = [], []
for _ in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai), b.append(bi)
a.sort(), b.sort()
ans, amax = 0, a[-1]
for bi in b[::-1]:
if bi <= amax or h<=0:
break
h -= bi
ans += 1
print((ans + ((h + amax - 1) // amax) * (h > 0)))
| n, h = list(map(int, input().split()))
a, b = [], []
for _ in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai), b.append(bi)
a.sort(), b.sort()
ans, amax = 0, a[-1]
for bi in b[::-1]:
if bi <= amax or h <= 0:
break
h -= bi
ans += 1
print((ans + (h + amax - 1) // amax if h > 0 else ans))
| p03472 |
n, h = list(map(int, input().split()))
a, b = [], []
for _ in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai), b.append(bi)
a.sort(), b.sort()
ans, amax = 0, a[-1]
for bi in b[::-1]:
if bi <= amax or h <= 0:
break
h -= bi
ans += 1
print((ans + (h + amax - 1) // amax if h > 0 else ans))
| n, h = list(map(int, input().split()))
a, b = [], []
for _ in range(n):
ai, bi = list(map(int, input().split()))
a.append(ai), b.append(bi)
a.sort(), b.sort()
ans, amax = 0, a[-1]
for bi in b[::-1]:
if bi <= amax or h <= 0:
break
h -= bi
ans += 1
mod = (h + amax - 1) // amax
print((ans + mod if h > 0 else ans))
| p03472 |
import heapq as hq
s=[]
hq.heapify(s) #sをpriority-q化 O(n log(n))
# a=hq.heappop(s) #最小値を取り出す O(log(n))
# hq.heappush(s,123) #123をs(priority-q)に追加 O(log(n))
n,h=list(map(int,input().split()))
for i in range(n):
a,b=list(map(int,input().split()))
hq.heappush(s,(-a,False))
hq.heappush(s,(-b,True))
ans=1
x,y=hq.heappop(s)
h+=x
while y and h>0:
x,y=hq.heappop(s)
h+=x
ans+=1
if h>0:
ans+=(h-x-1)//-x
print(ans) | n,h=list(map(int,input().split()))
x=[0]*n
y=0
for i in range(n):
a,b=list(map(int,input().split()))
y=max(y,a)
x[i]=b
cnt=0
x.sort(reverse=1)
for i in x:
if i>y:
cnt+=1
h-=i
if h<=0:
print(cnt)
exit()
print((cnt+(h+y-1)//y)) | p03472 |
n, h = list(map(int, input().split()))
A, B = [], []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
B = sorted(B, reverse=True)
bigger = [x for x in B if x >= max(A)]
throw_b = len(bigger)
throw = 0
check = 0
while check == 0:
if throw >= throw_b:
break
h = h - B[throw]
throw += 1
if h <= 0:
break
if h <= 0:
ans = throw
else:
ans = throw + -(-h//max(A))
print(ans) | n, h = list(map(int, input().split()))
A, B = [], []
for _ in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
B = sorted(B, reverse=True)
a_max = max(A)
bigger = [x for x in B if x >= a_max]
throw_b = len(bigger)
throw = 0
check = 0
while check == 0:
if throw >= throw_b:
break
h = h - B[throw]
throw += 1
if h <= 0:
break
if h <= 0:
ans = throw
else:
ans = throw + -(-h//max(A))
print(ans) | p03472 |
n,h=list(map(int,input().split()))
a=[]
for i in range(n):
b,c=list(map(int,input().split()))
a+=[[b,0],[c,1]]
a.sort(reverse=1)
i=0
ans=0
while h>0:
if a[i][1]==1:
h-=a[i][0]
ans+=1
else:
ans+=0--h//a[i][0]
h=0
i+=1
print(ans) | n,h=list(map(int,input().split()))
x=[]
for i in range(n):
a,b=list(map(int,input().split()))
x.append([a,0])
x.append([b,1])
x.sort(reverse=1)
i=ans=0
while h>0:
if x[i][1]:
h-=x[i][0]
ans+=1
else:
ans+=0--h//x[i][0]
h=0
i+=1
print(ans) | p03472 |
import heapq as hq
from math import ceil
N, H = list(map(int, input().split()))
ab = [tuple(map(int,input().split())) for _ in range(N)]
ab.sort(key=lambda x:x[1], reverse=True)
ab.sort(key=lambda x:x[0], reverse=True)
ma, mb = ab[0]
ab = ab[1:]
q = []
for _,b in ab:
if b > ma:
hq.heappush(q, b)
ans = float("inf")
for l in range(len(q)+1):
h = H
cnt = l
h -= sum(q[:l])
if h <= 0:
ans = min(ans, cnt)
continue
h -= mb
cnt += 1
if h <= 0:
ans = min(ans, cnt)
continue
cnt += ceil(h/ma)
ans = min(ans, cnt)
print(ans) | import heapq as hq
from itertools import accumulate
from math import ceil
N, H = list(map(int, input().split()))
ab = [tuple(map(int,input().split())) for _ in range(N)]
ab.sort(key=lambda x:x[1], reverse=True)
ab.sort(key=lambda x:x[0], reverse=True)
ma, mb = ab[0]
q = [ab[i][1] for i in range(1, N)]
q.sort(reverse=True)
ans = float("inf")
acc = [0]+list(accumulate(q, lambda x,y:x+y))
for l in range(len(q)+1):
h = H
cnt = l
h -= acc[l]
if h <= 0:
ans = min(ans, cnt)
continue
h -= mb
cnt += 1
if h <= 0:
ans = min(ans, cnt)
continue
cnt += ceil(h/ma)
ans = min(ans, cnt)
print(ans) | p03472 |
from collections import deque
N,H=list(map(int,input().split()))
a=deque([]);b=deque([])
for _ in range(N):
ai,bi=list(map(int,input().split()))
a.append(ai)
b.append(bi)
bb=deque([])
ma=max(a)
bc=0
for _ in range(N):
bi=max(b)
b.remove(bi)
if bi>ma:
bb.append(bi)
bc+=bi
if bc>=H:
print((len(bb)))
exit()
ans=(H-sum(bb))//ma+len(bb)
if (H-sum(bb))%ma==0:
print(ans)
else:
print((ans+1)) | N,H=list(map(int,input().split()))
S=[[int(x) for x in input().split()] for _ in range(N)]
A,B=list(zip(*S))
A=max(A)
B=[b for b in B if b>A]
B.sort(reverse=True)
ans=0
cnt=0
for b in B:
if H<=0:
break
cnt+=1
H-=b
if H>0:
cnt+=(H-1)//A+1
print(cnt) | p03472 |
import sys
N,H = list(map(int,input().split()))
A = 0
B = []
for _ in range(N):
a,b = list(map(int,input().split()))
A = max(A,a)
B.append(b)
B.sort(reverse=True)
ans = 0
for b in B:
if b > A:
H -= b
ans += 1
else:
break
if H <= 0:
print(ans)
sys.exit()
print(((H-1)//A +1 +ans))
| # python3 (3.4.3)
import sys
input = sys.stdin.readline
# main
N,H = list(map(int,input().split()))
A,B = 0,[]
for i in range(N):
a,b = list(map(int,input().split()))
A = max(A,a)
B.append(b)
ans = 0
B.sort(reverse=True)
for b in B:
if b > A:
ans += 1
H -= b
if H <= 0:
print(ans)
sys.exit()
print((ans + (H-1)//A + 1)) | p03472 |
N,H=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()))
#print(a)
#print(b)
b.sort(reverse=True)
#print(max(a))
#print(b)
ans=0
for i in range(N):
if b[i]<max(a):
break
if H<=0:
break
H-=b[i]
ans+=1
if H>0:
ans+=-(-H//max(a))
print(ans) | N,H=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()))
#print(a)
#print(b)
b.sort(reverse=True)
maxa=max(a)
#print(max(a))
#print(b)
ans=0
for i in range(N):
if b[i]<maxa:
break
if H<=0:
break
H-=b[i]
ans+=1
if H>0:
ans+=-(-H//maxa)
print(ans) | p03472 |
# -- coding: utf-8 --
import math
N, H = list(map(int, input().split()))
sl = []
th = []
for i in range(N):
s, t = list(map(int, input().split()))
sl.append(s)
th.append(t)
turn = 0
thm = list([x for x in th if x>max(sl)])
thdec = sorted(th, reverse=True)
if sum(thdec) >= H:
for i in range(len(thdec)):
if sum(thdec[:i+1]) >= H:
turn = i + 1
break
else:
turn = math.ceil((H - sum(thm)) / max(sl)) + len(thm)
print(turn) | # -- coding: utf-8 --
import math
N, H = list(map(int, input().split()))
th = []
sl_max = 0
for i in range(N):
s, t = list(map(int, input().split()))
sl_max = max(sl_max, s)
th.append(t)
turn = 0
thdec = sorted(th, reverse=True)
for i in range(len(thdec)):
if thdec[i] >= sl_max:
H -= thdec[i]
turn += 1
if H <= 0:
break
else:
break
if H > 0:
turn += math.ceil(H / sl_max)
print(turn) | p03472 |
from bisect import bisect_left
from itertools import accumulate, takewhile
from math import ceil
def solve(h, aa, bb):
max_a = max(aa)
bba = list(accumulate(takewhile(lambda x: x > max_a, sorted(bb, reverse=True))))
if not bba:
return ceil(h / max_a)
remain = h - bba[-1]
if remain <= 0:
return bisect_left(bba, h) + 1
return ceil(remain / max_a) + len(bba)
n, h = list(map(int, input().split()))
aa, bb = list(zip(*(list(map(int, input().split())) for _ in range(n))))
print((solve(h, aa, bb)))
| from bisect import bisect_left, bisect
from itertools import accumulate
from math import ceil
def solve(h, aa, bb):
max_a = max(aa)
bs = sorted(bb)
i = bisect(bs, max_a)
if i == n:
return ceil(h / max_a)
bba = list(accumulate(reversed(bs[i:])))
remain = h - bba[-1]
if remain <= 0:
return bisect_left(bba, h) + 1
return ceil(remain / max_a) + len(bba)
n, h = list(map(int, input().split()))
aa, bb = list(zip(*(list(map(int, input().split())) for _ in range(n))))
print((solve(h, aa, bb)))
| p03472 |
from operator import itemgetter
import math
n, h = list(map(int, input().split()))
ab = []
A = 0
B = 1
maxA = 0
for i in range(n):
ab.append(list(map(int, input().split())))
maxA = max(maxA, ab[i][A])
ab.sort(key=itemgetter(B), reverse=True)
sumB = 0
for _ab in ab:
sumB += _ab[B]
ans = 0
damage = 0
i = 0
while damage < h and ans < n:
damage += max(maxA, ab[ans][B])
ans += 1
ab.sort(key=itemgetter(A), reverse=True)
if damage < h:
ans += math.ceil((h - damage)/ab[0][A])
print(ans) | from operator import itemgetter
import math
n, h = list(map(int, input().split()))
ab = []
A = 0
B = 1
maxA = 0
for i in range(n):
ab.append(list(map(int, input().split())))
maxA = max(maxA, ab[i][A])
ab.sort(key=itemgetter(B), reverse=True)
sumB = 0
for _ab in ab:
sumB += _ab[B]
ans = 0
damage = 0
i = 0
while damage < h and ans < n:
damage += max(maxA, ab[ans][B])
ans += 1
if damage < h:
ans += math.ceil((h - damage)/maxA)
print(ans) | p03472 |
n,h,*d=list(map(int,open(0).read().split()));a=max(d[::2]);b=sorted(d[1::2]);c=0
while b and(h>0)*(b[-1]>a):h-=b.pop();c+=1
while b and b[-1]>a>0<h:h-=b.pop();c+=1
print((c-(-h//a)*(h>0))) | n,h,*d=list(map(int,open(0).read().split()));a=max(d[::2]);b=sorted(d[1::2]);c=0
while b and b[-1]>a>0<h:h-=b.pop();c+=1
print((c-(-h//a)*(h>0))) | p03472 |
n,h = list(map(int,input().split()))
ab = []
for _ in range(n):
a, b = (int(x) for x in input().split())
ab.append([a, b])
ab = sorted(ab, key=lambda x: -x[0])
x,y = ab.pop(0)
ab.append([x,y])
ab = sorted(ab, key=lambda x: -x[1])
count = 0
for i ,j in ab:
if x <= j:
h -= j
count += 1
if h <= 0:
print(count)
exit()
else:
break
if h%x==0:
print((count+h//x))
else:
print((count+1+h//x)) | N,H = list(map(int,input().split()))
B = []
max_attack = 0
for i in range(N):
a,b = list(map(int,input().split()))
max_attack = max(a,max_attack)
B.append(b)
B.sort(reverse=True)
ans = 0
for b in B:
if max_attack <= b:
H -= b
ans += 1
if H <= 0:
break
else:
break
if 0 < H:
if H%max_attack == 0:
ans += H//max_attack
else:
ans += 1+H//max_attack
print(ans)
| p03472 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# A = [ int(input()) for _ in range(N) ]
##############################
"""
基本
・max(A)以上の(B)を全部投げちゃう
・max(A)をひたすら振って、残りHP <= B の時点で投げて終わり
ただし、どれを残すべきかは確定しないので全探索
"""
N, H = list(map(int, input().split()))
A = []
B = []
max_a = 0
max_a_b = 0
max_a_i = 0
for i in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
# if max_a < a:
# max_a = a
# max_a_b = b
# max_a_i = i
def get_count(N, H, max_a, max_a_b, max_a_i):
count = 0
for i in range(N):
# 残すやつは何もしない
if i == max_a_i:
continue
# 投げる
if B[i] >= max_a:
H -= B[i]
count += 1
# 近いところまでまとめて引く
x = ((H-max_a_b) // max_a) - 1
H -= (max_a * x)
count += x
while H > 0:
if H <= max_a_b:
# 投げて終わり
count += 1
break
H -= max_a
count += 1
return count
ans = INF
for i in range(N):
count = get_count(N, H, A[i], B[i], i)
if count < ans:
ans = count
print(ans)
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# A = [ int(input()) for _ in range(N) ]
##############################
N, H = 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)
max_a = max(A)
t = B[:]
t.sort(reverse=True)
count = 0
for i in range(N):
# 先に投げても後で投げても同じなので、最初に全部投げちゃう
# ただし強いものから投げないと、投げ終わる前に倒すケースで引っかかる
if t[i] >= max_a:
H -= t[i]
count += 1
if H <= 0:
print(count)
exit()
# 近いところまでまとめて引く
x = (H // max_a) - 1
H -= (max_a * x)
count += x
while H > 0:
H -= max_a
count += 1
print(count) | p03472 |
N,H = 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)
A.sort(reverse=True)
B.sort(reverse=True)
ans = 0
tmp = 0
cnt = 0
while(1):
if tmp>=H:
print(ans)
exit()
if cnt==len(B):
break
if A[0]>=B[cnt]:
break
tmp += B[cnt]
ans += 1
cnt += 1
res = H - tmp
if res%A[0]==0:
ans += res//A[0]
else:
ans += res//A[0]
ans += 1
print(ans) | N,H = 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)
A.sort(reverse=True)
B.sort(reverse=True)
ans = 0
cnt = 0
while(1):
if H<=0:
print(ans)
exit()
if cnt==len(B):
break
if A[0]>=B[cnt]:
break
H-=B[cnt]
cnt+=1
ans+=1
if H%A[0]==0:
res = H//A[0]
else:
res = H//A[0]
res += 1
print((ans+res)) | p03472 |
import math
N, H = list(map(int, input().split()))
katana = {i: list(map(int, input().split())) for i in range(N)}
# 振り攻撃最大
max_i, (max_a, max_b) = max(list(katana.items()), key=lambda x: x[1][0])
ans = 0
for i, (_, b) in sorted(list(katana.items()), key=lambda x: x[1][1], reverse=True):
if i == max_i:
continue
if H <= max_b or H <= max_a:
break
if b < max_a:
break
H -= b
ans += 1
if max_a < max_b and H > 0:
H -= max_b
ans += 1
if H > 0:
ans += math.ceil(H / max_a)
print(ans)
| import sys
input = sys.stdin.readline
N, H = 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()))
max_a = max(a)
b = [x for x in sorted(b, reverse=True) if x > max_a]
cnt = 0
for bi in b:
H -= bi
cnt += 1
if H <= 0:
break
if H > 0:
cnt += H // max_a
if H % max_a != 0:
cnt += 1
print(cnt)
| p03472 |
# ai<=biなので基本的にbiが強い。最強のaiより弱いbiは使う必要がない
# 順番は関係ないので選びぬかれたbiを強いほうか使っていって、倒せなかったら最強のaiをHがなくなるまで使う
# これだとPypyでギリギリ間に合わん...
n, h = list(map(int, input().split()))
a, b = 0, []
for _ in range(n):
ai, bi = list(map(int, input().split()))
a = max(a, ai)
b.append(bi)
b = list(sorted(b))
l, r = 0, n
while r-l > 0:
mid = (l + r) // 2
if b[mid] >= a:
r = mid
else:
l = mid + 1
b = b[r:][::-1]
count = 0
for bi in b:
h -= bi
count += 1
if h <= 0:
break
if h > 0:
count += h // a if h % a == 0 else h // a + 1
print(count)
| # Bを一回使えると考えると
# - Ai>BiであるBiを使う意味はない(Aiで殴ればいいので)
# - Ai>AjであるAjを使う意味はない（Aiで殴ればいいので）
# つまりA中最強のAiより上（i=j自身を含む）のBjを1度使い、あとはAiで殴る
n, h = list(map(int, input().split()))
power = [list(map(int, input().split())) for _ in range(n)]
maxa = sorted(power, key=lambda x : x[0], reverse=True)[0][0]
muscleb = sorted(list([x for x in power if x[1] >= maxa]), key = lambda x : x[1], reverse=True)
ans = 0
for m in muscleb:
ans += 1
h -= m[1]
if h <= 0:
print(ans)
exit()
additionala = h // maxa
if h % maxa != 0:
additionala += 1
print((additionala + ans)) | p03472 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.