Problem:


Score : 200 points

Problem Statement

Two children are playing tag on a number line. (In the game of tag, the child called "it" tries to catch the other child.) The child who is "it" is now at coordinate A, and he can travel the distance of V per second.
The other child is now at coordinate B, and she can travel the distance of W per second.

He can catch her when his coordinate is the same as hers.
Determine whether he can catch her within T seconds (including exactly T seconds later).
We assume that both children move optimally.

Constraints

-10^9 \leq A,B \leq 10^9

1 \leq V,W \leq 10^9

1 \leq  T \leq 10^9

A \neq B

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A V
B W
T

Output

If "it" can catch the other child, print YES; otherwise, print NO.

Sample Input 1

1 2
3 1
3

Sample Output 1

YES

Sample Input 2

1 2
3 2
3

Sample Output 2

NO

Sample Input 3

1 2
3 3
3

Sample Output 3

NO



Sample input:
1 2
3 1
3


Sample output:
YES

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (v == w):
    print('NO')
    sys.exit()
if (abs(a - b) / (v-w) > t or 0>(v-w)):
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
a, v, b, w, t = map(int, open(0).read().split())
dv = v - w
if dv < 0:
    print('NO')
elif abs(b-a) > dv * 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())

distance = abs(a-b)

if distance == 0:
    print("YES")
    exit()

if v <= w:
    print("NO")
else:
    fast = abs(v-w)
    if fast*t >= distance:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, v = [int(k) for k in input().split()]
b, w = [int(k) for k in 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())
D = abs(A-B)
S = V-W
print("YNEOS"[D>T*S::2])

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

diff_x=abs(A-B)
diff_a=max(V-W,0)

if T*diff_a>=diff_x:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce
# stdin = open("sample.txt")

MOD = 1000000007

def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def combination(m,n):
    
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

def pow_k(x,n):  # (x**n)の計算の高速化
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2
    return K * x
    
def main():
    a, v = [int(x) for x in stdin.readline().rstrip().split()]
    b, w = [int(x) for x in stdin.readline().rstrip().split()]
    t = int(stdin.readline().rstrip())
    start = abs(a-b)
    if t*v - t*w >= start:
        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 A<B:
    if B+W*T > A+V*T:
        print("NO")
    else:
        print("YES")
elif B<A:
    if B-W*T<A-V*T:
        print("NO")
    else:
        print("YES")
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:
    print("YES" if a + t * v >= b + w * t else "NO")
else:
    print("YES" if a - t * v <= b - 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 B>=A:
  if A + V * T >= B + W * T:
    print('YES')

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

Submission status: Accepted

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

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

if a>b:
  v = -v
  w = -w
  if b - v*t >= a - w*t:
    print('YES')
  else:
    print('NO')
else:
  if b - v*t <= 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 B < A:
    dist = A - B
    if dist <= (V - W)*T:
        print('YES')
    else:
        print('NO')
else:
    dist = B - A
    if dist <= (V - W)*T:
        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):
    
    d_dif = abs(A-B)
    if d_dif==0:
        print(YES)
        return
    v_dif = V - W
    if v_dif <=0:
        print(NO)
        return
    t = d_dif/v_dif
    if t <= T:
        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:
import sys
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if a == b:
  print("YES")
else:
  kyori = abs(a-b)
  if w >= v:
    print("NO")
    sys.exit()
  diff = abs(v-w)
  if t*diff >= kyori:
    print("YES")
  else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v > w 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 dis == 0:
    print("YES")
else:
    vdiff = v-w

    if vdiff <= 0:
        print("NO")
    else:
        if vdiff *t >= dis:
            print("YES")
        else:
            print("NO")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[5]:


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


# In[6]:


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


# In[ ]:

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()
d=abs(a-b)
if w>=v:
    print("NO")
    exit()
if 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())

d = abs(a-b)

v = max(V-W,0)

print('YES' if v*T >= d else 'NO')

Submission status: Accepted

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

oni = a + v*t
nige = b + w*t
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:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:


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

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

Submission status: Accepted

Solution code:
import sys


def main():
    input = sys.stdin.buffer.readline
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    print('YES' if v * t - w * t >= abs(a - b) else 'NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

b = abs(A - B) + W*T
a = V*T

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

Submission status: Accepted

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

Submission status: Accepted

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

dis = abs(a-b)
mov = abs(v-w)

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

if mov * t >= 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())
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:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
import numpy as np

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

dis = abs(b-a)
hayasa = v-w
ikeru = 0
if hayasa<= 0:
    pass
else:
    if t*hayasa >= dis:
        ikeru = 1
    else:
        pass

if ikeru == 1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


yes = "Yes"
no = "No"


def main():
    a,v = mi()
    b,w = mi()
    t = ii()
    if v <= w:
        print('NO')
        exit()

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

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

Submission status: Accepted

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

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 and l>0:
    print('NO')
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())

v1 = v-w
if v1<=0:
    print('NO')
    exit()
l = abs(a-b)

if v1*t>=l:
    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())    
print('YES' if V>W and  abs(B-A+(V-W-1))//(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())

d = abs(a - b)

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

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

Submission status: Accepted

Solution code:
def main() -> None:
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if W >= V:
        print("NO")
    else:
        print("YES" if (V - W) * T >= abs(B - A) else "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:
    print('NO')
    exit()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, V = lr()
B, W = lr()
if A == B:
    print('YES'); exit()
T = ir()
speed = V - W
if speed <= 0:
    print('NO'); exit()

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

Submission status: Accepted

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


def main():
    a, v = input_to_int_map()
    b, w = input_to_int_map()
    t = input_int()

    tidimu = v - w
    if tidimu <= 0:
        return "NO"

    ret = "NO"
    if abs(a - b) - (tidimu * t) <= 0:
        ret = "YES"

    return ret


if __name__ == "__main__":
    print(main())

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
A,V=map(int, input().split())
B,W=map(int, input().split())
T=int(input())
if W>=V:
  print('NO')
else:
  v=V-W
  d=abs(A-B)
  if d>v*T:
    print('NO')
  else:
    print('YES')

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, namedtuple, deque
import itertools
import functools
import bisect
import heapq
# import math
from fractions import gcd

MOD = 10 ** 9 + 7
# MOD = 998244353
# sys.setrecursionlimit(10**8)

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
    print("NO")
    exit()

dis = t*(v-w)
if dis >= 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())

zzz = abs(a - b)
yyy = v - w

if yyy <= 0:
    print('NO')

elif zzz / yyy <= 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 or w>v:
    print("NO")
    quit()
if abs(a-b)/(v-w)>t:
    print("NO")
else:
    print("YES")

Submission status: Accepted

Solution code:
import sys,queue,math,copy,itertools,bisect,collections,heapq

def main():
    sys.setrecursionlimit(10**7)
    INF = 10**18
    MOD = 10**9 + 7
    LI = lambda : [int(x) for x in sys.stdin.readline().split()]
    _LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
    NI = lambda : int(sys.stdin.readline())
    SI = lambda : sys.stdin.readline().rstrip()
    DD = ((1,0),(0,1),(-1,0),(0,-1))

    A,V = LI()
    B,W = LI()
    T = NI()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def solve(a, v, b, w, t):
    if v <= w:
        return "NO"
    if abs(b - a) <= t * (v - w):
        return "YES"
    else:
        return "NO"


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


def test():
    assert solve(1, 2, 3, 1, 3) == "YES"
    assert solve(1, 2, 3, 2, 3) == "NO"
    assert solve(1, 2, 3, 3, 3) == "NO"


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
l = abs(A-B)
U = V-W
if U < 0:
    print('NO')
elif U == 0 and l!=0:
    print('NO')
elif l == 0:
    print('YES')
elif l/U <= 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:
    c=(max(a,b)-min(a,b))/(v-w)
else:
    c=-1

if 0<=c<=t:
    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")
    exit()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, chain
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7


Yes = 'Yes'
No = 'No'

def main():
    A,V=mis()
    B,W=mis()
    T=ii()

    if A > B:
        A,B=B,A
    
    if B+W*T <= A+V*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())

kyori=abs(A-B)

oihaya=V-W

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

Submission status: Accepted

Solution code:
import sys


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


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

    if A < B:
        if A + V * T >= B + W * T:
            ans = 'YES'
        else:
            ans = 'NO'
    else:
        if A - V * T <= B - W * T:
            ans = 'YES'
        else:
            ans = 'NO'

    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a,v=map(int, input().split())
b,w=map(int, input().split())
t=int(input())
sa=abs(a-b)
kyori=t*(v-w)
if sa==0:
    ans='YES'
else:
    if kyori>=sa:
        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())
dis = abs(a - b)
sb = v - w
if sb <= 0:
    print("NO")
    exit()
time = dis / sb
if time > 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 b < a:
    a*=-1
    b*=-1
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(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())

x = abs(a-b)
if v == w:
    print("NO")
    exit()
tt = x / (v-w)

if t >= tt and tt > 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 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())
dis=abs(A-B)
if V<=W:
    print("NO")
else:
    speed=V-W
    if speed*T>=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())

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

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