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

distance = abs(B-A)
diff = V-W

if distance - diff * 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())

x = A + V * T
y = B + W * T

z = A - V * T
w = B - W * T

if A < B:
  if x >= y:
    print('YES')
  else:
    print('NO')
else:
  if z <= w:
    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:
    if abs(a-b) <= t*(v-w):
        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())

if a < 0:
    b += abs(a)
    a = 0
if b < 0:
    a += abs(b)
    b = 0

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

Submission status: Accepted

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

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


if __name__  == '__main__':
    main()

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:
    ans="NO"
else:
    if a>b:
        if (a-b)%(v-w)==0:
            if (a-b)//(v-w)<=t:
                ans="YES"
        else:
            if (a-b)//(v-w)+1<=t:
                ans="YES"
    elif a<b:
        if (a-b)%(v-w)==0:
            if (b-a)//(v-w)<=t:
                ans="YES"
        else:
            if (b-a)//(v-w)+1<=t:
                ans="YES"
print(ans)

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:
    tmp = (B-A)/(V-W)
    if abs(tmp) <= T:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
A, V = (int(s) for s in input().rstrip().split())
B, W = (int(s) for s in input().rstrip().split())
T = int(input())

if (V - W) * T >= 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())


l = abs(a-b)

if v <= w:
    print('NO')
elif t >= (l/(v-w)):
    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' if T*V+A >= T*W+B else 'NO')
else:
    print('YES' if T*V-A >= T*W-B else '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')
elif 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 v <= w:
    print("NO")
else:
    dis = abs(b-a)
    sp = abs(v-w)
    if 0 < dis/sp <= t:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
import sys

orga = list(map(int, input().split()))
child = list(map(int, input().split()))
time = int(input())

speed = orga[1] - child[1]
dis = abs(orga[0] - child[0])

if speed <= 0:
    print("NO")
    sys.exit()

if dis / speed <= time:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

    dist = abs(A - B)
    dist_b = dist + W*T
    # if B <= A and (B - W*T) < (-10)**9:
    #     dist_b = abs(A - (-10)**9)

    # elif B > A and (B + W*T) > 10**9:
    #     dist_b = abs(A - 10**9)

    if V*T >= dist_b:
        print("YES")
    else:
        print("NO")




if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

if a <= b and a + v*t >= b + w*t:
    print("YES")
elif a > b and a - v*t <= b - 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())

a = a_v[0]
v = a_v[1]
b = b_w[0]
w = b_w[1]

answer = "YES"
if w - v >= 0:
    answer = "NO"

distance = abs(b-a)
speed = abs(w-v)

if distance <= t*speed and answer != "NO":
    answer = "YES"
else:
    answer = "NO"


print(answer)

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V > W and abs(A - B) <= abs((W - V) * T):
    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 b > a:
    dif = b - a
elif b < a:
    dif = a - b

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

nowdif = v - w
if dif <= nowdif * t:
    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:
  print('NO')
  exit()
else:
  soutaikyori=abs(A-B)
  soutaiV=V-W
  #距離を詰めきれない
  if soutaikyori / soutaiV > T:
    print("NO")
    exit()
  else:
    print("YES")
    exit()
  #距離を詰めきれる?
    #割り切れる
    """
    print("YES")
    exit()
    if soutaikyori%soutaiV==0:
      print("YES")
    else:
      #割り切れない
      amari = soutaikyori % soutaiV
      keikazikan = soutaikyori / soutaiV
      nokorizikan = T - keikazikan
      if A > B:
        A += V * keikazikan
        B += W * keikazikan
      else:
        A -= V * keikazikan
        B -= W * keikazikan

      for t in range(nokorizikan):
        #Aは近づく，Bは離れる
        if A == B:
          print("YES")
          exit()
        elif A > B:
          A -= V
          B -= W
        else:
          A += V
          B += W
      
      print("NO")
    """

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
A,V = [int(hoge) for hoge in input().split()]
B,W = [int(hoge) for hoge in input().split()]
T = int(input())
dist = abs(A-B)
oni = (V-W) * T
if dist <= oni:
    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 b > a:
  a_2 = v * t + a
  b_2 = w * t + b
else:
  a_2 = -v*t + a
  b_2 = -w*t + b  

if a >= b and b_2 >= a_2:
  print("YES")
  exit()
elif b >= a and a_2 >= b_2:
  print("YES")   
  exit()
else:
  print("NO")

Submission status: Accepted

Solution code:
A,V= map(int,input().split())
B,W= map(int,input().split())
T=int(input())
First=abs(A-B)
Move=W-V
if First+(Move*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 A==B:
  print("YES")
elif V<=W:
  print("NO")
elif abs(B-A)/(V-W) <= T:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

import sys

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

    if a == b:
        print("YES")
    elif a > b:
        if (a-v*t)-(b-w*t) <=0:
            print("YES")
        else:
            print("NO")
    else:
        if (w*t+b)-(v*t+a) <= 0:
            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:
  if (T*V+A) >= (T*W+B):
    print("YES")
  else:
    print("NO")
else:
  if  (A-T*V) <= (B-T*W):
    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 += V*T
    B += W*T
    print("YES" if A >= B else "NO")
else:
    A -= V*T
    B -= W*T
    print("YES" if A <= B 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)
closing_speed = v - w
print("YES" if closing_speed * t >= d else "NO")

Submission status: Accepted

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
import math
from decimal import *

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

c = abs(Decimal(b) - Decimal(a))
d = (Decimal(v)*Decimal(t) - Decimal(w)*Decimal(t))

if d >= c:
    print("YES")

else :
    print("NO")

Submission status: Accepted

Solution code:
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
from functools import lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7 

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    A, V = read_values()
    B, W = read_values()
    T = int(input())
    if V <= W:
        print("NO")
        return 
    
    print("YES" if abs(A - B) <= T * (V - W) else "NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split()
 
A = int(a[0])
V = int(a[1])
 
b = input().split()
 
B = int(b[0])
W = int(b[1])
 
T = int(input())
 
if B <0:
    B = B*-1
    A = A*-1
 
if A<B and A + V*T>= B +W*T:
    print("YES")
elif B<A and B -W*T >= A - 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())

dis = abs(max(A,B) - min(A,B))
velo = V - W
if velo <= 0:
    print('NO')
    exit()

if (dis/velo) <= T:
    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 w >= v:
    print("NO")
    sys.exit()

d = abs(b-a)
if (v-w)*t >= d:
    print("YES")
    sys.exit()
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())

a_dis = V * T
b_dis = W * T
dis_diff = abs(B - A)

if dis_diff <= a_dis - b_dis:
    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 = abs(B - A)
if (V-W) * T >= S:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
A_V = input().split()
A = int(A_V[0])
V = int(A_V[1])
B_W = input().split()
B = int(B_W[0])
W = int(B_W[1])
T = int(input())
 
if V - W <= 0:
  print('NO')
elif T < abs(B-A)/(V-W):
  print('NO')
else:
  print('YES')

Submission status: Accepted

Solution code:
a=input().split()
a=[int(i) for i in a]
b=input().split()
b=[int(i) for i in b]
time=int(input())

if a[0]<b[0]:
  ans=a[0]+a[1]*time-b[0]-b[1]*time
else:
  ans=b[0]-b[1]*time-a[0]+a[1]*time

if ans>=0:
  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")
else:
    ans = math.ceil(abs(B-A)/(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())

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

if vec==0:
    print('NO')
elif vec>0 and 0<=dist/vec<=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())
x = a - b
if x < 0:
  x = -x
if v > w and (v - w) * t >= x:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import math

(a, v) = [int(s) for s in input().split()]
(b, w) = [int(s) for s in input().split()]
t = int(input())

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

if v > w and d <= 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())
A = a+(t*v)
B = b+(t*w)
if a == b:
    print('YES')
elif a < b:
    if B <= A:
        print('YES')
    else:
        print('NO')
else:
    A = a-(t*v)
    B = b-(t*w)
    if A <= B:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
Oni = input().split(" ")
A = int(Oni[0])
V = int(Oni[1])
child = input().split(" ")
B = int(child[0])
W = int(child[1])
T = int(input())

if V - W > 0:
    X = V - W
    Y = abs(A - B)
    if X * T >= Y:
        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())

if a < b and a + v * t >= b + w * t:
  print('YES')
elif a > b and 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 a==b:
    print('YES')
elif v<=w:
    print('NO')
elif abs(a-b)/ abs(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 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")
else:
    if a < b:
        time = (b-a)/(v-w)
        if time <= t:
            print("YES")
        else:
            print("NO")
    if b < a:
        time = (a-b)/(v-w)
        if time <= 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())


dis = abs(a-b)
if a < b:
    a_mov = v*t + a
    b_mov = w*t + b
    # print(a_mov,b_mov)
    if b_mov <= a_mov:
        print("YES")
    else:
        print("NO")
else:
    a_mov = (-1*v)*t + a
    b_mov = (-1*w)*t + b
    # print(a_mov,b_mov)
    if b_mov >= a_mov:
        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 A > B:
    Ax = A - V*T
    Bx = B - W*T
    if Ax <= Bx:
        print('YES')
    else:
        print('NO')
else:
    Ax = A + V*T
    Bx = B + W*T
    if Ax >= Bx:
        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:
    position_A = a + (v * t)
    position_B = b + (w * t)
    if position_B <= position_A:
        print("YES")
    else:
        print("NO")
else:
    position_A = a + (-v * t)
    position_B = b + (-w * t)
    if position_B >= position_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())
x = abs(A - B)
v = V - W
if v <= 0:
        print('NO')
else:
    if T < x // v:        
        print('NO')
    elif T == x // v and x % v > 0:
        print('NO')
    else:
        print('YES')

Submission status: Accepted

Solution code:
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
# do magic here
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
distA = v*t
distB = w*t

# diff = abs(a-b)

if a < b:
    if a+distA >= b+distB:
        print("YES")
    else:
        print("NO")
else:
    if a-distA <= b-distB:
        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())
c='YES'
if A<B:
    A+=V*T
    B+=W*T
    if A<B:
        c='NO'
else:
    A-=V*T
    B-=W*T
    if A>B:
        c='NO'
print(c)

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
flg = 1
if a > b:
    flg = -1

a = a+v*t*flg
b = b+w*t*flg

if flg == 1:
    if a >= b:
        print('YES')
    else:
        print('NO')
else:
    if 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 a == b:
  print("YES")
elif a < b:
  a_new = a + v * t
  b_new = b + w * t
  if a_new >= b_new:
    print("YES")
  else:
    print("NO")
else:
  a_new = a - v * t
  b_new = b - w * t
  if a_new <= b_new:
    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 a < b:
    d1 = a + v * t
    d2 = b + w * t
    if d1 < d2:
        print('NO')
        exit()
else:
    d1 = a - v * t
    d2 = b - w * t
    if d1 > d2:
        print('NO')
        exit()

print('YES')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

A, V = input_int()
B, W = input_int()

T = one_int()

speed = (V-W)

kyori = abs(B-A)

if speed*T >= kyori:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,v = mi()
b,w = mi()
t = ii()

dis = abs(a-b)

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

if dis <= abs(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 (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())
distance = abs(a - b)
distance_t = (v * t) - (w * t)

if distance - distance_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 A < B:
  A_P = A + V * T
  B_P = B + W * T
  if A_P >= B_P:
    print("YES")
  else:
    print("NO")
else:
  A_P = A - V * T
  B_P = B - W * T
  if A_P <= B_P:
    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")
elif 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 a < b:
    r1 = a + v * t
    r2 = b + w * t
    if r1 >= r2:
        print('YES')
    else:
        print('NO')
else:
    r1 = a - v * t
    r2 = b - w * t
    if r1 <= r2:
        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:
    distance = abs(B-A)
    velocity = V - W
    if(distance > velocity*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())

kyori = abs(A-B)
if A == B:
    print("YES")
    exit()
if V > W:
    if kyori/(V-W) > T:
        print("NO")
    else:
        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())

lag = False
if V < W:
    flag = False
else:
    if (V-W)*T >= abs(A-B):
        flag = True
    else:
        flag =False

if flag:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
A,V = input().split()
B,W = input().split()
T = input()
Q = 0
try:
  Times = abs(int(A)-int(B))/(int(V)-int(W))
except:
  Times = 0
  Q = 1
if int(V)<=int(W):
  print("NO")
  Q = 1
elif int(T) >= Times:
  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) <= abs(v-w)*t:
    if v > w:
        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())
if A <= B and A+T*V >= B+T*W:
  print("YES")
elif A >=B and A-T*V <= B-T*W:
  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:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a < b:
    oni = a + t * v
    child = b + t * w
    if oni >= child:
        print('YES')
    else:
        print('NO')
elif a > b:
    oni = a - t * v
    child = b - t * w
    if oni <= child:
        print('YES')
    else:
        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())

kyori_sa = abs(a-b)
if v < w:
    print("NO")
elif v > w:
    if (v-w)*t >= kyori_sa:
        print("YES")
    else:
        print("NO")
elif v==w:
    if a == b:
        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 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:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")

# https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_B
import sys
sys.setrecursionlimit(1000000)

A,V = map(int,sys.stdin.readline().split())
B,W = map(int,sys.stdin.readline().split())
T = int(sys.stdin.readline().rstrip())

if A==B:
    print("YES")
    exit()
if W-V>=0:
    print("NO")
    exit()
if abs(A-B)/(V-W)<=T:
    #print(abs(A-B)/(V-W))
    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())

dis =  abs(b-a) - (v-w)*t

if dis > 0 :
  print('NO')
else :
  print('YES')

Submission status: Accepted

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=input()
if ((V-W)*int(T)) < abs(B-A):
    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 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")
else:#v>w
    dif=v-w
    if dif*t>=abs(a-b):
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
a, v = [int(i) for i in input().split()]
b, w = [int(i) for i in input().split()]
t = int(input())

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

Submission status: Accepted

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


def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if A < B:
        a = V * T + A
        b = W * T + B
        if a >= b:
            print('YES')
        else:
            print('NO')
    elif A > B:
        a = -(V * T) + A
        b = -(W * T) + B
        if a <= b:
            print('YES')
        else:
            print('NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, V = [int(n) for n in input().split()]
B, W = [int(n) for n in 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())
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:
i=(input().split())
j=(input().split())
k=(input())

A=int(i[0])
V=int(i[1])
B=int(j[0])
W=int(j[1])
T=int(k)

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

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(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")

Submission status: Accepted

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t = int(input())
kyori = abs(b - a)
sokudo = w - v
if kyori + sokudo * 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())

def zettaiti(A):
    if A>=0:
        return A
    else:
        return -1*A

X=zettaiti(B-A)
H=V-W
if H*T>=X:
    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 B > A :
    if A + V*T >= B + W*T :
        print('YES')
    else :
        print('NO')
elif A > B :
    if B - W*T >= A - 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>W:
    if A>B:
        if A-V*T<=B-W*T:
            print("YES")
        else:
            print("NO")
    elif A==B:
        print("YES")
    else:
        if A+V*T>=B+W*T:
            print("YES")
        else:
            print("NO") 
elif V==W and A==B:
    print("YES")
elif V==W and A!=B:
    print("NO")
elif V<W and A==B:
    print("YES")
elif V<W and A!=B:
    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()



diff = max(A, B) - min(A, B)

speed = V - W

if diff / speed <= T:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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


if V <= W:
    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())
if b > a:
    if  v <= w:
        print("NO")
    elif v > w:
        if a+v*t >= b + w*t:
            print("YES")
        else:
            print("NO")
else:
    if  v <= w:
        print("NO")
    elif v > w:
        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 t*(v-w)>=abs(a-b):
	print("YES")
else:
	print("NO")

Submission status: Accepted

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

yes = "YES"
no = "NO"

if (a == b):
    print(yes)
    sys.exit()

if (w >= v):
    print(no)
    sys.exit()

distance = abs(b - a)
diff_spd = v - w

if ((distance - (diff_spd * t)) > 0):
    print(no)
    sys.exit()

print(yes)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

    if B>A:
        d1 = V*T+A
        d2 = W*T+B
        if (d1 >= d2):
            print('YES')
        else:
            print('NO')
    else:
        d1 = -V*T+A
        d2 = -W*T+B
        if (d2 >= d1):
            print('YES')
        else:
            print('NO')
if __name__ == '__main__':
    main()