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秒以内
t=int(input())

if v>w:
    if abs(a-b)<=(v-w)*t:
        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())
x=abs(A-B)
y=V-W
z=y*T
if z>=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 a > b:
    a, b = b, a

oni = a + v * t
nige = b + w * t

if oni >= nige:
    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)
d2 = (v-w)*t
msg = "YES" if d <= d2 else "NO"
print(msg)

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")
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 V<=W:
    print("NO")
    import sys
    sys.exit()
import math
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())
dv = V - W
dist = abs(B - A)
if dv*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())


if (v-w>0 and abs(a-b) <= t*(v-w)):
    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 V>W and abs(A-B)/(V-W)<=T:
    Flag = True
else:
    Flag = False
    
if Flag:
    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 v <= w:
    print('NO')
    exit()

if abs(a-b) <= (v-w)*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 V <= W:
  print('NO')
  sys.exit()
if 0 < 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 (abs(a-b) <= t*(v-w)):
    print("YES")
else:
    print("NO")

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

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

d = abs(A - B)

if V > W and d <= (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(a-b):
    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:
        print('YES')
        return

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

    if d <= dv * T:
        print('YES')
    else:
        print('NO')
    return


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
#
# sys.setrecursionlimit(10 ** 7)
#
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
# import copy


def xnxn(n=0, flag="v"):
    """
    args:
        int n: a number of lows to read
    example:
        input   1
        retrun  1

        input   1 2 3
        return  [1,2,3]
        input   1 2 3
                4
        return  [[1,2,3],
                [4]]
    """
    if n == 0:
        temp = list(map(int, input().split()))
        if len(temp) == 1:
            if flag == "l":
                return temp
            else:
                return temp[0]
        elif len(temp) > 1:
            return temp
    else:
        temp = [list(map(int, input().split())) for _ in range(n)]
        return temp


a, v = xnxn()
b, w = xnxn()
t = xnxn()


# for i in range(t):
#     if b - a > 0:
#         b = min(b + w, 10 ** 9)
#         a = min(a + v, 10 ** 9)
#         if b == a:
#             print("YES")
#             sys.exit()
#     elif b - a < 0:
#         b = max(b - w, 10 ** 9)
#         a = max(a - v, 10 ** 9)
#         if b == a:
#             print("YES")
#             sys.exit()

# print("NO")

if b - a > 0:
    # b_f = min(b+t*w, 10 ** 9)
    # a_f = min(a + t * v, 10 ** 9)
    b_f = b+t*w
    a_f = a+t*v
    if b_f > a_f:
        print("NO")
    else:
        print("YES")


else:
    # b_f = max(b-t*w, -10 ** 9)
    # a_f = max(a-t*v, -10 ** 9)
    b_f = b-t*w
    a_f = a-t*v

    if b_f < a_f:
        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) <= 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 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:
    A2 = A + T*V
    B2 = B + T*W

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

    if A2 <= B2:
        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())
m = min(a,b)
M = max(a,b)
dis = M - m

if dis <= (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:
    Dis = B - A
    VtoW = V - W
else:
    Dis = A - B
    VtoW = V -W

result = VtoW * T

if Dis <= result:
    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:
P = []
S = []
for i in range(2):
    pp, ss  = map(int, input().split())
    P.append(pp)
    S.append(ss)

A = P[0]
V = S[0]
B = P[1]
W = S[1]
T = int(input())

def run():
	if A < B:
		c = (B + W*T) - (A + V*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	elif A > B:
		c =  (A - V*T) - (B - W*T)
		if c <= 0 :
			return 'YES'
		else :
			return 'NO'
	else :
		return 'YES'
print(run())

Submission status: Accepted

Solution code:
import sys
a,v=map(int,input().split())
c,w=map(int,input().split())
d=int(input())
if(w>v):
	print("NO")
else:
    x=0
    y=0
    if(a<=c):
        x=a+d*v
        y=c+d*w
        if(x>=y):
            print("YES")
        else:
            print("NO")
    else:
        x=a-d*v
        y=c-d*w
        if(x<=y):
            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:
    if abs(a-b)<=(v-w)*t:
        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 a<b and v<=w:
    print("NO")
elif a>b and v<=w:
    print("NO")
elif a<b:
    if -((a-b)//(v-w))<=t:
        print("YES")
    else:
        print("NO")
else:
    if -((-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:
  
  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')

Submission status: Accepted

Solution code:
import sys
 
A, V = [int(x) for x in input().strip().split(" ")]
B, W = [int(x) for x in input().strip().split(" ")]
T = int(input().strip())
 
if V <= W:
    print("NO")
    sys.exit(0)
 
distance = abs(A - B)
diff = abs(V - W)
 
t, distance = divmod(distance, diff)
T -= t
if distance == 0 and T >= 0:
    print("YES")
    sys.exit(0)
elif T > 0:
    print("YES")
    sys.exit(0)
print("NO")
sys.exit(0)

Submission status: Accepted

Solution code:

AV = input()
BW = input()
T = int(input())
A = int(AV.split(" ")[0])
V = int(AV.split(" ")[1])
B = int(BW.split(" ")[0])
W = int(BW.split(" ")[1])
if (A <= B) and (A+V*T >= B+W*T):
    print("YES", end="")
elif (A > B) and (A-V*T <= B-W*T):
    print("YES", end="")
else:
    print("NO", end="")

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
def solve():
    d = abs(b - a)
    return (v - w) * t >= d
print('YES' if solve() 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')
    exit()

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

Submission status: Accepted

Solution code:

a = input().split()
b = input().split()
c = input()

A = int(a[0])
V = int(a[1])
B = int(b[0])
W = int(b[1])
T = int(c)

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

tmp = abs(B - A)
k = V - W
if tmp <= k * 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 A == B:
  print("YES")
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())

ans='NO'
kyo=abs(a-b)
so=abs(v-w)

if w>v:
    ans='NO'
elif w==v:
    ans='NO'
elif w<v:
    if kyo>t*so:
        ans='NO'
    elif kyo<=t*so:
        ans='YES'
        #if kyo%so==0:
            #ans='YES'
        #else:
            #ans='NO'
#print(kyo%so)
print(ans)

Submission status: Accepted

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

point_div = abs(a-b)
speed_div = v-w
if speed_div * t >= point_div:
    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:
    v = -v
    if w > 0:
        w = -w
if a < b and  w < 0:
    w = -w



A = t * v + a
B = t * w + b

if A > B:
    if  a < b:
        print("YES")
    else:
        print("NO")
elif A == B:
    print("YES")
elif A < B :
    if a < b:
        print("NO")
    else:
        print("YES")

Submission status: Accepted

Solution code:
in1 = input().split()
in2 = input().split()
in3 = input()
oni = int(in1[0])
onispeed = int(in1[1])
kid = int(in2[0])
kidspeed = int(in2[1])
time = int(in3)
pase = onispeed - kidspeed
flg = True #正の方向
if kid - oni < 0:
  flg = False #負の方向

if flg:
  oniend = (pase * time) + oni
  if (pase <= 0) or (oniend < kid):
    print("NO")  
  else:
    print("YES")
else:
  oniend = oni - (pase * time)
  if (pase <= 0) or (oniend > kid):
    print("NO")  
  else:
    print("YES")

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

#print(A,V,B,W,T)

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

dis = abs(B - A)
speed = V - W


if dis <= speed*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())

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

Submission status: Accepted

Solution code:

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline


def array(size,init=0):
    return [[init for j in range(size[1])] for i in range(size[0])]



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


def II():
    return int(input())

directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))

mod = 10**9+7


def factorial(n):
    fact = 1
    for integer in range(1, n + 1):
        fact *= integer
    return fact


def permutate(x,A):
    n=len(x)
    res=[-1]*n
    for i in range(n):

        res[i]=x[A[i]]
    return res


def generate_bin(digit):
    for b in range(2**digit):
        b=bin(b)
        tmp=b[2:].zfill(digit)
        yield list(map(int,tmp))
        #b=list(map(int,list(b[2:].zfill(digit))))
        #yield b
        

def search(x, count):
    #print("top", x, count)
            

    for d in directions:
        nx = d+x
        #print(nx)
        if np.all(0 <= nx) and np.all(nx < (H, W)):
            if field[nx[0]][nx[1]] == "E":
                count += 1 
                field[nx[0]][nx[1]] = "V"
                count = serch(nx, count)  
                continue
            if field[nx[0]][nx[1]] == "#":
                field[nx[0]][nx[1]] = "V"
                count = serch(nx, count)    
                 
    return count

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

T=II()


d=abs(A-B)

if d<=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())
 
dist = abs(A-B)

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

s = abs(a-b)
if s <= (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()

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

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

Submission status: Accepted

Solution code:
str1 = input()
str2 = input()
str3 = input()

A = str1.split(" ")
B = str2.split(" ")
C = int(str3)
res = ""

# A：追いかける。鬼。
# B：逃げる。追われる。
if int(A[1]) <= int(B[1]):
    res = "NO"
else:
    # 距離差
    diff = abs(int(B[0]) - int(A[0]))
#    print(diff)    
    # 速度差
    speedDiff = abs(int(A[1]) - int(B[1]))
#    print(speedDiff)
    if speedDiff * C < diff:
        res = "NO"
    else:
        res = "YES"


print(res)

Submission status: Accepted

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

daplus = a + v*t
daminus = a - v*t

if daplus < daminus:
    tmp = daplus
    daplus = daminus
    daminus = tmp

dbplus = b + w*t
dbminus = b - w*t

if dbplus < dbminus:
    tmp = dbplus
    dbplus = dbminus
    dbminus = tmp


flag = 0

#aが鬼

if(daminus <= dbplus & dbplus <= daplus):
    flag += 1
if(daminus <= dbminus & dbminus <= daplus):
    flag += 1

if flag == 2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

a = A + W*T
b = B + V*T
c = A - W*T
d = B - V*T


if A < B:
    if a >= b:
        print("YES")
    else:
        print("NO")
else:
    if c <= 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 = float(abs(A-B))
E = float(V - W)

if E <= 0:
	print("NO")
	exit()
time = D/E
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())

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

Submission status: Accepted

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

b,y=map(int,input().split())

n=int(input())

if w<=y:

  print("NO")

else:

  print("YES") if abs(a-b)/(w-y)<=n 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(A-B):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000

a,v = LI()
b,w = LI()
T = I()

if(a == b):
    print('YES')
elif(a > b):
    diff = a - b
    diff2 = v - w
    if(diff2 <= 0):
        print('NO')
    else:
        if(diff / diff2 <= T):
            print('YES')
        else:
            print('NO')
else:
    diff = b - a
    diff2 = v - w
    if(diff2 <= 0):
        print('NO')
    else:
        if(diff / diff2 <= 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<0:
    if a > 0:
        d = a-b
    else:
        d = b-a
else:
    d = a-b
if d < 0:
    d = -d
if v > w:
    d2 = v-w
else:
    d2 = w-v
if  (v > w) and (d2*t < d):
    print("NO")
elif 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 V*T >= abs(B - A) + (T*W):
    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 or (V-W)*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())
D=abs(A-B)
S=V-W
if (S<=0):
    print("NO")
elif (D / 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 v <= w:
  print("NO")

else:
  ans = (b - a) / (v - w)
  if t >= abs(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())

distance = b - a
speed_remainder = v - w

if speed_remainder < 0:
    print("NO")
elif abs(distance) <= t * speed_remainder:
    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())

eva=False

pl=abs(B-A)
ve=V-W

if pl<=ve*T:
    if ve>0:
        eva=True
if eva:
    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: 
    Ap = A + V*T
    Bp = B + W*T

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

    if Ap <= Bp:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

Solution code:
import math

def a():
    s = input()
    print(s[:3])


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


def c():
    print('')



def d():
    print('')


b()

Submission status: Accepted

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

# 鬼が右
if A > B:
    A_len = A-V*T
    B_len = B-W*T
#    A_len = max(-(10**9), A-V*T)
#    B_len = max(-(10**9), B-W*T)
    if A_len <= B_len:
        print('YES')
    else:
        print('NO')
# 鬼が左
else:
    A_len = A+V*T
    B_len = B+W*T
#    A_len = min(10**9, A+V*T)
#    B_len = min(10**9, B+W*T)
    if A_len >= B_len:
        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())

dif = abs(a-b)
v_dif = abs(v-w)
if v<=w and a!=b:
    print("NO")
elif dif>v_dif*t:
    print('NO')
else:
    print("YES")

Submission status: Accepted

Solution code:
import sys

n = list(map(int,input().split()))
r = list(map(int,input().split()))
t = int(input())

A = n[0]
V = n[1]

B = r[0]
W = r[1]

T = t

after_a = A + V * T
after_b = B + W * T

after_a_min = A - V * T
after_b_min = B - W * T

if (after_a == after_b) or (after_a_min == after_b_min):
    print('YES')
    sys.exit()

if A < B and after_a > after_b:
    print('YES')
    sys.exit()

if A < B and after_a < after_b:
    print('NO')
    sys.exit()


if A > B and after_a_min < after_b_min:
    print('YES')
    sys.exit()

if A > B and after_a_min > after_b_min:
    print('NO')
    sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

    ans = 'NO'

    if V > W:
        if A > B:
            t = (B-A)/(W-V)
        else:
            t = (B - A) / (V - W)

        if t <= T:
            ans = 'YES'

    print(ans)

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:
    print("YES")
    exit(0)

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

if a < b:
    t = (b-a) / (v-w)
#    mod_t = (b-a) % (v-w)
else:
    t = (a-b) / (v-w)
#    mod_t = (a-b) % (v-w)

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

if A < B and W < 0:
    W = -W

    
a = V * T + A
b = W * T + B

if a > b:
    if A < B:
        print("YES")
    else:
        print("NO")
elif a == b:
    print("YES")
    
elif a < b:
    if A < B:
        print("NO")
    else:
        print("YES")

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,c=map(int,input().split())
b,d=map(int,input().split())
t=int(input())
if c<=d:
  print('NO')
else:
  if abs(a-b)<=(c-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 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((b-a) > 0):
  a = a+v*t
  b = b+w*t
  if(a >= b):
    print("YES")
  else:
    print("NO")
    
elif((b-a) < 0):
  a = a-v*t
  b = b-w*t
  if(a <= b):
    print("YES")
  else:
    print("NO")

Submission status: Accepted

Solution code:
A, a = input().split()
B, b = input().split()
T = input()

A = int(A)
a = int(a)
B = int(B)
b = int(b)
T = int(T)

distance = abs(A-B)
speed = a-b

if distance - speed * T <= 0:
    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 a == b:
    print("YES")
    sys.exit()

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


if approach_rate * t >= sa:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

    if (v-w) > 0:
        x = (b-a)/(v-w)
    else:
        return 'NO'
    
    if abs(x) <= t:
        return 'YES'

    return 'NO'


print(solve())

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
 
position_diff = abs(a-b)
pace_diff = v-w
 
if pace_diff <= 0:
    print('NO')
elif pace_diff > 0:
    if pace_diff * t >= position_diff:
        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 >=0 and b>=0 :
    if a+v*t >= b+ w*t:
        print("YES")
    else:
        print("NO")
elif a <0 and b >=0:
    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:
#B=>一部WA
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())


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

Submission status: Accepted

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

if v == w:
  print("NO")
else:
  if a > b and w > v:
    print("NO")
  elif b > a and w > v:
    print("NO")
  else:
    l = abs(b - a)
    k = abs(v - w)
    if k * t >= l:
      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())
ans = 0
if a == b:
    ans = 1
if v == w:
    ans = 0
elif v>w and abs(a-b)/(v-w) <= t :
    ans = 1
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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, v = (int(c) for c in input().split(" "))
b, w = (int(c) for c in input().split(" "))
t = float(input())
if v <= w:
    print("NO")
elif abs(a -b)/float(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())
x=a-b
y=abs(x)
if v*t>=(y+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")
elif t < abs(a - b) / abs(v - w):
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
import math
import sys
a,v=(int(x) for x in input().split())
b,w=(int(x) for x in input().split())
t = int(input())

e1=pow(-10, 9)
e2=pow(10, 9)

if (a<e1)or(e2<a)or(b<e1)or(e2<b)or(v<1)or(e2<v)or(w<1)or(e2<w)or(t<1)or(e2<t)or(a==b):
    sys.exit(0)

ab = abs(b-a)/t+w-v

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

Submission status: Accepted

Solution code:
oni, oni_spd = list(map(int, input().split()))
child, child_spd = list(map(int, input().split()))
T = int(input())

dist = abs(child - oni)
ofs_spd = oni_spd - child_spd

if ofs_spd * T >= dist:
  print('YES')
else:
  print('NO')