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())
#N = int(input())
#al = list(map(int,input().split()))

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

Submission status: Wrong Answer

Solution code:
import sys, math
import io, os
#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
#from bisect import bisect_left as bl, bisect_right as br, insort
#from heapq import heapify, heappush, heappop
#from collections import defaultdict as dd, deque, Counter
#from itertools import permutations,combinations
def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var) : sys.stdout.write(' '.join(map(str, var))+'\n')
def out(var) : sys.stdout.write(str(var)+'\n')
#sys.setrecursionlimit(100000)
#INF = float('inf')
mod = 998244353
#from decimal import Decimal

a,v=mdata()
b,w=mdata()
t=int(data())
if a<=b and a+v*t>=b+w*t:
    out("YES")
elif a>b and a+v*t<=b+w*t:
    out("YES")
else:
    out("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 = -v * t
    b = -w * t
    print('YES' if a < b else 'NO')
elif a < b:
    a = v * t
    b = w * t
    print('YES' if a > b else 'NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def input_one_number():
    return int(input())

def input_multiple_number():
    return map(int, input().split())

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


A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()

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

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

Submission status: Wrong Answer

Solution code:
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
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 = int(input())

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

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

a = 0
b -= a
if b < 0:
    b = -b

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

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

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

Submission status: Wrong Answer

Solution code:
import io,sys
sys.setrecursionlimit(10**6)


def main():
    a,v = map(int,sys.stdin.readline().rstrip().split())
    b,w = map(int,sys.stdin.readline().rstrip().split())
    t = int(input())

    l = abs(a-b)
    p = abs(v-w)
    if p != 0 and l/p <= t:
        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())

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

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

L = abs(A-B)
rV = V - W
if L % rV == 0:
    if L <= rV*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())
D = abs(A-B)
S = abs(V-W)
print("YNEOS"[D>T*S::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

flag = False
for i in range(t+1):
  x = a + v * i
  y = b + w * i

  if x == y:
    flag = True
    break
    
print("Yes" if flag else "No")

Submission status: Wrong Answer

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

def main():
    A, V = mi()
    B, W = mi()
    T = int(input())
    if abs(A-B) >= T*(V-W):
        print('NO')
    else:
        print('YES')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd, floor
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(float, input().split())
def LIST(): return list(map(float, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np

A, V = MAP()
B, W = MAP()
T = INT()

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

if T*(V-W) >= 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")
else:
    time=abs(a-b)/(v-w)
    print(time)
    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())

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

Submission status: Wrong Answer

Solution code:
from math import gcd

from math import factorial as f

from math import ceil,floor,sqrt
import math

import bisect
import re
import heapq


from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

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


yes = "Yes"
no = "No"


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

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




main()

Submission status: 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 > 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())
val1 = A + V*T
val2 = B + W*T
if val1 >= val2:
    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:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy


if __name__ == "__main__":
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    d = abs(b-a)
    vt = v*t
    wt = w*t
    a = a + vt
    b = b + wt
    if 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())

print("YES" if V >= W else "NO")

Submission status: Wrong Answer

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

def input_one_number():
    return int(input())

def input_multiple_number():
    return map(int, input().split())

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


A , V = input_multiple_number()
B, W = input_multiple_number()
T = input_one_number()

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

if D - v*T > 0:
	print("NO")
else:
	print("Yes")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
[a,v] = list(map(int, input().split()))
[b,w] = list(map(int, input().split()))
t = int(input())
Acoor = a + v*t
Bcoor = b + w*t
if Acoor>=Bcoor:
    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 == b or v > w else "NO")

Submission status: Wrong Answer

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

d = abs(A - B)
V_AB = V - W

if (V_AB <= 0):
    print("NO")
elif (d / V_AB >= T):
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,datetime,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

a,v = inpl()
b,w = inpl()
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())


a_ans = A + V*T
b_ans = B + W*T

if(a_ans>=b_ans):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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

sys.setrecursionlimit(10 ** 7)

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

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

D = abs(A - B)

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

X = V - W

if D % X == 0 and D <= X * T:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,v=[int(x) for x in input().rstrip().split()]
b,w=[int(x) for x in input().rstrip().split()]
t=int(input())


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

Submission status: Wrong Answer

Solution code:
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

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

def read_s_list_loop(n):
    return [input() for _ in range(n)]

A,V = read_int_map()
B,W = read_int_map()
T = read_int()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

d = b-a

if (v-w)*t>=d:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
def LI():return list(map(int,input().split()))
def yes():print("YES")
def no():print("NO")

a,v=LI()
b,w=LI()
t=int(input())

akun=a+v*t
bkun=b+w*t

if a<b:
    if akun>=bkun:
        yes()
    else:
        no()
else:
    if akun<=bkun:
        yes()
    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:
    print('YES')
    exit()

if W > V:
    print('NO')
    exit()

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd, floor
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(float, input().split())
def LIST(): return list(map(float, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
#import numpy as np

A, V = MAP()
B, W = MAP()
T = INT()

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

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

Submission status: Wrong Answer

Solution code:
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    a, v = i_map()
    b, w = i_map()
    t = i_input()

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

    print('YES' if at >= bt 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())

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

for i in range(t):
    a = a + v
    b = b + w
    if a == b:
        print("YES")
        exit(0)

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

af = a+V*T
bf = b+W*T

print('YES' if (a-b)*(af-bf) <= 0 else 'NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from collections import *
from math import *

a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
x = a+v*t
y = b+w*t
if(x >= y):
	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 = a+v*t
y = b+w*t
if x < y:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if V<=W:
    print('NO')
    exit()
n=abs(A-B)//(V-W)
if n<=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())

la, ra = a - t * v, a + t * v + 1
lb, rb = b + t * w, b + t * w + 1


l, r = min(la, lb), max(ra, rb)
if l == la and r == ra:
    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:
def LI():
    return list(map(int, input().split()))

a, v = LI()
b, w = LI()
t = int(input())

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

Submission status: Wrong Answer

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

import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

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

if A >= B:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

b -= a
if b < 0:
    b = -b

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

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

xa = a + t * v
xb = b + t * w

print(['NO', 'YES'][xa >= xb])

Submission status: Wrong Answer

Solution code:
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

A, V = ri_()
B, W = ri_()
T = ri()
print('YES' if (A > B and V < W) or (A < B and V > W) or (A == B) else 'NO')

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, V = MAP()
B, W = MAP()
T = INT()

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

Submission status: Wrong Answer

Solution code:
import sys


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


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

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

    print(ans)


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((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 abs(A-V)>(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())
l = a+v*t
r = b+w*t
if l >= r:
    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, io, os, re
import bisect
from pprint import pprint
from math import sin, cos, pi, radians, sqrt, floor
from copy import copy, deepcopy
from collections import deque
from fractions import gcd
from functools import reduce
from itertools import groupby

n1 = lambda: int(sys.stdin.readline().strip())
nn = lambda: list(map(int, sys.stdin.readline().strip().split()))
f1 = lambda: float(sys.stdin.readline().strip())
fn = lambda: list(map(float, sys.stdin.readline().strip().split()))
s1 = lambda: sys.stdin.readline().strip()
sn = lambda: list(sys.stdin.readline().strip().split())
nl = lambda n: [n1() for _ in range(n)]
fl = lambda n: [f1() for _ in range(n)]
sl = lambda n: [s1() for _ in range(n)]
nm = lambda n: [nn() for _ in range(n)]
fm = lambda n: [fn() for _ in range(n)]
sm = lambda n: [sn() for _ in range(n)]

def array1(n): return [0] * n
def array2(n, m): return [[0] * m for x in range(n)]
def array3(n, m, l): return [[[0] * l for y in xrange(m)] for x in xrange(n)]

A, V = nn()
B, W = nn()
T = n1()

if V <= W:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

dif = b-a
vel = v-w

if vel*t >= dif:
    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_pos = abs(B-A)
diff_spd = abs(W-V)

if (diff_pos > diff_spd * (T+1)) :
    print("NO")
else :
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if a>b:
  if a-v*t<=b-t*w:
    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 = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
av = a + v * t
bw = b + w * t
if av >= bw:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

a_last = a+v*t
b_last = b+w*t

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

dist_a = a + t*v

dist_b = b + t*w

if dist_a>=dist_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())
print(['NO','YES'][V>W and abs(A-B)//(V-W)<=T])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


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

enda = a + v*t
endb = b + w*t

if a >= b and endb >= enda:
    print("YES")
elif a <= b and endb <= enda:
    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 abs(a-v) <= (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())

Ap = A + V*T
Bp = B + W*T

if Ap < Bp:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    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')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Wrong Answer

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

if c>=g:
    print("YES")
else:
    print("NO")