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:
from copy import copy, deepcopy
from collections import Counter
from math import sqrt, floor, factorial
from itertools import permutations, combinations, combinations_with_replacement
from operator import mul
from functools import reduce
import bisect

MOD = 10**9 + 7
INF = float('inf')

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

dist = abs(A-B)
vel = (V-W)*T

if dist <= vel:
    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:
# coding: utf-8

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

length = abs(a-b)
diff = (v-w)*t

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

Submission status: Accepted

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

dist = abs(b - a) + (w * t) - (v * t)
if dist > 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:
    print('NO')
else:
    l = abs(a-b)
    u = (v-w)*t
    if l <= u:
        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 = b - a
vw = v - w
if a == b:
    print('YES')
    exit()

if ab <= 0:
    ab = -ab
if vw <= 0:
    print('NO')
else:
    k = ab/vw
    if k <= 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())
result = "NO"
if V <= W:
    print(result)
else:
    D = abs(A-B)
    d = abs(V-W)
    if D > d*T:
        print(result)
    else:
        result = "YES"
        print(result)

Submission status: Accepted

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

Submission status: Accepted

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

if W >= V:
    print("NO")
else:
    if sec <= T:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

if a <= b :
    a_x = a+v*t
    b_x = b + w*t

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

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

Submission status: Accepted

Solution code:
import sys
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
    return map(int,input().split())
def ii():
    return int(input())
sys.setrecursionlimit(10**9)
A,VA = mips()
B,VB = mips()
T = ii()
if A <= B:
    d1 = A + VA * T
    d2 = B + VB * T
    if d1 >= d2:
        print("YES")
    else:
        print("NO")
else:
    d2 = B - VB * T
    d1 = A - VA * T
    if d1 <= d2:
        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 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())
d = abs(a - b)
if w >= v:
    print("NO")
else:
    x = v - w
    if x * t >= d:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

def main():
    if V >= W:
        print("NO")
        return
    
    
    elif abs(B-A)/abs(V-W) <= T:
        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 (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())

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

if speed < 0:
  print('NO')
elif speed*t >= diff:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
oni = list(map(int, input().split()))
non = list(map(int, input().split()))
time = int(input())

if abs(non[0]-oni[0])>time*(oni[1] - non[1]):
  ans = "NO"
else:
  ans = "YES"

print(ans)

Submission status: Accepted

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

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

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")
    exit()
if A>B:
    h0 = -1*V * T + A
    h1 = -1*W * T + B
    if h0 <= h1:
        print("YES")
    else:
        print("NO")
else:
    h0 = V * T + A
    h1 = W * T + B
    if h0 >= h1:
        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 = abs(B-A)
v = V-W
v2 = v*T

if(a<=v2):
    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)
v_diff = abs(v-w)

if w >= v:
    print('NO')
elif d > t * v_diff:
    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)
L = (V-W)*T

if K > L :
  print("NO")
else :
  print("YES")

Submission status: Accepted

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

elif b>a:
    a_l = a+(t*v)
    b_l = b+(t*w)
    
    if a_l >= b_l:
        print('YES')
    else:
        print("NO")

Submission status: Accepted

Solution code:
# B

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

vel_diff = V - W
loc_diff = abs(A - B)

if loc_diff - vel_diff * T <= 0:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    a_info = input().split(" ")
    b_info = input().split(" ")
    second = int(input())

    sabun = (int(a_info[1]) * second) - (int(b_info[1]) * second)

    # Aの方が大きい
    if int(a_info[0]) > int(b_info[0]):
        start = int(a_info[0]) - int(b_info[0])
    else:
        start = int(b_info[0]) - int(a_info[0])

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

else:
    print("NO")

Submission status: Accepted

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

dis = abs(a[0]-b[0])

if (b[1]*t+dis) <= a[1]*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:
  diff_start = abs(b - a)
  diff_speed = v - w
  if diff_start <= diff_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())
if A<B:
    if A+V*T>=B+W*T:
        print("YES")
    else:
        print("NO")
if A==B:
    print("YES")
if A>B:
    if A-V*T<=B-W*T:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
a,v = map(float,input().split())
b,w = map(float,input().split())
t = float(input())
first_distance = abs(b-a)
speed = v-w
t_position = first_distance - speed*t
if t_position <= 0:
  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())
    #print(A,V,B,W,T)

    if( (V-W)*T - abs(B - A) >= 0 ):
        return print('YES')
    else:
        return 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)*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())

if a<b:
  x = b-a
else:
  x = a-b

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

Submission status: Accepted

Solution code:
A_V = input().split()
A = int(A_V[0])
V = int(A_V[1])
B_W = input().split()
B = int(B_W[0])
W = int(B_W[1])
T = int(input())

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

Submission status: Accepted

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


def solve(A: int, V: int, B: int, W: int, T: int):
    if V-W <= 0:
        print("NO")
    elif abs(A-B) > (V-W) * T:
        print("NO")
    else:
        print("YES")
    return 0

# Generated by 1.1.6 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:
def resolve():
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    T = int(input())
    if v <= w:
        print("NO")
        return
    if abs(a - b) <= T * abs(v - w):
        print("YES")
    else:
        print("NO")

resolve()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys


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

    if W > V:
        print('NO')
        sys.exit()
    x = V - W
    c = abs(B - A)
    ans = c - x * T

    if ans <= 0:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

t = int(input())

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

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline
    # 整数 1 つ
    # n = int(input())
    # 整数複数個
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    # 整数 N 個 (改行区切り)
    # N = [int(input()) for i in range(N)]
    # 整数 N 個 (スペース区切り)
    # N = list(map(int, input().split()))
    # 整数 (縦 H 横 W の行列)
    # A = [list(map(int, input().split())) for i in range(H)]

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

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

Submission status: Accepted

Solution code:
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

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

def read_s_list_loop(n):
    return [input() for _ in range(n)]

A,V = read_int_map()
B,W = read_int_map()
T = read_int()
diff = abs(A-B)
if V*T >= W*T+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 - B >= 0:
  C = A - B
else:
  C = B - A
if V - W <= 0:
  print('NO')
elif C/(V - W) <= T:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
K=int(input())
Apos=A
Bpos=B
count=0
rev=False
if B>A:
    pass
else:
    rev=True

if rev==False:

    
        
    A=A+V*K
    B=B+W*K
    if A>=B:
        print("YES")
        exit()
    
        

else:
    A=A-V*K
    B=B-W*K
    if A<=B:
        print("YES")
        exit()

print("NO")

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

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


    if(V <=  W):
        print("NO")
    else:
        X = abs(V - W)

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

dist=B-A
speed=V-W
if dist<0:
    dist=-dist

if speed<1:
    flag=0
elif dist-(speed*T)<=0:
    flag=1


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

Submission status: Accepted

Solution code:
import math
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, B, W, T = map(int, open(0).read().split())
offset = 10**9                                  
delta = abs(A - B) - (V*T) + (W*T)              
if delta <= 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())

move_a = v * t
move_b = w * t

dist = abs(b-a) + move_b - move_a

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

Submission status: Accepted

Solution code:

import sys
import itertools
from math import gcd
from math import sqrt
from sys import stdin
def input() : return stdin.readline().rstrip()
def mips():
    return map(int,input().split())
def ii():
    return int(input())
sys.setrecursionlimit(10**9)
A,VA = mips()
B,VB = mips()
T = ii()
if A <= B:
    d1 = A + VA * T
    d2 = B + VB * T
    if d1 >= d2:
        print("YES")
    else:
        print("NO")
else:
    d2 = B - VB * T
    d1 = A - VA * T
    if d1 <= d2:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

Solution code:
from sys import stdin
from collections import defaultdict as dd
from collections import deque as dq
import itertools as it
from math import sqrt, log, log2, ceil
from fractions import Fraction

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

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

Submission status: Accepted

Solution code:
a,b=(int(x) for x in input().split())
c,d=(int(x) for x in input().split())
g=int(input())
f=b-d
if(a>=c):
    e=a-c
elif(c>a):
    e=c-a
if(f*g>=e):
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[a, v] = raw_input().split()
[b, w] = raw_input().split()
t = int(raw_input())
if int(v) <= int(w):
    print 'NO'
else:
    if int(a) > int(b):
        m = int(a) - int(b)
    else:
        m = int(b) - int(a)
    s = int(v) - int(w)
    if s * t >= m:
        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)
v = abs(W-V)
if V > W and T * v >= 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 a < b and (a + v * t >= b + w * t):
    print('YES')
elif a > b and (a - v * t <= b - w * t):
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

l = abs(b-a)
dv = v-w

if dv <= 0:
    print("NO")
else:
    if l == 0:
        print("YES")
    else:
        if dv*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())

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

elif a<b:
    if v<=w:
        print("NO")
    else:
        if a+v*T>=b+w*T:
            print("YES")
        else:
            print("NO")

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

c = abs(a-b)

if c == 0:
    print("YES")
    exit(0)
if v-w <=0:
    print("NO")
    exit(0)
if c / (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 w-v < 0 and (abs(b-a))/(abs(w-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):
    print("YES")
    i=1

elif(a<b):
    io = (w*t) + (b-a)
    io = io - (v*t)
    if(io<=0):
        print("YES")

    else:
        print("NO")

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

else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

direction = 1 if b > a else - 1
if a == b:
  print('YES')
  sys.exit()


a = a + direction * v * t
b = b + direction * w * t
if direction == 1 and a >= b:
  print('YES')
  sys.exit()
if direction == -1 and a <= b:
  print('YES')
  sys.exit()

print('NO')

Submission status: Accepted

Solution code:
x=[0,0,0]
for i in range(3):
    x[i]=list(map(int, input().split()))
    
l=abs(x[0][0]-x[1][0])
v=x[0][1]-x[1][1]
if l>v*x[2][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 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())
v = V - W
ans = "NO"
if v <= 0:
    ans = "NO"
else:
    if abs(A - B) / v <= T:
        ans = "YES"
print(ans)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

Solution code:
a_info = list(map(int, input().split()))
b_info = list(map(int, input().split()))
time = int(input())

if a_info[0] < b_info[0]:
    a_last = a_info[0] + a_info[1] * time
    b_last = b_info[0] + b_info[1] * time
    if a_last >= b_last:
        print('YES')
    else:
        print('NO')
else:
    a_last = a_info[0] + a_info[1] * time * -1
    b_last = b_info[0] + b_info[1] * time * -1
    if a_last <= b_last:
        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())

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

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

else:
    if(l <= s):
        print("YES")

    else:
        print("NO")

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
A,V = (int(i) for i in input().split())
B,W = (int(i) for i in input().split())
T = int(input())

#T秒以内に距離が０になるか
d =abs(A -B)
speed = V -W
if speed <=0:
    print("NO")
    exit()
else:
    t =d / speed

if t <=T:
    ans ="YES"
else:
    ans ="NO"
print(ans)

Submission status: Accepted

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

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

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")
else:
    remain = abs(A-B)
    r, q = divmod(remain, V-W)
    if r == T and q == 0:
        print("YES")
    elif r < 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 and (A + V * T) >= (B + W * T):
    print("YES")
    exit()
if B < A and (A - V * T) <= (B - W * T):
    print("YES")
    exit()

print("NO")

Submission status: Accepted

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

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

if abs(B-A) <= T*abs(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())


diff1 = abs(A - B)
diff2 = (V - W)*T

if ( diff1 <= diff2):
  print("YES")
else:
  print("NO")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
b = list(map(int, input().split()))
num = int(input())
c = a[0] - b[0]
if c < 0:
  c *= -1
if a[1] <= b[1]:
  print("NO")
else:
  if (a[1] - b[1]) * num >= c:
    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()

time = abs((a-b)/(v-w))

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

Submission status: Accepted

Solution code:
def solve(A,V,B,W,T):
    if V<=W:
        return "NO"
    elif abs(B-A)%(V-W)==0 and abs(B-A)//(V-W)<=T:
        return "YES"
    elif abs(B-A)//(V-W)+1<=T:
        return "YES"
    else:
        return "NO"

A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
print(solve(A,V,B,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):
    print("NO")
elif(abs(A-B)>T*(V-W)):
    print("NO")
else:
    print("YES")