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 = [int(i) for i in input().split()]
B, W = [int(i) for i in input().split()]
T = int(input())

if W-V == 0:
    if A == B:
        print('YES')
    else:
        print('NO')
    exit()

t = (A-B)/(W-V)

if t < 0:
    print('NO')
    exit()

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

Submission status: Wrong Answer

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

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

t = (A-B)/(W-V)

if t < 0:
    print('NO')
    exit()

if t<=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 = abs((b-a)/v)
y = abs((w*x)/v)
l = x + y
if l > 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 & V*T+A>=W*T+B:
    print('YES')
elif A>B & V*T+A<=W*T+B:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def read_a_int(): return int(read())


def read_ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

A, V = read_ints()
B, W = read_ints()
T = read_a_int()

if A > B:
    A, B = B, A
    V, W = W, V

D = V - W  # スピードの差
if D * T > B - A:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def read_a_int(): return int(read())


def read_ints(): return list(map(int, read().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

A, V = read_ints()
B, W = read_ints()
T = read_a_int()

if A > B:
    A, B = B, A
    V, W = W, V

D = V - W  # スピードの差
if D * T >= B - A:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
B = list(map(int,input().split()))
T = int(input())
A[1] = A[0] + (A[1] * T)
B[1] = B[0] + (B[1] * T)


if A[1] >= B[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())
 
dis =abs(a-b)
mob =v-w
 
if mob<=0:
    print("No")
else:
    if dis/mob <=t:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
# B - Tag

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

ans = 'NO'
dist = abs(A - B)
diff = V - W

if diff > 0 and dist/diff <= T and dist%diff == 0:
    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())
if V <= W:
  print("NO")
  exit()
dis = abs(A - B)
step = abs(W - V)
print("YES" if dis < step * T else "NO")

Submission status: Wrong Answer

Solution code:
A = list(map(int,input().split()))
B = list(map(int,input().split()))
T = int(input())
A[1] += (A[1] * T)
B[1] += (B[1] * T)

if A[1] > B[1]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
# B - Tag

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

ans = 'NO'
dist = abs(A - B)
diff = V - W

if diff > 0 and dist//diff <= T and dist%diff == 0:
    ans = 'YES'
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, v = rm()
b, w = rm()
t = ri()
if v - w == 0:
  print('NO')
  exit()
if 0 <= (a-b) / (v-w) <= t:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

if L <= v * T:
    print('YES')
else:
    print('No')

Submission status: Wrong Answer

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

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

if L <= 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())

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

if speed<=0:
    print("NO")
else:
    if speed*t<=distance:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
# B - Tag

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

ans = 'NO'
dist = abs(A - B)
diff = V - W
for i in range(T):
    if dist == 0:
        ans = 'YES'
        break
    else:
        dist -= diff

print(ans)

Submission status: Wrong Answer

Solution code:
a, a_v = map(int, input().split())
b, b_v = map(int, input().split())
t = int(input())

v = max(b_v-a_v, 0)
l = abs(b-a)

if t*v >= l:
  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 A == B:
    print("YES")
    exit()
 
if V == W:
    print("NO")
    exit()
 
time = abs(A - B) / (W - V)
if 0 <= time and time <= 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 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())

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

if speed<=0:
    print("NO")
else:
    if distance%speed==0:
        tmp=distance//speed
        if tmp<=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 abs(a-b) <= (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())

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

Submission status: Wrong Answer

Solution code:
a, a_v = map(int, input().split())
b, b_v = map(int, input().split())
t = int(input())
flag=0
t_set = 0
if a > b:
  temp = a
  a = b
  b=temp
  temp_v = a_v
  a_v = b_v 
  b_v = temp_v
 

v = a_v - b_v
l = abs(b - a)
 
if l==0:
  print('YES')
elif v==0:
  print('NO')
elif v*t>=l and l%v == 0:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
print("YES")

Submission status: Wrong Answer

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

if A > B:
    x = A
    A = B
    B = x

# Bが逃げ切るとき
if V <= W:
    print('NO')
    sys.exit()

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

    print("NO")

Submission status: Wrong Answer

Solution code:
a, a_v = map(int, input().split())
b, b_v = map(int, input().split())
t = int(input())

v = max(b_v - a_v, 0)
l = abs(b - a)

if l==0:
  print('YES')
elif v==0:
  print('NO')
elif v*t>=l and l%v == 0:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a, a_v = map(int, input().split())
b, b_v = map(int, input().split())
t = int(input())

v = b_v - a_v
l = abs(b - a)

if l==0:
  print('YES')
elif v==0:
  print('NO')
elif v*t>=l and l%v == 0:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
a_now, a_speed = map(int, input().split(' '))
b_now, b_speed = map(int, input().split(' '))
t = int(input())

# print(a_now, a_speed, b_now, b_speed, t)

# speedの差分と現在の差分で割り切れればOK、割り切れなければダメ
if(a_speed < b_speed):
  caught = 'NO'
else:
  diff = abs(a_now - b_now)
  speed = b_speed - a_speed
  #print("現在の距離差は{0}. スピード差は{1}".format(diff, speed))
  if(diff == 0):
    caught = 'NO'
  elif(speed == 0):
    #print("speedが一緒なので終わらない")
    caught = 'NO'
  else:
    q = diff / speed
    #print("おいつくのは{0}秒後. 余りは{1}".format(q, mod))
    if(q <= t):
      caught = 'YES'
    else:
      caught = 'NO'

print(caught)

Submission status: Wrong Answer

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

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

if speed>=0:
    print("NO")
else:
    speed=abs(speed)
    if distance%speed==0:
        tmp=distance//speed
        if tmp<=t:
            print("YES")
        else:
            print("NO")
    
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
a, a_v = map(int, input().split())
b, b_v = map(int, input().split())
t = int(input())

v = a_v - b_v
l = abs(b - a)

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

Submission status: Wrong Answer

Solution code:
a,v=map(float,input().split())
b,w=map(float,input().split())
t=float(input())
b = max(a,b)
a = min(a,b)
gap = abs(b-a)
v_gap = abs(v-w)
if v>=w: 
  if v_gap*t>=gap:
    print('YES')
  else:
    print('NO')
else:
  print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a_now, a_speed = map(int, input().split(' '))
b_now, b_speed = map(int, input().split(' '))
t = int(input())

# print(a_now, a_speed, b_now, b_speed, t)

# speedの差分と現在の差分で割り切れればOK、割り切れなければダメ
if(a_speed < b_speed):
  caught = 'NO'
else:
  diff = abs(a_now - b_now)
  speed = b_speed - a_speed
  #print("現在の距離差は{0}. スピード差は{1}".format(diff, speed))
  if(diff == 0):
    caught = 'NO'
  elif(speed == 0):
    #print("speedが一緒なので終わらない")
    caught = 'NO'
  else:
      q = diff / speed
      #print("おいつくのは{0}秒後. 余りは{1}".format(q, mod))
      if(q <= t):
        caught = 'YES'
      else:
        caught = 'NO'

print(caught)

Submission status: Wrong Answer

Solution code:
import math

def oni(ax, av, bx, bv, t):
    x = abs(bx - ax)
    v = av - bv

    if (v <= 0):
        print('NO')
    elif (x/v > t):
        print('NO')
    elif (x%v != 0): 
        print('NO')
    else:
        print('YES')

ax, av = list(map(int, input().split()))
bx, bv = list(map(int, input().split()))
t = int(input())

oni(ax, av, bx, bv, t)

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

Submission status: Wrong Answer

Solution code:
import sys

def main():
  inputs = [input() for i in range(3)]
  oni = list(map(int, inputs[0].split()))
  kid = list(map(int, inputs[1].split()))
  time = int(inputs[2])
  
  pA = oni[0]
  pB = kid[0]
  for i in range(time):
    print(pA, pB)
    if pA == pB:
      print("YES")
      return 0
    pA = pA + oni[1]
    pB = pB + kid[1]
  print("NO")

if  __name__ == "__main__":
  main()

Submission status: Wrong Answer

Solution code:
import math
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
 
if w >= v:
    print('No')
else:
    for i in range(1,t+1):
        if abs(a-b) <= (w-v)*i:
            print('YES')
            break
    print('No')

Submission status: Wrong Answer

Solution code:
a_now, a_speed = map(int, input().split(' '))
b_now, b_speed = map(int, input().split(' '))
t = int(input())

# print(a_now, a_speed, b_now, b_speed, t)

# speedの差分と現在の差分で割り切れればOK、割り切れなければダメ
if(a_now < b_now and a_speed <= b_speed):
  #print("aのほうが遅いので一生捕まらない")
  caught = 'NO'
elif(a_now > b_now and a_speed >= b_speed):
  #print("aのほうが先に行ってるので一生捕まらない")
  caught = 'NO'
else:
  diff = abs(a_now - b_now)
  speed = abs(a_speed - b_speed)
  #print("現在の距離差は{0}. スピード差は{1}".format(diff, speed))
  if(diff == 0):
    caught = 'NO'
  elif(speed == 0):
    #print("speedが一緒なので終わらない")
    caught = 'NO'
  else:
      q = diff / speed
      #print("おいつくのは{0}秒後. 余りは{1}".format(q, mod))
      if(q <= t):
        caught = 'YES'
      else:
        caught = 'NO'

print(caught)

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

lange = B - A
s = V - W

res = 0

if s != 0:
    tmp = lange / s
    if tmp <= T and tmp >= 0:
        res = 1

if (res == 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())

x = abs(v-w)
y = a - b
z = y * t

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

Submission status: Wrong Answer

Solution code:
import math
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
 
if w >= v:
    print('No')
else:
    for i in range(1,t+1):
        if abs(a-b) <= (w-v)*i:
            print('Yes')
            break
    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")
    import sys
    sys.exit()

# import math
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())
X = abs(A-B)
Y = V-W
if (V<=W):
  print('NO')
#elif ((X%Y) == 0) and ((X/Y)<=T):
elif ((X%Y) == 0) and ((X/Y)<=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)*t>=(b-a):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")
    import sys
    sys.exit()

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

# print("t=",t)
# print("A+Vt=", A+V*t)
# print("B+Wt=", B+W*t)

t = (B-A)//(V-W)
if A+V*t >= B+W*t:
    if 1 <= t and 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 v <= w:
    print('NO')
else:
    if 1 <= ((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())

if(V <= W):
  print("NO")
else:
  x = (B-A)/(V-W)
  if(abs(int(x)) <= 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 and a < b and (1 <= (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())

if v<=w:
  print("no")
  exit()
  
dis = abs(a-b)
vdis = v-w
time = dis/vdis
if time <= 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())
velocity = v-w
dist = b-a
if velocity == 0:
    print('NO')
elif v<w :
    print('NO')
elif abs(dist) % velocity == 0 and abs(dist)== t*velocity:
    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 = abs(A-B)
Y = V-W
if (V<=W):
  print('NO')
elif ((X%Y) == 0) and ((X/Y)<=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*t + a >= w*t + b and a < b:
    print("YES")
elif v*t + a <= w*t + b and 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())

if A == B:
    print('YES')
    sys.exit()

if A > B:
    if V >= W:
        print('NO')
    else:
        length = abs(A-B)
        s = abs(V-W)
        if length/s <= T:
            print('YES')
        else:
            print('NO')
else:
    if W >= V:
        print('NO')
    else:
        length = abs(A-B)
        s = abs(V-W)
        if length/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秒以内
t=int(input())

if v>w:
    if abs(a-b)<=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())
v=V-W
l=abs(A-B)

if l<=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())

x = v - w
y = b - a

z = x * t

if y < z:
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
def tag(a,b,v,w,t):
    res = ((v*t)-(abs(b-a))+(w*t))
    if res>=0:
        return "YES"
    return "NO"

if __name__ == "__main__":
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    print(tag(a,b,v,w,t))

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if B-A+(W-V)*T > 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秒以内
t=int(input())

if v>w:
    if abs(a-b)<=v*w*t:
        print("YES")
        exit()
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")
    import sys
    sys.exit()
import math
if abs(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())

if a > b:
    a, b = b, a

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

if oni >= nige:
    print('Yes')
else:
    print('No')

Submission status: 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:
  x=A-B
  y=W-V
  z=int(x//y)
  if z<=T:
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a_now, a_speed = map(int, input().split(' '))
b_now, b_speed = map(int, input().split(' '))
t = int(input())

# print(a_now, a_speed, b_now, b_speed, t)

# speedの差分と現在の差分で割り切れればOK、割り切れなければダメ
caught = 'NO'
if(a_now < b_now and a_speed <= b_speed):
  #print("aのほうが遅いので一生捕まらない")
  caught = 'NO'
elif(a_now > b_now and a_speed >= b_speed):
  #print("aのほうが先に行ってるので一生捕まらない")
  caught = 'NO'
else:
  diff = abs(a_now - b_now)
  speed = abs(a_speed - b_speed)
  #print("現在の距離差は{0}. スピード差は{1}".format(diff, speed))
  if(diff == 0):
    caught = 'NO'
  elif(speed == 0):
    #print("speedが一緒なので終わらない")
    caught = 'NO'
  else:
      q = diff // speed
      mod = diff % speed
      #print("おいつくのは{0}秒後. 余りは{1}".format(q, mod))
      if(q <= t):
        caught = 'YES'
      else:
        caught = 'NO'

print(caught)

Submission status: Wrong Answer

Solution code:
def oni(ax, av, bx, bv, t):
    x = bx - ax
    v = av - bv

    if (v <= 0):
        print('NO')
        return
    elif (x/v >= t):
        print('NO')
        return
    elif (x%v == 0): 
        print('YES')
        return
    else:
        print('NO')

ax, av = list(map(int, input().split()))
bx, bv = list(map(int, input().split()))
t = int(input())

oni(ax, av, bx, bv, t)

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

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

Submission status: Wrong Answer

Solution code:
def tag(a,b,v,w,t):
    res = ((v*t)-abs(b-a)+(w*t))
    if res>=0:
        return "YES"
    return "NO"

if __name__ == "__main__":
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    print(tag(a,b,v,w,t))

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python


def run(a, vt, b, wt):
    if a <= b:
        if b + wt <= a + vt:
            return 'Yes'
        else:
            return 'No'
    else:
        if a - vt <= b - wt:
            return 'Yes'
        else:
            return 'No'


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

    print(run(A, V*T, B, W*T))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if V <= W:
  print('NO')
  sys.exit()
if 0 < abs((B-A))//(V-W) <= T:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

if V <= W:
    print("NO")
elif (abs(A-B)/abs(V-W)) <= T and (abs(A-B)%abs(V-W) == 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秒以内
t=int(input())

if v>w:
    abs(a-b)>=v*w*t
    print("YES")
    exit()
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 <= t*(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())
count = 0
if abs(a - b) > v*t:
    pass
else:       
    for i in range(1, t+1):
        if a < b:
            a += v 
            b += w
            if a == b:
                count = 1
                break
            else:
                pass
        else:
            a -= v
            b -= w
            if a == b:
                count = 1
                break
            else:
                pass
 
print("YES" if count == 1 else "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 >= B-A:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
import sys

A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if V <= W:
  print('NO')
  sys.exit()
if 0 < abs((B-A)//(V-W)) <= T:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python


def run(a, vt, b, wt):
    if a < b:
        if b + wt <= a + vt:
            return 'Yes'
        else:
            return 'No'
    else:
        if a - vt <= b - wt:
            return 'Yes'
        else:
            return 'No'


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

    print(run(A, V*T, B, W*T))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def tag(a,b,v,w,t):
    res = ((v*t)-(b-a)+(w*t))
    if res>=0:
        return "YES"
    return "NO"

if __name__ == "__main__":
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    print(tag(a,b,v,w,t))

Submission status: Wrong Answer

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

v = a[1]
w = b[1]

if v <= w:
    print('NO')
else:
    s = v - w
    d = abs(b[0] - a[0])
    if d % s == 0 and d / s <= t:
        print('YES')
    elif d < v and v-d <= t:
        if (v-1)/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())
P = 0
if (-10**9 <= A <= 10**9) and (-10**9 <= B <= 10**9) and (1 <= V <= 10**9) \
and  (1 <= W <= 10**9) and (1 <= T <= 10**9) and (A != B) and type(A) == int and\
type(B) == int and type(V) == int and type(W) == int and type(T) == int:
    
    while P != T: 
        if A > B and V > B:
            A -= V
            B -= W
            P+=1
        
        elif A < B and V>B:
            A += V
            B += W
            P+=1

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

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 V <= W:
    print('NO')
    exit()

d = abs(A - B)

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