Problem:


Score : 200 points

Problem Statement

Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second.
The other child is now at coordinate B, and she can travel the distance of W per second.

He can catch her when his coordinate is the same as hers.
Determine whether he can catch her within T seconds (including exactly T seconds later).
We assume that both children move optimally.

Constraints

-10^9 \leq A,B \leq 10^9

1 \leq V,W \leq 10^9

1 \leq  T \leq 10^9

A \neq B

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A V
B W
T

Output

If "it" can catch the other child, print YES; otherwise, print NO.

Sample Input 1

1 2
3 1
3

Sample Output 1

YES

Sample Input 2

1 2
3 2
3

Sample Output 2

NO

Sample Input 3

1 2
3 3
3

Sample Output 3

NO



Sample input:
1 2
3 1
3


Sample output:
YES

Submission status: Accepted

Solution code:
A ,V = map(int ,input().split())
B ,W = map(int ,input().split())
T = int(input())
if A != B and V <= W:
    print("NO")
elif max(A - B,B - A) / (V - W) <= T:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, V = list(map(int,input().split()))
B, W = list(map(int,input().split()))
T = int(input())
if V <= W:
  print('NO')
elif abs(A-B) > abs(V-W) * T:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, v = mi()
    b, w = mi()
    t = ii()

    if v <= w:
        print('NO')
    else:
        dist = abs(a - b)
        print('YES') if dist <= t * (v - w) else print('NO')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print('NO')
else:
    if abs(a - b) /(v - w) <= t:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if V<=W or (abs(A-B)/(V-W))>T:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
a, v = [int(k) for k in input().split()]
b, w = [int(k) for k in input().split()]
t = int(input())
d = abs(a - b)
if d <= v * t - w * t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if(V-W > 0):
    if(abs(A-B)/(V-W) <= T):
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

Solution code:
A,V = list(map(int, input().split()))
B,W = list(map(int, input().split()))
T = int(input())

if V-W > 0 and T*(V-W) >= abs(A-B):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,V = list(map(int, input().split()))
B,W = list(map(int, input().split()))
T = int(input())
print("YES" if (V-W) * T >= abs(B-A) else "NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
ans = abs(b - a) - (v - w) * t
if ans > 0:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

d = abs(a-b)
if v <= w:
    print('NO')
else:
    if (v-w)*t < d:
        print('NO')
    else:
        print('YES')

Submission status: Accepted

Solution code:
#coding: utf-8
a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())

dist = abs(a-b)
dist += (t*w)

if dist <= v*t:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if t * (v - w) >= abs(a - b):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if t * (v - w) >= abs(a - b):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


A,V=nm()
B,W=nm()
T=int(input())

d=abs(A-B)
move_s=(V-W)
if(move_s<=0):
    print("NO")
    sys.exit(0)
if(((d//move_s))<=(T-1) or ((d//move_s)==T and (d%move_s==0)) ):
    print("YES")
    sys.exit(0)
print("NO")

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V <= W:
    ans = "NO"
else:
    if abs(A - B) / (V - W) <= T:
        ans = "YES"
    else:
        ans = "NO"
print(ans)

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
print('YES' if t*(v-w) >= abs(a-b) else 'NO')

Submission status: Accepted

Solution code:
a,u=map(int,input().split())
b,v=map(int,input().split())
t=int(input())
if(a==b):
  print('YES')
else:
  dif=abs(b-a)
  d=v*t
  dif+=d
  d1=u*t
  if(d1>=dif):
    print('YES')
  else:
    print('NO')

Submission status: Accepted

Solution code:
def main():
  A,V = map(int, input().split())
  B,W = map(int, input().split())
  T = int(input())


  if A<=B:
      after_A=A+V*T
      after_B=B+W*T
      if after_B<=after_A:
          print("YES")
      else:
          print("NO")
  else:
      after_A=A-V*T
      after_B=B-W*T
      if after_A<=after_B:
          print("YES")
      else:
          print("NO")

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
    print('YES' if b+w*t <= a+v*t else 'NO')
else:
    print('YES' if b-w*t >= a-v*t else 'NO')

Submission status: Accepted

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if W>=V:
  print("NO")
else:
  if abs(A-B)<=(V-W)*T:
    print("YES")
  else:
    print("NO")

Submission status: Accepted

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if W>=V:
  print("NO")
else:
  if abs(A-B)/(V-W)<=T:
    print("YES")
  else:
    print("NO")

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v-w <= 0:
    print('NO')
    exit()
ans=abs(a-b)/(v-w)
if ans <= t:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if not V > W:
  print("NO")
elif (V-W)*T >= abs(B-A):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
A, V = map(int, input().split())                                               
B, W = map(int, input().split())                                               
T = int(input())

if A < B:
    A_res = A + V * T
    B_res = B + W * T

    if A_res >= B_res:
        print("YES")
    else:
        print("NO")

else:
    A_res = A - V * T
    B_res = B - W * T

    if A_res <= B_res:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

else:
# T秒後までに同じ座標にいればAが勝つ
    k = (B-A)/(V-W)
    if A>B:
        k = -k
    
    if k <= T and 0 < k:
        win = 'A'
    else:
        win = 'B'


if win == 'A':
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
t=int(input())
if abs(a-c)<=(b-d)*t:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline

a, b = map(int, input().split())
c, d = map(int, input().split())
t = int(input())
if b==d :
    print('NO')
elif (abs(a-c)/(b-d))<= t and d<b :
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,V = map(int,input().split(" "))
B,W = map(int,input().split(" "))
T, = map(int,input().split(" "))
kyori = abs(A-B)
dif = V-W
if dif>0:
  if kyori/dif<=T:
    print("YES")
  else:
    print("NO")
else:
  print("NO")

Submission status: Accepted

Solution code:
A,V= map(int,input().split())
B,W= map(int,input().split())
T = int(input())

d = abs(B-A)
e = V-W

if e*T>=d:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())
ri = lambda: int(sys.stdin.readline())
a, v = rm()
b, w = rm()
t = ri()
if v - w == 0:
  print('NO')
  exit()
if 0 <= abs(a-b) / (v-w) <= t:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a == b:
  print('YES')
elif a < b:
  if b + w * t <= a + v * t:
    print('YES')
  else:
    print('NO')
else:
  if a - v * t <= b - w * t:
    print('YES')
  else:
	  print('NO')

Submission status: Accepted

Solution code:
#n=int(input())
a, v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
ans="NO"
if a<b:
    a+=v*t;b+=w*t
    if a>=b:
        ans="YES"
else:
    a-=v*t;b-=w*t
    if a<=b:
        ans="YES"

print(ans)

Submission status: Accepted

Solution code:
buf = list(map(int, input().split()))
A=buf[0]
V=buf[1]
buf2 = list(map(int, input().split()))
B=buf2[0]
W=buf2[1]
T= int(input())

if A>B:
  if B-W*T<A-V*T:
    print("NO")
  else:
    print("YES")
else:
  if B+W*T>A+V*T:
    print("NO")
  else:
    print("YES")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v == w:
    print('NO')
else:
    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')

Submission status: Accepted

Solution code:
from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))


def solve():
    a, v = rl()
    b, w = rl()
    t = ri()
    d = abs(a - b)
    s = v - w
    if t * s >= d:
        print ("YES")
    else:
        print ("NO")





mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()

Submission status: Accepted

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
print("YES" if A+T*V>= B+T*W and A-T*V <= B-T*W else "NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

d = abs(a - b)
u = abs(v - w)

if w >= v:
    print("NO")
else:
    if u * t >= d:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if abs(b-a) <= (v-w)*t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (v-w)*t >= abs(b-a):
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
import sys

A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V <= W:
    print('NO')
    sys.exit()

d = abs(A-B)
v = V - W
if d/v <= T:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v*t >= abs(b-a) + w*t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
if V<=W:
    print("NO")
else:
    difAB = abs(A-B)
    difVW = V-W
    if difAB<=difVW*T:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
dif = abs(B-A)
speed = V-W
if speed <= 0:
    print('NO')
else:
    if speed*T >= dif:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())



def 関数(a, v, b, w, t):
    
    d = abs(a - b)
    if v <= w:
        return "NO"
    s = v-w
    if d <= s*t:
        return "YES"
    else:
        return "NO" 

def çözmek():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    res = []
    res.append(関数(A, V, B, W, T))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A == B:
  print('YES')
elif V <= W:
  print('NO')
elif (V-W) * T >= abs(A-B):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())

if a == b:
    print("YES")
    exit()

if v <= w:
    print("NO")
    exit()

#print(b-a, w-v, t*(w-v))
if a < b:
    if (b - a) <= t * (v - w): #(b - a) // (w - v) <= t
        print("YES")
    else:
        print("NO")
elif a > b:
    if (a - b) <= t * (v - w): #(a - b) // (v - w) <= t
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
l=abs(a-b)
if l==0:
    print('YES')
else:
    if w>=v:
        print('NO')
    else:
        if l<=t*(v-w):
            print('YES')
        else:
            print('NO')

Submission status: Accepted

Solution code:
A_V = input().split(" ")
B_W = input().split(" ")
T = int(input())
A = int(A_V[0])
V = int(A_V[1])
B = int(B_W[0])
W = int(B_W[1])
dA = A + V * T
dB = B + W * T
ndA = A - V * T
ndB = B - W * T
if (A<B):
    if (dA < dB):
        print("NO")
    else:
        print("YES")
else:
    if (ndA > ndB):
        print("NO")
    else:
        print("YES")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
    print('YES' if v*t+a >= w*t+b else 'NO')
else:
    print('YES' if -v*t+a <= -w*t+b else 'NO')

Submission status: Accepted

Solution code:
a , v = map(int,input().split())
b , w = map(int,input().split())
t = int(input())
if abs(a-b) <= (v-w)*t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v <= w:
  print("NO")
  exit()
d = abs(a-b)
if (v-w)*t >= d:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
d=abs(a-b)
u = v-w
if d-u*t<=0:
    print("YES")

else:
    print('NO')

Submission status: Accepted

Solution code:
a,v = map(int, input().split())
b,w = map(int, input().split())
T = int(input())
if abs(b-a) <= (v-w)*T:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A, V = list(map(int, input().strip().split()))
B, W = list(map(int, input().strip().split()))
T = int(input().strip())
ans = None

speed = V-W
if speed<=0:
  ans = 'NO'
else:
  distance = abs(A-B)
  if distance <= speed*T:
    ans = 'YES'
  else:
    ans = 'NO'

print(ans)

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

d = abs(a-b)
u = v-w

if d-u*t<=0:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
#a,b間の距離
d=abs(b-a)
#速度差
V=v-w
if V<=0:
    print("NO")
    exit()
T=d/V
if T<=t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if t * (v - w) >= abs(b - a):
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
import numpy as np

A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V <= W:
    print("NO")
elif np.abs(A - B) / (V - W) <= T: print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
def main():
    a, v = map(int, input().split())
    b, w =map(int, input().split())
    t = int(input())

    distance = abs(b-a)
    speed = v-w
    if distance > speed*t:
        print('NO')
    else:
        print('YES')

main()

Submission status: Accepted

Solution code:
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(input())

if abs(a - b) <= (v - w) * t:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a,v = map(int,input().split())
b,m = map(int,input().split())
n = int(input())

dis = abs(a-b)
a_move = n*v
b_move = n*m

if dis+b_move - a_move <= 0:
    print('YES')

else:
    print('NO')

Submission status: Accepted

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
T = int(input())
if abs((b-a))<=(v-w)*T:
	print("YES")
else:
	print("NO")

Submission status: Accepted

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
s = 'YES'
if abs((B-A))<=(V-W)*T:
	print('YES')
else:
	print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

dist = abs(a - b)
kasoku = v - w

if dist > kasoku * t:
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

dist = abs(b - a)
r_vel = v - w 

if r_vel * t >= dist:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
p1 , s1=map(int , input().split()) 
p2 , s2=map(int , input().split())
t=int(input()) 
if abs(p1-p2) > t*(s1-s2):
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())

t = int(input())

if a == b:
    print('YES')
    exit()

if w >= v:
    print('NO')
    exit()

d = abs(a - b)

vel = v - w

if (d + vel - 1) // vel > t:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
 
if A < B:
	if A + (V*T) >= B + (W*T):
		print("YES")
	else:
		print("NO")
else:
	if A - (V*T) <= B - (W*T):
		print("YES")
	else:
		print("NO")

Submission status: Accepted

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())

T = int(input())

dist = abs(A-B)
diff = V-W
if dist > diff * T:
	print("NO")
else:
	print("YES")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
dist = abs(a-b)
velo = v-w
if dist > velo*t:
  print("NO")
else:
  print("YES")

Submission status: Accepted

Solution code:
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

if abs(a-b)+w*t <= v*t: print('YES')
else: print('NO')

Submission status: Accepted

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

if abs(a-b) <= t * (v-w):
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
import math

a, v = map(int, input().split(" "))
b, w = map(int, input().split(" "))
t = int(input())

if w >= v:
    print("NO")
    exit()

fast = abs(v - w)
dist = abs(b - a)

if fast * t >= dist:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

diff = (V - W)*T;
if abs(A-B) <= diff:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:

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(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")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print("NO")
else:
    if (v-w)*t >= abs(a-b):
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline

def main():
    A, V = map(int, readline().rstrip().split())
    B, W = map(int, readline().rstrip().split())
    T = int(readline())

    v = V - W
    if v <= 0:
        print('NO')
        return
    
    if abs(A - B) / v > T:
        print('NO')
    else:
        print('YES')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if a<=b:
    if a+v*t>=b+w*t:
        print('YES')
    else:
        print('NO')
else:
    if a-v*t<=b-w*t:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if abs(a-b)>t*(v-w):
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if w>=v:
    print("NO")
    exit(0)
s=abs(b-a)/(v-w)
if s<=t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if a <= b:
    total_a = a + v * t
    total_b = b + w * t
    if total_a >= total_b:
        print('YES')
    else:
        print('NO')
else:
    total_a = a - v * t
    total_b = b - w * t
    if total_a <= total_b:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
k=abs(b-a)
s=w-v

print("YES" if s<=0 and k+t*s<=0 else "NO")

Submission status: Accepted

Solution code:
import numpy as np
a, v = list(map(int, input().split(' ')))
b, w = list(map(int, input().split(' ')))
t = int(input())

if w >= v:
    print('NO')
    exit()

catchup_speed = (v - w)
start_dis = np.abs(b - a)

max_dis = t*catchup_speed

if start_dis <= max_dis:
    print('YES')
    exit()

print('NO')

Submission status: Accepted

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
check1=abs(A-B)
check2=(V-W)*T
print("YES" if check1<=check2 else "NO")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(a-b)+w*t <= v*t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A, V = [int(x) for x in input().split()]
B, W = [int(x) for x in input().split()]
T = int(input())

if W >= V:
    print('NO')
elif abs(A - B) <= (V - W) * T:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
d = t * (v - w)
if abs(a-b) <= d:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print('NO')
    exit()
else:
    that = abs(b-a)/(v-w)
    if 0 <= that <= t:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = V-W
if d <= 0:
    print("NO")
else:
    if abs(A-B) <= (d*T):
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

if v<=w:
  print("NO")
  exit()

if abs(a-b)/abs(v-w)<=t:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a,v = list(map(int,input().split()))
b,w = list(map(int,input().split()))
t = int(input())

if w >= v:
    print('NO')
elif abs(a-b)/(v-w) <= t:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:

def s0():return input()
def s1():return input().split()
def s2(n):return [input() for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print(yes if b else no)
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
# from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx as nx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
a,v=n1()
b,w=n1()
t=n0()

ans="NO"
if w<v:
    k=(v-w)*t
    if k>=abs(a-b):
        ans="YES"
print(ans)

Submission status: Accepted

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
ans = "NO"
if v>w and abs(a-b)/(v-w)<=t:
    ans = "YES"
print(ans)

Submission status: Accepted

Solution code:
def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    d = abs(A - B)
    s = V - W
    print('YES' if T * s >= d else 'NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a == b:
  print('YES')
else:
  if v <= w:
  	print('NO')
  else:
    if abs(a-b) / (v - w) <= t:
      print('YES')
    else:
      print('NO')

Submission status: Accepted

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = int(input())
 
d = abs(b_index - a_index)
d_v = a_v - b_v
 
if d == 0 :
  print("YES")
elif d_v > 0 and d / d_v <= t :
  print("YES")
else :
  print("NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())

    if w >= v:
        print("NO")
    elif abs(b-a)/(v-w) <= t:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print("NO")
    exit()

d = abs(b - a)
s = v - w

if d <= t*s:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
# ac
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
    print('NO')
else:
    if (abs(b - a) / (v - w)) <= t:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
# ac
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
    print('NO')
else:
    if 1 <= (abs(b - a) / (v - w)) <= t:
        print('YES')
    else:
        print('NO')