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

Solution (Python):


import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from copy import deepcopy
import random
import time
import os
import sys
import datetime
from functools import lru_cache
from functools import reduce
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
alphabet="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):
    if b:print("yes")
    else:print("no")
def Yn(b):
    if b:print("Yes")
    else:print("No")
def YN(b):
    if b:print("YES")
    else:print("NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(bbool,ret1,ret2):
    if bbool:return ret1
    else:return  ret2
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def pm(x):
    return x//abs(x)
def inputintlist(): 
    return list(map(int,input().split()))
def inputfloatlist(): 
    return list(map(float,input().split()))
def tozero(A):
    ret=[None]*len(A)
    for a in range(len(A)):
        ret[a]=A[a]-1
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def ruisekiwa(A):
    ret=[0]*(len(A)+1)
    for a in range(len(A)):
        ret[a+1]=ret[a]+A[a]
    return ret
def getmd(x1,y1,x2,y2):
    return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):
    return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def heron(a,b,c):
    s=(a+b+c)/2
    S=s(s-a)(s-b)(a-c)
    S=math.sqrt(S)
    return S
def getAreaOfTriangle(x1,y1,x2,y2,x3,y3):
    a=geted(x1,y1,x2,y2)
    b=geted(x2,y2,x3,y3)
    c=geted(x3,y3,x1,y1)
    return heron(a,b,c)










A,V=inputintlist()
B,W=inputintlist()
T=int(input())
f=False
if B<A:
    B-=W*T
    A-=V*T
    YN(B>=A)
else:
    B+=W*T
    A+=V*T
    YN(B<=A)

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

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

Solution (Python):
a,v=[int(x) for x in input().split()]
b,w=[int(x) for x in input().split()]
t=int(input())
delta_v=v-w
if delta_v <= 0:
  print("NO")
else:
  T=(abs(b-a))/delta_v
  if T <= t:
    print("YES")
  else:
    print("NO")

Solution (Python):
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")

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

T = int(input())



if W >= V:
    ans = 'NO'
else:
    
    d = abs(A - B)
    av = abs(V - W)
    if d / av <= T:
        ans = 'YES'
    else:
        ans = 'NO'

print(ans)

Solution (Python):
A, V = [int(v) for v in input().split(" ")]
B, W = [int(v) for v in input().split(" ")]
T = [int(v) for v in input().split(" ")][0]

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

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

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

if d <= 0:
    flag = False

if T * d < c:
    flag = False

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

Solution (Python):
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")

Solution (Python):

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

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

Solution (Python):

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

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

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

  if dis <= 0:
    print("YES")
  else:
    print("NO")


main()

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

ans = "NO"

move = v*t - w*t
distance = abs(b - a)

if move > 0 and move >= distance:
    ans = "YES"

print(ans)

Solution (Python):
date0=input().split(" ")
A=int(date0[0])
V=int(date0[1])
date1=input().split(" ")
B=int(date1[0])
W=int(date1[1])
T=int(input())
if V<=W:
    print("NO")
else:
    C=V-W
    D=A-B
    if D<0:
        D=-D
    if D%C==0:
        E=D/C
    else:
        E=(D-D%C)/C+1
    if T>=E:
        print("YES")
    else:
        print("NO")

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

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

if (V_AB <= 0):
    print("NO")
elif (d / V_AB > T):
    print("NO")
else:
    print("YES")

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

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

Solution (Python):
from sys import stdin

a=stdin.readline().split()
A,V=int(a[0]),int(a[1])
b=stdin.readline().split()
B,W=int(b[0]),int(b[1])
T=int(stdin.readline())

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

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

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

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

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

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

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

Solution (Python):

import sys

YES = "YES"  
NO = "NO"  


def solve(A: int, V: int, B: int, W: int, T: int):
    if V<W:
        print(NO)
    else:
        diff_v = V-W
        diff_d = abs(A-B)

        if diff_v * T >= diff_d:
            print(YES)
        else:
            print(NO)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    V = int(next(tokens))  
    B = int(next(tokens))  
    W = int(next(tokens))  
    T = int(next(tokens))  
    solve(A, V, B, W, T)

if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = int(input())

kyori =abs(a[0]-b[0])
t = a[1]-b[1]
if kyori <= t*c:
    print("YES")
else:
    print("NO")

Solution (Python):
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
l = abs(a - b)
u = v-w


if l > u * t:
    print('NO')
else:
    print('YES')

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

Solution (Python):
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
d = A - B
v = V - W

if (d < 0):
    d *= -1

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

Solution (Python):
import math

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)/abs(W-V) <= T:
        print('YES')
    else:
        print('NO')

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

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

Solution (Python):
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction

sys.setrecursionlimit(int(pow(10,6)))


mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]



a,v=l()
b,u=l()
t=l()[0]
d=b-a
rel=v-u
if(rel<=0):
    print("NO")
else:
    T=abs(d)/rel
    if(T<=t):
        print("YES")
    else:
        print("NO")

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

Solution (Python):
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")

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

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

Solution (Python):
import numpy as np

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

speed = V - W
L = np.abs(B - A)

if speed == 0:
    if L == 0:
        print('YES')
    else:
        print('NO')
    exit()

if 0 <= L / speed <= T:
    print('YES')
else:
    print('NO')

Solution (Python):
def read_input(trans=int):
    return list(map(trans, input().split()))


YES = "YES"
NO = "NO"


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

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

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

Solution (Python):
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

A, V = MAP()
B, W = MAP()
T = INT()

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

Solution (Python):
def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    cons = abs(A-B)
    vg = V - W
    if vg <= 0:
        print('NO')
        return
    if cons > T*vg:
        print('NO')
        return
    elif cons <= T*vg:
        print('YES')
        return

main()

Solution (Python):
import sys
import math
import bisect

def solve():
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    d = abs(a - b)
    if d == 0:
        return True
    if v > w and (v - w) * t >= d:
        return True
    return False

def main():
    if solve():
        print('YES')
    else:
        print('NO')

if __name__ == "__main__":
    main()

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

    if V-W <= 0:
        print("NO")
        return

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


if __name__ == '__main__':
    main()

Solution (Python):
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")

Solution (Python):
import numpy as np

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

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

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

Solution (Python):
import sys
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a==b:
    print("YES")
    sys.exit()
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")

Solution (Python):

from sys import stdin
input = stdin.readline

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

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

T = int(input())

if V <= W:
    print("NO")
    exit()

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

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

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

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

if s <= 0 or d / s > t:
    print("NO")
else:
    print("YES")

Solution (Python):
a,v=[int(_) for _ in input().split()]
b,w=[int(_) for _ in input().split()]

T=n=int(input())

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

Solution (Python):
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())
aida = abs(A - B)
if aida +  W * T <= V * T:
    print("YES")
else:
    print("NO")

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

Solution (Python):
import math
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if V!=W:
    if V>W and math.ceil(abs(B-A)/(V-W))<=T:
        print("YES")
        exit()
print("NO")

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

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

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

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

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


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

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

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

max_A = A + V*T
min_A = A - V*T
max_B = B + W*T
min_B = B - W*T

if max_A >= max_B and min_A <= min_B:
    print("YES")
else:
    print("NO")

Solution (Python):


import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

A_L = A - (V * T)
A_R = A + (V * T)

B_L = B - (W * T)
B_R = B + (W * T)

if (A_L <= B_L) and (B_R <= A_R):
    print("YES")
else:
    print("NO")

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

sokudo = abs(w - v)
kyori = abs(b - a)

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

if sokudo*t >= kyori:
    print("YES")
else:
    print("NO")

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

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

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

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

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

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

Solution (Python):
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")

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

Solution (Python):
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')

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

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

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

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

Solution (Python):
grid = []
for i in range(3):
    array = list(map(int, input().strip().split()))
    grid.append(array)
if abs(grid[1][0]-grid[0][0])<=(grid[0][1]-grid[1][1])*grid[2][0]:
    print("YES")
else:
    print("NO")

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

ab = abs(a-b)
vw = abs(v-w)


if v-w > 0:
    if ab <= vw*t:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Solution (Python):
A, V = map(int, input().split())

B, W = map(int, input().split())

T = int(input())

d = abs(A - B)

if d <= (V - W) * T:
    print('YES')
else:
    print('NO')

Solution (Python):



def solve(*args: str) -> str:
    a, v = map(int, args[0].split())
    b, w = map(int, args[1].split())
    t = int(args[2])
    ret = 'NO'
    if a == b:
        ret = 'YES'
    if w < v and abs(a-b)/(v-w) <= t:
        ret = 'YES'
    return ret


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

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

Solution (Python):
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")
elif A < B:
    if (B - A) - (V - W) * T <= 0:
        print("YES")
    else:
        print("NO")
elif A == B:
    print("YES")

Solution (Python):
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")

Solution (Python):
A,V=input().split()
B,W=input().split()
T=int(input())
A=int(A)
V=int(V)
B=int(B)
W=int(W)
distance=abs(A-B)
speed=abs(V-W)
if V<=W:
    print("NO")
if V>W:
    a=T*speed
    if a>=distance:
        print("YES")
    if a<distance:
        print("NO")

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

if A<B:
  A_T=A+V*T
  B_T=B+W*T
  if A_T>=B_T:
    print('YES')
  else:
    print('NO')
else:
  A_T=A-V*T
  B_T=B-W*T
  if A_T<=B_T:
    print('YES')
  else:
    print('NO')

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

dist = abs(A-B)
if dist == 0:
    print("YES")
    exit()
vel = abs(W-V)

if V*T >= W*T + dist:
    print("YES")
else:
    print("NO")

Solution (Python):
input_a = input().split()
a = int(input_a[0])
v = int(input_a[1])
input_b = input().split()
b = int(input_b[0])
w = int(input_b[1])
t = int(input())

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

if relative_velocity <= 0:
    print("NO")
elif  distance / relative_velocity > t:
    print("NO")
else:
    print("YES")

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

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

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

start1 = a
end1 = a+v*t
start2 = b
end2 = b+w*t
if(a==b):
    print("YES")
    exit()
if(w>=v):
    print("NO")
    exit()

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

if(dist <= t*rv): print("YES")
else: print("NO")

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

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

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

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

if a>b:
  muki=-1
else:
  muki=1

at=a+v*muki*t
bt=b+w*muki*t

if muki==1:
  if at>=bt:
    print("YES")
  else:
    print("NO")
else:
  if at<=bt:
    print("YES")
  else:
    print("NO")

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

a_dis = t*v
b_dis = abs(a-b) + t*w

if a_dis >= b_dis:
    print("YES")
else:
    print("NO")

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

length = abs(A - B)
speed = V - W
if (speed * T) >= length:
    ans = 'YES'
else:
    ans = 'NO'

print(ans)

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    A, V = LI()
    B, W = LI()
    T = I()

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

    print(ans)

if __name__ == '__main__':
    resolve()

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

if A < B:
  moveA = A + V*T
  moveB = B + W*T
  if moveA >= moveB:
    print('YES')
  else:
    print('NO')
else:
  moveA = A - V*T
  moveB = B - W*T
  if moveA <= moveB:
    print('YES')
  else:
    print('NO')

Solution (Python):
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('NO')
  else:
    print('YES')

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

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

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

Solution (Python):
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")

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

Solution (Python):
def main():
    A,V = map(int, input().split())
    B,W = map(int, input().split())
    T = int(input())
    if V-W<=0:
        print('NO')
    elif abs(A-B)/(V-W)<=T:
        print('YES')
    else:
        print('NO')

main()

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

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

Solution (Python):
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')

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

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

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


kyori = abs(b-a)
sa = v-w

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


if kyori / sa <= t:
    print('YES')
else:
    print('NO')