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 = [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')

Submission status: Accepted

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


  
#print(a_ans,b_ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

T = int(input())

d = abs(A - B)

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

Submission status: Accepted

Solution code:
# coding: utf-8


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,V=input().split()
B,W=input().split()
T=int(input())
A=int(A)
V=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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,v=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 V-W<=0:
        print('NO')
    elif abs(A-B)/(V-W)<=T:
        print('YES')
    else:
        print('NO')

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T =  int(input())
if V-W <= 0:
    print('NO')
else:
    if abs(A-B)/(V-W)-T > 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 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())

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

Submission status: Accepted

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


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

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


if kyori / sa <= 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

YES = "YES"  # type: str
NO = "NO"  # type: str


def solve(A: int, V: int, B: int, W: int, T: int):
    if V <= W :
        print(NO)
        exit()
    
    x_dif = abs(A-B)
    v_dif = abs(W-V)

    if math.ceil(x_dif / v_dif) <= T:
        print(YES)
    else:
        print(NO)


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    V = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, V, B, W, T)

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

D = abs(B - A)
X = V - W

if D <= X * T:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    a, v = nm()
    b, w = nm()
    t = ni()
    df_x = abs(b-a)
    df_v = v - w
    if df_v * t >= df_x:
        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(abs(b-a) - (v-w)*t <= 0):
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

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


main()

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")
elif(abs(b-a)/(v-w) > 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())
k = abs(A-B)
d = V-W
if d <= 0:
  print("NO")
else:
  if (k / d) > 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())

Aleft = A-V*T
Aright = A+V*T
Bleft = B-W*T
Bright = B+W*T

if Aleft <= Bleft and Bright <= Aright:
    print("YES")
else:
    print("NO")

#print(A-V*T, A+V*T)
#print(B-W*T, B+W*T)

Submission status: Accepted

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

import sys
d = abs(b - a)
if d == 0:
    print('YES')
    sys.exit()
vv = v - w 
if vv <= 0:
    print('NO')
    sys.exit()

tt = d/vv
if tt <= t:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

if v-w<=0:
    print('NO')
else:

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if v > w and 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())

dis = abs(A-B)

if V > W:
  if dis/(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())
sa=abs(A-B)
ksa=V-W
tsa=ksa*T

if sa<=tsa:
    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())

flug = False
if V != W:
    dist = abs(A - B)
    speed = V - W
    second = dist / speed
    if 0 <= second <= T:
        flug = True
if flug: 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) + (W*T - V*T) <= 0:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

gap = abs(a - b)
velocity_gap = v - w

is_reached = gap <= (velocity_gap * t)
print('YES' if is_reached 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()
d=abs(B-A)
v=V-W
if d/v<=T:
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
#東京海上日動　プログラミングコンテスト2020 b
a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
dis = abs(a-b)
move =  v-w
if dis <= move * 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())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

YES = "YES"  # type: str
NO = "NO"  # type: str


def solve(A: int, V: int, B: int, W: int, T: int):
    distance = abs(A - B)
    velocity_diff = V - W
    if velocity_diff * T >= distance:
        print(YES)
    else:
        print(NO)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    V = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, V, B, W, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def hantei(A,B,V,W,T):
    if V <= W:
        return('NO')
    else:
        if abs(B - A)/(V - W) <= T:
            return('YES')
        else:
            return('NO')
    
print(hantei(A,B,V,W,T))

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 T >= (abs(A-B)/(V-W)) >= 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 (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())

bfr = abs(a - b)
aft = (v * t - w * t)
if aft >= bfr:
    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 V <= W:
        return False
    if abs(B-A)/(V-W) <= T:
        return True
    return False
if main():
    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:
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys
input = sys.stdin.readline
ipnl = lambda n: [int(input()) for _ in range(n)]
inp = lambda :int(input())
ip = lambda :[int(w) for w in input().split()]

a,v = ip()
b,w = ip()
t = inp()
if a < b:
    if (a + v*t) >= (b + w*t):
        print("YES")
    else:
        print("NO")
else:
    if (a - v*t) <= (b - w*t):
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


def main():
    A, V = readnums()
    B, W = readnums()
    T = readint()
    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')


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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	B
# CreatedDate:  2020-06-13 21:03:30 +0900
# LastModified: 2020-06-13 21:09:41 +0900
#


import os
import sys
#import numpy as np
#import pandas as pd


def main():
    a,v=map(int,input().split()) #oni
    b,w=map(int,input().split()) #escape
    t = int(input())
    sub=abs(a-b)
    if v<=w:
        print('NO')
        return 
    if sub>t*(v-w):
        print("NO")
        return
    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())

relative_v = V - W
dist = abs(A - B)

if relative_v <= 0:
    print("NO")
elif dist <= relative_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:
    maxA = A + V * T
    maxB = B + W * T
    if maxA >= maxB:
        print("YES")
    else:
        print("NO")
else:
    maxA = A - V * T
    maxB = B - W * T
    if maxA <= maxB:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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


input = sys.stdin.readline
def IS(cb): return cb(input().strip())
def IL(cb): return [cb(s) for s in input().strip().split()]
def IR(cb, rows): return [IS(cb) for _ in range(rows)]
def ILL(cb, rows): return [IL(cb) for _ in range(rows)]


def solve():
    A, V = IL(int)
    B, W = IL(int)
    T = IS(int)

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

solve()

Submission status: Accepted

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

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

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

c = vel*T

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

Submission status: Accepted

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

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

ans = 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())
c=abs(a-b)
d=v*t-w*t
if c <= d:
    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())
if V > W:
    if abs(A - B) / abs(V - W) <= T:
        print("YES")
    else:
        print("NO")
else:
    if V == W and A == B:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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


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

# print('-----output-----')

Submission status: Accepted

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

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

diffVW = V - W  # m/s
diffAB = abs(A - B)  # m

if diffVW <= 0:
    print("NO")
    exit(0)
else:
    diffVW = abs(diffVW)

if (diffAB / diffVW) <= T:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

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

if s <= 0:
  print('NO')
  exit(0)

if (t * s) >= d:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if (w - v) >= 0:
         print("NO")
         exit()
else:
         if (abs(a - b) + (v - w - 1))//(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())

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

if __name__ == '__main__':
    result = main()
    print(result)

Submission status: Accepted

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

if abs(B-A)-(V-W)*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())

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