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: Wrong Answer

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

A = A-B
B = 0

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

Submission status: Wrong Answer

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

ans='NO'
if v-w==0:
  if a==b:
    ans='YES'
elif abs(a-b)/(v-w)>=0 and abs(a-b)/(v-w)<t:
  ans='YES'

print(ans)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math
from decimal import *
# read = sys.stdin.buffer.read
# readline = sys.stdin.buffer.readline
# readlines = sys.stdin.buffer.readlines
input = sys.stdin.readline

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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
from fractions import Fraction

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

if w == v:
    if a!=b:
        print('NO')
    else:
        print('YES')
    exit()

ans = (a-b)/(w-v)
if ans == int(ans) and 0 <= ans <= t:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
tmp1 = a
tmp2 = b
for _ in range(t):
    tmp1 += v
    tmp2 += w
if tmp1 >= tmp2:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

av = a + (v*t)
bw = b + (w*t)

if av >= bw:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

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

if((A > B and V > W) or (B > A and W > V)):
    print('NO')
    exit(0)

# 相対速度、距離
S = abs(V - W)
D = abs(A - B)

if(D / S > T):
    print('NO')
    exit(0)
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
import sys


def _i(): return int(sys.stdin.readline().strip())


def _ia(): return map(int, sys.stdin.readline().strip().split())


def main():
    a, v = _ia()
    b, w = _ia()
    t = _i()
    if a > b:
        ans = "Yes" if a - (v-w) * t <= b else "No"
    else:
        ans = "Yes" if a + (v-w) * t >= b else "No"

    return ans


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

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
d=B-A
v=V-W
if B*W<0:
  print("NO")
elif v==0:
  print("NO")
elif d/v<=T:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
s = v-w
d = b-a
if(s*t>=d):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a > b:
    aa = a - t * v
    bb = b - t * w
    if aa > bb:
        print('No')
    else:
        print('Yes')
elif a < b:
    aa = a + t * v
    bb = b + t * w
    if aa < bb:
        print('No')
    else:
        print('Yes')
else:
    print('Yes')

Submission status: Wrong Answer

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

for i in range(T):
    if (A + V * i) == (B + W * i):
        print("Yes")
        exit()

print("No")

Submission status: Wrong Answer

Solution code:
a, speedA = map(int, input().split())
b, speedB = map(int, input().split())
t = int(input())
def do():
    if speedB >= speedA:
        print("NO")
        return 0

    d = abs(a - b)
    x = speedA - speedB
    #if d % x != 0:
    #    print("NO")
    #    return 0

    reachTime = x / d
    if reachTime <= t:
        print("YES")
        return 0
    else:
        print("NO")
        return 0
do()

Submission status: Wrong Answer

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

ans = "No"

if v <= w:
  print(ans)
  exit()


x = abs(v-w)
y = abs(a-b)

if y <= x*t:
  ans = "Yes"

print(ans)

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
flag=0
if v<=w:
    pass
elif (b-a)/(v-w)<=t:
    flag=1
if flag==1:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
d=b-a
s=v-w
if d<s*t:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

x = 0
for _ in range(t):
  a += v
  b += w
  if a >= b:
    x += 1
    break
    
if x == 1:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

a_mini = a-t*v
a_maxi = a+t*v
b_mini = b-t*w
b_maxi = b+t*w
if (a_mini < b_mini < a_maxi) or (a_mini < b_maxi < a_maxi):
    print('YES')
    
else:
    print('NO')

Submission status: Wrong Answer

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):
    if(V > W):
        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: Wrong Answer

Solution code:
a, v = list(map(int, input().split()))
b, w = list(map(int, input().split()))
t = int(input())
if a + v * t >= b + w * t:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
'''     ##     ##  #######  # #  ######
        ##     ##  ##   ##  ###    ##
        ##     ##  ##    #  # #    ##
        #########  #######  # #    ##    '''

import sys
import math
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())

def printspx(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end=" \ ")

MODPRIME = int(1e9+7); BABYMODPR = 998244353;

ONLINE_JUDGE = 1
if not ONLINE_JUDGE:
    sys.stdin = open("input.txt","r")  # <<<  Comment this line  >>> #
    sys.stdout = open("output.txt","w")  # <<<  Comment this line  >>> #
    sys.stderr = open("output.txt","w")  # <<<  Comment this line  >>> #

a, v = get_ints()
b, w = get_ints()
t = int(input())
f1 = a + (v*t)
f2 = b + (w*t)
if f2 > f1:
    print("NO")
else:
    print("YES")

# for _testcases_ in range(int(input())):

'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
DO NOT PLAGIARISE.
TESTCASES:
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
'''

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if w >= v:
    print('NO')
    exit()
ans = (b-a) / (t*(w-v))
if ans <= 0:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

after_a = a + v*t
after_b = b + w*t

if a < b:
    if after_b - after_a <= 0:
        print('YES')
    else:
        print('NO')
else:
    if after_a - after_b <= 0:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if  a+b*e>=b+d*e:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input().split()
b = input().split()
t = input()

d = abs(int(a[0]) - int(b[0]))

if (int(a[1]) <= int(b[1])):
    print('No')
else:
    sek = int(a[1]) - int(b[1])

    if d <= int(t)*sek:
        print('Yes')
    else :
        print('No')

Submission status: Wrong Answer

Solution code:
import itertools
import copy
from collections import deque
import heapq
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
ax = a + v*t
bx = b + w*t
if a < b:
    if ax >= bx:
        print("YES")
    else:
        print("NO")
else:
    if ax <= bx:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if at >= bt:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if w>=v and abs(b-a)>t*(v-w):
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if abs(a-c)<e*(b-d):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
# N = int(input())
A, V = [int(i) for i in input().split()]
B, W = [int(i) for i in input().split()]
T = int(input())
if A == B:
    print("YES")
elif A + V * T >= B + W * T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
oni_x, oni_speed = map(int, input().split())
chi_x, chi_speed = map(int, input().split())
time = int(input())
ans = False

for i in range(time):
    oni_x += oni_speed
    chi_x += chi_speed
    if oni_x == chi_x:
        ans = True
        break
if ans:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if b<a:
    u =	a
    b =	a
    a =	u

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

Submission status: Wrong Answer

Solution code:
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7

def main():
  a, v = I()
  b, w = I()
  t = int(input())
  if b < a:
    print('NO')
  else:
    if (v-w) * t >= b-a:
      print('YES')
    else:
      print('NO')
  
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

A = A-B
B = 0

if A+V*T >= B+W*T:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

if((A > B and V > W) or (B > A and W > V)):
    print('NO')
    exit(0)

# 相対速度、距離
S = abs(V - W)
D = abs(A - B)
if(D % S != 0):
    print('NO')
    exit(0)

if(D // S > T):
    print('NO')
    exit(0)
else:
    print('YES')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a_dis = 0
b_dis = 0

for i in range(t):
    a_dis += v
    b_dis += w

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

Submission status: Wrong Answer

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 <= B-A <= T*(V-W):
            ans = 'YES'

    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

answer=0
for t in range(1,T+1):
    a=A+V*t
    b=B+W*t
    if a==b:
        answer=+1
        break

if answer==0:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

a_len = a + t * v
b_len = b + t * w

if a_len >= b_len:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

for i in range(T + 1):
    if (A + i * V) == (B + i * W):
        print("YES")
        exit()

print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

a, v = map(int, sys.stdin.readline().split())
b, w = map(int, sys.stdin.readline().split())
t = int(sys.stdin.readline())

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
#from collections import Counter # a = Counter(A).most_common()
#from itertools import accumulate #list(accumulate(A))

A, V = mi()
B, W = mi()
t = ii()

if B >= A:
    if B + t * W <= A + V * t:
        print('YES')
        exit()
    print('NO')
else:
    if B - t*W >= A - V * t:
        print('No')
        exit()
    print('NO')

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,v2 = map(int,input().split())
t = int(input())
a_distance = a+v*t
b_distance = b+v2*t
if a_distance >= b_distance:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
# B

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

if A > B:
    print('NO')
else:
    after_A = A + V * T
    after_B = B + W * T
    if after_A >= after_B:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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


def read():
    A, V = map(int, input().strip().split())
    B, W = map(int, input().strip().split())
    T = int(input().strip())
    return A, V, B, W, T


def solve(A, V, B, W, T):
    if A < B:
        a = A + V * T
        b = B + W + T
        return "YES" if a >= b else "NO"
    else:
        a = A - V * T
        b = B - W + T
        return "YES" if a <= b else "NO"
    

if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Submission status: Wrong Answer

Solution code:
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
# import numpy as np
sys.setrecursionlimit(int(pow(10,6)))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


# @lru_cache(None)
a,v=l()
b,u=l()
t=l()[0]
if(b>a):
    rel=v-u
    if(rel<=0):
        print("NO")
        exit()
    else:
        if((b-a)/rel<=t):
            print("YES")
            exit()
        else:
            print("NO")
else:
    b,a=a,b
    u,v=v,u
    rel=v-u
    if(rel<=0):
        print("NO")
        exit()
    else:
        if((b-a)/rel<=t):
            print("YES")
            exit()
        else:
            print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
ansa=a+(v*t)
ansb=b+(w*t)
if(ansa>ansb):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

place_A=A+(T*V)
place_B=B+(T*W)

if place_A>=place_B:
    print("YES")

else:
    print("NO")

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

x = a+v*t
y = b+w*t
if a < b:
    if x < y:
        print('NO')
    else:
        print('YES')
else:
    if x > y:
        print('NO')
    else:
        print('YES')

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
m = 10**9
a+=m
b+=m
a+=v*t
b+=w*t
if a >= b:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

ab = b-a
vt = v * t
wt = w * t

if vt - wt >= ab:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if w==v:
  if a==b:
    print("YES")
  else:
    print("NO")
  exit()

print("YES" if max(a-b,b-a)/(w-v)<=t else "NO")

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

a_new = a + v * t
b_new = b + w * t

if a_new >= b_new:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

D = B - A
S = W - V

if S <= 0:
  print("NO")
elif D / S <= T:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float("inf")
EPS = 1e-6


def yes():
    print("YES")  # type: str


def no():
    print("NO")  # type: str


def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if V-W <= 0:
        no()
        return

    t = abs(A-B)/(V-W)
    if t <= T+EPS:
        yes()
    else:
        no()

    return


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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)/abs(v-w) > t:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Ax = A + V*T
Bx = B + W*T

if Ax >= Bx:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(t):
    if b<a:
        a-=v
        b-=w
    else:
        a+=v
        b+=w
    if a==b:
        print("Yes")
        exit()
print("No")

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
L = b - a
s = v - w
if s <= 0 or L % s != 0 or L//s > t:
    result = "NO"
else:
    result = "YES"
print(result)

Submission status: Wrong Answer

Solution code:

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

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a, v = map(int,input().split())
b, w = map(int, input().split())
t = int(input())
A_dis = a + v*t
B_dis = b + w*t
if A_dis >= B_dis:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if a + v + t >= b + w:
    if v > w:
        print("YES")

    else:
        print("NO")

else:
    print("NO")

Submission status: Wrong Answer

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

ag = a + v * t
bg = b + w * t

if ag >= bg:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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