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

if abs((a-b)) + abs(v-w)*t >= 0:
    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 abs((a-b) + (v-w)*t) >= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = [input().split() for l in range(2)]
N = int(input().strip())

A =int(a[0][0])
B =int(a[1][0])
V =int(a[0][1])
W =int(a[1][1])
T = N
print(A,B,V,W,T)

if (V-W)*T >= abs(A-B):
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
a = [input().split() for l in range(2)]
N = int(input().strip())

A =int(a[0][0])
B =int(a[1][0])
V =int(a[0][1])
W =int(a[1][1])
T = N

if (V-W)*T >= abs(A-B):
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
a = [input().split() for l in range(2)]
N = int(input().strip())



A =int(a[0][0])
B =int(a[1][0])
V =int(a[0][1])
W =int(a[1][1])
T = N



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

Submission status: Wrong Answer

Solution code:
s,t = map(int,input().split())
m,n = map(int,input().split())
k = int(input())
if((k*t) == (k*n+m)):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s,t = map(int,input().split())
m,n = map(int,input().split())
k = int(input())
if(t>n):
  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(0,T):
    for e in range(0,T):
        i=i+V
        e=e+W

i=i+A
e=e+B
if i>=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())
for i in range(0,T):
    for e in range(0,T):
        i=i+V
        e=e+W
        
if i>=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())
ans = (b - a) - (v - w) * t
if ans > 0:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


A,V=nm()
B,W=nm()
T=int(input())

d=abs(A-B)
move_s=(V-W)
if(move_s<=0):
    print("NO")
    sys.exit(0)
if(((d//move_s))<=T):
    print("YES")
    sys.exit(0)
print("NO")

Submission status: Wrong Answer

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))


A,V=nm()
B,W=nm()
T=int(input())

d=abs(A-B)
move_s=(V-W)
if(move_s<=0):
    print("NO")
    sys.exit(0)
if(T<=((d//move_s)+1)):
    print("NO")
    sys.exit(0)
print("YES")

Submission status: Wrong Answer

Solution code:
c1 = input().split()
c2 = input().split()
for i in range(2):
  c1[i] = int(c1[i])
  c2[i] = int(c2[i])
t = int(input())
c1[0] += c1[1]*t
c2[0] += c2[1]*t
if c1[0] >= c2[0]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
c1 = input().split()
c2 = input().split()
for i in range(2):
  c1[i] = int(c1[i])
  c2[i] = int(c2[i])
t = int(input())
c1[0] += c1[1]*t
c2[0] += c2[0]*t
if c1[0] >= c2[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, 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,u=map(int,input().split())
b,v=map(int,input().split())
t=int(input())
if(a>=b):
  print('YES')
else:
  dif=b-a
  d=v*t
  dif+=d
  d1=u*t
  if(d1>=dif):
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

Solution code:
def main():
  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:
          print("YES")
      else:
          print("NO")
  else:
      if after_A<=after_B:
          print("YES")
      else:
          print("NO")

if __name__=='__main__':
  main()

Submission status: Wrong Answer

Solution code:
def main():
  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 after_B<=after_A:
      print("YES")
  else:
      print("NO")

if __name__=='__main__':
  main()

Submission status: Wrong Answer

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


D=abs(int(A)-int(B))
D2=abs(int(V)-int(W))


if(D<=D2):
    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_res = A + V * T
B_res = B + W * T
if A > B:
    print("NO")
elif A_res >= B_res:
    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_res = A + V * T
B_res = B + W * T
if A_res >= B_res:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:

list1 = input().split(" ")
list2 = input().split(" ")
T=int(input())

A=int(list1[0])
V=int(list1[1])
B=int(list2[0])
W=int(list2[1])

if W-V==0:
    distance=0
else:
    distance=(A-B)/(W-V)

if 1<=distance and distance<=T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

else:
# T秒後までに同じ座標にいればAが勝つ
    k = (B-A)/(V-W)
    if k <= T and 0 < k:
        win = 'A'
    else:
        win = 'B'


if win == 'A':
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

else:
# T秒後までに同じ座標にいればAが勝つ
    k = (B-A)/(V-W)
    if k < T and 0 < k:
        win = 'A'


if win == 'A':
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
def NextInts(): return map(int,input().split())

A,V = NextInts()
B,W = NextInts()
T = int(input())

SA = A-B
gigo_SA = A+(V*T)-(B+(W*T))

if SA*gigo_SA>0:
	print("NO")
else:
	print("YES")

Submission status: Wrong Answer

Solution code:
def NextInts(): return map(int,input().split())

A,V = NextInts()
B,W = NextInts()
T = int(input())

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline

a, b = map(int, input().split())
c, d = map(int, input().split())
t = int(input())
if b==d :
    print('NO')
elif (abs(a-c)//(b-d))<= t and d<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 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 b - w * t <= a - v * 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 = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

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

Submission status: Wrong Answer

Solution code:
list1 = input().split(" ")
list2 = input().split(" ")
T=int(input())

A=int(list1[0])
V=int(list1[1])
B=int(list2[0])
W=int(list2[1])

for time in range(T+1):
    distance =  B - A + (time * (W-V))
    if distance==0:
        print("YES")
        break
    elif time==T:
        print("NO")

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

else:
# T秒後までに同じ座標にいればAが勝つ
    k = (B-A)/(V-W)
    if k <= T and 0 < k:
        win = 'A'

if win == 'A':
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

else:
# T秒後までに同じ座標にいればAが勝つ
    k = (B-A)/(V-W)
    if k <= T and 0 < k and (k*10)%10 == 0:
        win = 'A'

if win == '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")
difAB = abs(A-B)
difVW = V-W
if difAB<=difVW*T:
    print("YES")

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
dif = abs(B-A)
speed = V-W
if speed <= 0:
    print('No')
else:
    if speed*T >= dif:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
read = lambda: list(map(int, input().split()))
a, v = read()
b, w = read()
t = int(input())
dis = b - a
per = v - w
if a == b:
    print("YES") 
elif per == 0:
    print("NO")
else:
    d, m = divmod(dis, per)
    if d > 0 and m == 0:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
read = lambda: list(map(int, input().split()))
a, v = read()
b, w = read()
t = int(input())
a_pos = v * t + a
b_pos = w * t + b
if a == b:
    print("Yes")
else:
    if a_pos >= b_pos:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

Solution code:
A_V = input().split(" ")
B_W = input().split(" ")
T = int(input())
A = int(A_V[0])
V = int(A_V[1])
B = int(B_W[0])
W = int(B_W[1])
dA = A + V * T
dB = B + W * T
ndA = A - V * T
ndB = B - W * T
if (dA < dB):
    if (ndA > ndB):
        print("NO")
    else:
        print("YES")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
A_V = input().split(" ")
B_W = input().split(" ")
T = int(input())
A = int(A_V[0])
V = int(A_V[1])
B = int(B_W[0])
W = int(B_W[1])
dA = A + V * T
dB = B + W * T
ndA = A - V * T
ndB = B - W * T
if (dA < dB):
    if (ndA > ndB):
        print("NO")
    else:
        print("YES")

Submission status: Wrong Answer

Solution code:
A_V = input().split(" ")
B_W = input().split(" ")
T = int(input())
A = int(A_V[0])
V = int(A_V[1])
B = int(B_W[0])
W = int(B_W[1])
dA = A + V * T
dB = B + W * T
if (dA < dB):
    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())
f=0
for i in range(t):

    a=a+v
    b=b+w
    if a==b:
      f=1
      break
    
if f==1:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
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 (b - a) % (w - v) == 0 and (b - a) // (w - v) <= t:
        print("YES")
    else:
        print("NO")
elif a > b:
    if (a - b) % (v - w) == 0 and (a - b) // (v - w) <= t:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

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

if a < b:
    if (b - a) % (w - v) == 0:
        print("YES")
    else:
        print("NO")
elif a > b:
    if (a - b) % (v - w) == 0:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
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 (b - a) % (w - v) == 0:
        print("YES")
    else:
        print("NO")
elif a > b:
    if (a - b) % (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 = int(input())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# atcoder 
# Türkler var mı?
# Herkese memnün oldum
import sys

iimr = lambda: map(int, sys.stdin.readline().rstrip().split())
sys.setrecursionlimit(10 ** 8)


def 関数(a, v, b, w, t):
    a += v * t
    b += w * t
    if(a >= b):
        return "YES"
    else:
        return "NO" 

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

    res = []
    res.append(関数(A, V, B, W, T))
    print(*res, sep="\n")

if __name__ == "__main__":
    çözmek()

Submission status: Wrong Answer

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

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

main()

Submission status: Wrong Answer

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

flag = False
for i in range(t):
  a += v
  b += w
  if a == b:
    flag = True
    break

if flag:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

else:
# T秒後までに同じ座標にいればAが勝つ
    k = (B-A)/(V-W)
    if k <= T and 0 < k and k == int(k):
        win = 'A'

if win == 'A':
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())
win = ''

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

# 逃げる側の速度が同じか速ければ追いつけない
if W >= V:
    win = 'B'

# T秒後までに同じ座標にいればAが勝つ
k = 1
while k < T:
    if (B + W * k) - (A + V * k) == 0:
        win = 'A'
        break
    k = k + 1

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

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

kyori = b - a
if t * v >= kyori + 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())
L=abs(B-A)
vd=V-W
if vd*T >= L:
	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())
L = abs(B-A)
vd = V-W
if L <= vd * 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())
L = abs(B-A)
vd = V-W
if L <= vd*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())
L=abs(B-A)
vd=V-W
if L <= vd*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())
L=abs(B-A)
vd=abs(V-W)
if L <= vd*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()

L=abs(B-A)
vd=abs(V-W)
if L <= vd*T:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
a,v = map(int, input().rstrip().split())
b, w =  map(int, input().rstrip().split())
t = int(input().rstrip())
if a == b:
  print("YES")
elif b > a 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:
def sackRace(p1, s1, p2, s2): 
      
    # Since starting points are always 
    # different, they will meet if following  
    # conditions are met. 
    # (1) Speeds are not same 
    # (2) Difference between speeds divide the 
    #     total distance between initial points.  
    return ( (s1 > s2 and (p2 - p1) % (s1 - s2) == 0)  
         or (s2 > s1 and (p1 - p2) % (s2 - s1) == 0)) 
p1 , s1=map(int , input().split()) 
p2 , s2=map(int , input().split())
t=int(input()) 
if sackRace(p1 , s1 , p2 , s2):
  print("NO")
else:
  print("YES")

Submission status: Wrong Answer

Solution code:
ap , av=map(int , input().split())
bp , bv=map(int , input().split())
t=int(input())
f=0
for i in range(t):
  ap+=av
  bp+=bv
  if ap == bp:
    f=1
    print("YES")
    break
if f==0:
  print("NO")

Submission status: Wrong Answer

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

pos_oni = A + V * T
pos_nige = B + W * T

if A == B:
    print("YES")
elif A < B:
    if pos_nige <= pos_oni:
        print("YES")
    else:
        print("NO")
elif B < A:
    if pos_oni <= pos_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())

pos_oni = A + V * T
pos_nige = B + W * T

if pos_nige <= pos_oni:
    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 w >= v:
    print('NO')
    exit()

d = abs(a - b)

vel = v - w

if d // vel > 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())
dist = abs(a-b)
velo = v-w
if dist >= velo*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())

abs_A = abs(A)
abs_B = abs(B)

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

Submission status: Wrong Answer

Solution code:


l=list(map(int, input().split(' ')))
a=l[0]
v=l[1]
l=list(map(int, input().split(' ')))
b=l[0]
w=l[1]
s=int(input())
ans=True
if a>b:
    ans=a-v*s<=b-w*s
else:
    ans=a+v*s<=b+w*s
if ans:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def iput(): return int(input())
def mput(): return map(int, input().split())
def lpit(): return list(map(int, input().split()))

def solve():
    a, v = mput()
    b, w = mput()
    t = iput()
    if abs(a - b) < (v - w)*t:
        print("YES")
    else:
        print("NO")
    return 0

if __name__ == "__main__":
    solve()

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*(v-w)):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def iput(): return int(input())
def mput(): return map(int, input().split())
def lpit(): return list(map(int, input().split()))

def solve():
    a, v = mput()
    b, w = mput()
    t = iput()
    if v == w:
        print("NO")
    elif abs(a - b) / (v - w) <= t:
        print("YES")
    else:
        print("NO")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if W >= V:
    print('No')
elif abs(A - B) <= (V - W) * T:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

if B + W * T < A + V * T: #T秒後に鬼が追いついているまたは追い越すなら捕まえられる
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
info_A = input().split()
info_B = input().split()
T = int(input())

A = int(info_A[0]) #A（鬼）の開始位置
V = int(info_A[1]) #A（鬼）の速度
B = int(info_B[0]) #B（逃げる側）の開始位置
W = int(info_B[1]) #B（逃げる側）の速度

if B + W * T <= A + V * 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 v == w:
    print('NO')
    exit()
else:
    that = (b-a)/(v-w)
    if int(that) == that and 0 <= that <= 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()
else:
    that = (b-a)/(v-w)
    if 0 <= that <= t:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = int(input())
 
d = abs(b_index - a_index)
d_v = abs(b_v - a_v)
 
if d == 0 :
  print("YES")
elif d_v != 0 and d / 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()

d = b - a
s = v - w

if d <= t*s:
    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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
elif diff_dist == 0:
    flag = True
else:
    t = diff_dist / diff_v
    if t > 0 and diff_v > 0:
        #if abs(diff_dist) % abs(diff_v) == 0:
        if t <= T:
            flag = True
if flag:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
elif diff_dist == 0:
    flag = True
else:
    t = diff_dist / diff_v
    if t > 0:
        #if abs(diff_dist) % abs(diff_v) == 0:
        if t <= T:
            flag = True
if flag:
    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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
elif diff_dist == 0:
    flag = True
else:
    t = diff_dist / diff_v
    if t > 0:
        #if abs(diff_dist) % abs(diff_v) == 0:
            #if t <= T:
        flag = True
if flag:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

D = abs(A - B)
X = abs(V - W)

if (X*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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
elif diff_dist == 0:
    flag = True
else:
    t = diff_dist / diff_v
    if t > 0:
        if abs(diff_dist) % abs(diff_v) == 0:
            if t <= T:
                flag = True
if flag:
    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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
else:
    t = diff_dist / diff_v
    if t > 0 and (diff_dist > 0 or diff_v > 0):
        if abs(diff_dist) % abs(diff_v) == 0:
            if t <= T:
                flag = True
if flag:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

D = abs(A - B)
X = abs(V - W)

if (X*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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
else:
    t = diff_dist / diff_v
    if t > 0:
        if abs(diff_dist) % abs(diff_v) == 0:
            if t <= T:
                flag = True
if flag:
    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())
diff_dist = B - A
diff_v = V - W
flag = False
if diff_v == 0:
    if diff_dist == 0:
        flag = True
else:
    t = diff_dist / diff_v
    if t > 0:
        if diff_dist % diff_v == 0:
            if t <= T:
                flag = True
if flag:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

D = abs(A - B)
X = abs(V - W)

if (X*T >= D):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

D = abs(A - B)
X = abs(V - W)

if (X*T >= D):
  print("OK")
else:
  print("NG")

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('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)*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())
flag = False
for t in range(T+1):
    if A+V*t == B+W*t:
        flag = True
        break
if flag:
    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 = b - a
y = v - w
n = (a + v * t) - (b + w)
if y <= 0:
    print("NO")
elif n >= 0:
    print("YES")
else:
    print("NO")