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:

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

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


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())
for i in range(t):
    oni = a + i*v
    nige = b + i*w
    if oni == nige:
        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())
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())
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())

AB = abs(A - B)
VW = V - W

if VW == 0:
  print("No")
  
elif AB <= VW * 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 + v*t -b -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())

d=abs(a-b)


if(v*t>=b*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())
print(['YES','NO'][abs(B-A)/(V-W)>=T] if V-W>0 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 > (V-W)*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())
print(['NO','YES'][B-A+V-W>=T])

Submission status: Wrong Answer

Solution code:
a,v = map(int,input().split())
b,w  = map(int,input().split())
t = int(input())
flg = 0
for i in range(t):
  a+=v
  b+=w
  if(a==b):
    flg=1
    break
    
if(flg==1):print("YES")
else:print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

you = t * v + a
me  = t * w + b
print("YES" if you >= me 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 B+W*T <= A*V*T:
    print("YES")
elif A > B and B-W*T >= A-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 A < B and B+W*T <= A*V*T:
    print("YES")
elif A > B and B*W*T >= A*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*t+a-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 B+W*T <= A*V*T:
    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 or w>v:
    print('NO')
    sys.exit()
else:
    tp=(b-a)/(v-w)
    tm=(a-b)/(v-w)
    if b>a:
        if t>tp:
            print('YES')
        else:
            print('NO')
    else:
        if t>tm:
            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()
tp=(b-a)/(v-w)
tm=(a-b)/(v-w)
if b>a:
    if tp<0:
        print('NO')
    elif t>tp:
        print('YES')
    else:
        print('NO')
else:
    if tm<0:
        print('NO')
    elif t>tm:
        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()
else:
    if abs(A-B) + V * T >= 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")
    exit()
if a < b:
    if v > w:
        t = (b-a)/(v-w)
        if t <= T:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")
else:
    if w > v:
        t = (a-b)/(w-v)
        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 (V > W) and \
   (abs(A - B) <= T * (V - W)) and \
   (abs(A - B) % (V - W) == 0):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v,b,w,t=map(int,open(0).read().split())
print(['NO','YES'][w<v and b-a<=(v-w)*t])

Submission status: Wrong Answer

Solution code:
a,v,b,w,t=map(int,open(0).read().split())
print('YNEOS'[v<=w or (b-a)/(w-v)>t::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

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

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

Submission status: Wrong Answer

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

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

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

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

Submission status: Wrong Answer

Solution code:
stdin = [input() for i in range(3)]
line = stdin[0].split(' ')
A = int(line[0])
V = int(line[1])
line = stdin[1].split(' ')
B = int(line[0])
W = int(line[1])
T = int(stdin[2])
length = 0
if B < A:
    length = B-A
else:
    length = A-B
if (V-W)*T < length:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
stdin = [input() for i in range(3)]
line = stdin[0].split(' ')
A = int(line[0])
V = int(line[1])
line = stdin[1].split(' ')
B = int(line[0])
W = int(line[1])
T = int(stdin[2])
if B < A:
    print('NO')
else:
    if (V-W)*T < B-A:
        print('NO')
    else:
        print('YES')

Submission status: Wrong Answer

Solution code:
stdin = [input() for i in range(3)]
line = stdin[0].split(' ')
A = int(line[0])
V = int(line[1])
line = stdin[1].split(' ')
B = int(line[0])
W = int(line[1])
T = int(stdin[2])
if B > A:
    if (V-W)*T < B-A:
        print('NO')
    else:
        print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
stdin = [input() for i in range(3)]
line = stdin[0].split(' ')
A = int(line[0])
V = int(line[1])
line = stdin[1].split(' ')
B = int(line[0])
W = int(line[1])
T = int(stdin[2])
if (V-W)*T < B-A:
    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 = v*2 - w*2
if d > 0:
    s = abs(b-a)
    f = abs(v-w)
    if f*(t-1) >= s-d:
        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())
d = v*2 - w*2
if d > 0:
    s = abs(b-a)
    f = abs(v-w)
    if f*(t-1)-s <= d:
        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())

count = 0
a = A
b = B

if A == B:
  print("NO")
  exit()

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

    sa = B - A
    diff = V - W
    if sa//diff <= T:
      print("YES")
    else:
      print("NO")
else:
  if V >= W:
    print("NO")
  else:
    sa = A - B
    diff = W - V
    if sa//diff <= 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 == 0:
  print("NO")
elif 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())
d = v*2 - w*2
if d > 0:
    sign = 1 if a < b else -1
    flag = False
    while t > 1:
        a += sign*v
        b += sign*w
        if abs(b-a) <= d:
            flag = True
            break
        t -= 1
    if flag:
        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)<=abs(v-w)*t:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
import math

a, v = [int(i)  for i in input().split()]
b, w = [int(i)  for i in input().split()]
t = int(input())

if w >= v:
  print("NO")
  exit()
#print((b-a) / (v-w))

for i in range(1,t+1):
  if a + v*t == b + w*t:
    print("YES")
    exit()
print("NO")

Submission status: Wrong Answer

Solution code:
import math

a, v = [int(i)  for i in input().split()]
b, w = [int(i)  for i in input().split()]
t = int(input())

if w >= v:
  print("NO")
  exit()
#print((b-a) / (v-w))

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

ab = abs(A-B)
vw = abs(W-V)
dis = vw * T
if dis >= ab:
    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:
  print("NO")
  exit()
#print((b-a) / (v-w))
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())

set_position = abs(B-A)
move         = V-W
for i in range(T):
    set_position -= move

    if set_position==0:
        print("YES")
        break
    elif set_position < 0:
        print("NO")
        break
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:
  print("NO")
  exit()
#print((b-a) / (v-w))
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())
if A == B:
  print("YES")

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

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

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

d1 = (v - w)*t
d2 = abs(a-b) 
if d1 <= d2 :
    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())

d1 = v - w
d2 = abs(a-b) <= t*(v-w)
if d1 <= d2 :
    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())

d1 = v <= w
d2 = abs(a-b) <= t*(v-w)
if d1 <= d2 :
    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())

d1 = v <= w
d2 = abs(a-b) < t*(v-w)
if d1 <= d2 :
    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())

d1 = v <= w
d2 = abs(a-b) <= t*(v-w)
if d1 <= d2 :
    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())

abs_BA = abs(B-A)
sub_WV = W-V

if sub_WV >= 0:
  print("NO")
elif abs_BA / sub_WV <= T:
  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())

abs_BA = abs(B-A)
sub_WV = W-V

if sub_WV >= 0:
  print("NO")
elif (abs_BA * sub_WV) < 0 and abs_BA / sub_WV <= 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:
  print("YES")

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

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


# 相対速度、距離
S = abs(V - W)
D = abs(A - B)
if(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 = map(int, input().split())
B, W = map(int, input().split())
T = int(input())


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

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


if(D > S * T):
    print('NO')
    exit(0)
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=(w-v)*t
if x>=abs(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())
x=abs(v-w)*t
if x>=abs(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())
z=(v*t)+a
y=(w*t)+b
if w>=v:
    print("NO")
elif z-y>=0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t = int(input())
if a[1] <= b[1]:
    print('NO')
    sys.exit()
elif abs(a[0]-b[0])//abs((a[1]-b[1])) <= t:
    print('YES')
    sys.exit()
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t = int(input())
if a[1] <= b[1]:
    print('NO')
    sys.exit()
elif abs(a[0]-b[0])//(a[1]-b[1]) <= t:
    print('YES')
    sys.exit()
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t = int(input())
if a[1] <= b[1]:
    print('NO')
    sys.exit()
elif abs(a[0]-b[0])//(a[1]-b[1]) <= t:
    print('Yes')
    sys.exit()
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t = int(input())
if a[1] <= b[1]:
    print('NO')
    sys.exit()
elif abs(a[0]-b[0])//a[1]-b[1] <= t:
    print('Yes')
    sys.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*(w-v):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

if tmp1 <= tmp2*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())
ans = 'YES'
A = a+(v*t)
B = b+(w*t)

if A<B:
    ans = 'NO'

print(ans)

Submission status: Wrong Answer

Solution code:
A, V = tuple(int(c) for c in input().split(' '))
B, W = tuple(int(c) for c in input().split(' '))
T = int(input())

delta = V - W

if A == B:
  print('YES')
  exit()
elif delta <= 0:
  print('NO')
  exit()
else:
  d = abs(A-B)
  time = d // delta + 1
  if time <= T:
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A, V = tuple(int(c) for c in input().split(' '))
B, W = tuple(int(c) for c in input().split(' '))
T = int(input())

delta = V - W

if A == B:
  print('YES')
  exit()
elif delta <= 0:
  print('NO')
  exit()
else:
  d = abs(A-B)
  time = d // delta + 1
  print(time)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
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())
ans = ''
if w < v:
    ans = 'YES'
else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
#import math

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

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

Submission status: Wrong Answer

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

acnt = a+v*t
bcnt = b+w*t

if acnt >= bcnt:
    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())

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

Submission status: Wrong Answer

Solution code:
import sys, os, math, bisect, itertools, collections, heapq, queue
from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal

# import fractions

sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)

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


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, V = il()
    B, W = il()
    T = ii()

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

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

print ("YES" if V-W > 0 and abs(A-B) // (V-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 + 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 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 a + v * t > b + w * t:
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
P = [list(map(int,input().split())) for i in range(2)]
T = int(input())
if(P[0][1]<P[1][1]):
  print('NO')
else:
  if(abs(P[0][0]-P[1][0])<abs(P[0][1]-P[1][1])*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 = float(input())
 
if abs(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())
 
if(V <= W):
	print("NO")
elif(abs(B - A) >= abs(V - W) * 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())
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())

if(b > a):
    if(b + w*t < a + v*t):
        print('YES')
    else:
        print('NO')
if(b < a):
    if(b - w*t > a - 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(b > a):
    if(b + w*t < a + v*t):
        print('Yes')
    else:
        print('No')
if(b < a):
    if(b - w*t > a - v*t):
        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 V-W > 0 and 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())
dis = abs(B-A)
mob = abs(V-W)


if V-W <= 0:
    print("No")
else:
    if dis - T*mob <= 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())

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

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

Submission status: Wrong Answer

Solution code:
str1 = input().split()
str2 = input().split()
str3 = input()
a = int(str1[0])
v = int(str1[1])
b = int(str2[0])
w = int(str2[1])
t = int(str3)

result = 'NO'

for num in range(t):
 if (a + v*num) == (b + w*num):
    result = 'YES'
    break
    
print(result)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right

def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if V > W and abs(B-A)//(V-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())
if v <= w:
    print('NO')
    exit()
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())

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

d = abs(A - B)
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())
if abs(a-b)>(v-w)*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())
if v <= w:
    print('NO')
    exit()
if b - a <= t * (v - w):
    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())
distance = abs(A[1]) + abs(B[1])

A[1] = A[1] * T
B[1] = B[1] * T

if distance <= abs(A[1] - B[1]):
  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())
distance = abs(A[1]) + abs(B[1])

A[1] = A[1] * T
B[1] = B[1] * T



if distance < (A[1] - B[1]):
  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())
distance = abs(A[1]) + abs(B[1])

A[1] = A[1] * T
B[1] = B[1] * T



if distance <= (A[1] - B[1]):
  print('YES')
else:
  print('NO')