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: Accepted

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

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

Submission status: Accepted

Solution code:
A, A_v = map(int, input().split())
B, B_v = map(int, input().split())
Ts = int(input())

# AがBより常に左にいることにする
if A > B:
    A, B = B, A

if A + A_v * Ts >= B + B_v * Ts:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
import bisect
INF = 10 ** 13
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return x if y == 0 else gcd(y, x%y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def LS() : return input().split()
def RS(N) : return [input() for _ in range(N)]
def LRS(N) : return [input().split() for _ in range(N)]
def PL(L) : print(*L, sep="\n")
def YesNo(B) : print("Yes" if B else "No")
def YESNO(B) : print("YES" if B else "NO")

A, V = LI()
B, W = LI()
T = I()

flag = False

s = abs(A-B)

if s == 0:
    flag = True
else:
    if W >= V:
        flag = False
    else:
        t = V - W

        if s <= T*t:
            flag = True

YESNO(flag)

Submission status: Accepted

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

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

else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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: Accepted

Solution code:
def main(A, V, B, W, T):
    dist = abs(A - B)
    velo = V - W
    if dist <= velo * T:
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    A, V = list(map(int, input().split()))
    B, W = list(map(int, input().split()))
    T = int(input())
    main(A, V, B, W, T)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    A, V = [int(i) for i in input().strip().split()]
    B, W = [int(i) for i in input().strip().split()]
    T = int(input().strip())
    if abs(A - B) <= (V - W) * T:
        return "YES"
    else:
        return "NO"


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

Submission status: Accepted

Solution code:
import sys

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

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

    diff = abs(a-b)
    shrink = v - w

    if (shrink * t >= diff):
        print('YES')
    else:
        print('NO')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

    if V <= W:
        print("NO")
        return
    d = abs(A - B)
    v = abs(V - W)
    if d > v * T: print("NO")
    else: print("YES")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import math
#=input()
#=int(input())
a,v=map(int,input().split())
b,w=map(int,input().split())
#=list(map(int,input().split()))
#=[list(map(int,input().split())) for _ in range()]
t=int(input())

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

Submission status: Accepted

Solution code:
def resolve():
    A, V = list(map(int, input().split()))
    B, W = list(map(int, input().split()))
    T = int(input())
    if V < W:
        print('NO')
        return
    else:
        if abs(V-W) * T >= abs(A-B):
            print('YES')
            return
    print('NO')
    return

resolve()

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if b < a:
    a, b = b, a

p = a + v * t >= b + w * t
print(['NO', 'YES'][p])

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, numpy, string
import sys
from bisect import bisect_left, bisect_right, insort
from collections import deque
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def MS(): return map(str, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
# N = I()
# A = [LI() for _ in range(N)]

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

Submission status: Accepted

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

if a < b:
    d = abs(b-a)
else:
    d = abs(a-b)

ans = d - t*v +t*w
print("YES" if ans <= 0 else "NO")

Submission status: Accepted

Solution code:

a,v=map(int, input().split())

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

Submission status: Accepted

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

if w > v:
  print('NO')
  exit()

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

print('NO')

Submission status: Accepted

Solution code:
#from collections import deque,defaultdict
from sys import stdin
input = stdin.readline
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

Solution code:
import sys
from pprint import pprint

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

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

Submission status: Accepted

Solution code:
# B

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

d = abs(a - b)
s = v - w
if s <= 0:
    print("NO")
else:
    s = abs(s)
    if float(d/s) <= t:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

    if av <= bw:
        print("YES")
    else:
        print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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


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

Submission status: Accepted

Solution code:
a0=input().split()
a1=int(a0[0])
v1=int(a0[1])
b0=input().split()
a2=int(b0[0])
v2=int(b0[1])

t=int(input())

if v2>=v1:
  print("NO")
else:
  shrink=v1-v2
  shr=shrink*t
  d=abs(a1-a2)
  if d>shr:
    print("NO")
  else:
    print("YES")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())

if a<b:
    if a+v*t>=b+w*t:
        yes()
    else:
        no()
if a>b:
    if a-v*t<=b-w*t:
        yes()
    else:
        no()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    #入力
    readline=stdin.readline
    a,v=map(int,readline().split())
    b,w=map(int,readline().split())
    t=int(readline())

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
import math
from copy import deepcopy
import queue
import numpy as np
# sympy as syp(素因数分解とか)
Mod = 1000000007
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1] 
for i in range(2, 10**5 + 1):
    fact.append((fact[-1] * i) % Mod)
    inv.append((-inv[Mod % i] * (Mod // i)) % Mod)
    factinv.append((factinv[-1] * inv[-1]) % Mod)
    
def cmb(n, r, p):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return fact[n] * factinv[r] * factinv[n - r] % p
    
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[y] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main():  #startline-------------------------------------------
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    print("YES" if abs(a-b) <= (v-w)*t else "NO")
if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

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


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


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


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from math import factorial
from collections import Counter
from fractions import Fraction
import heapq, bisect, fractions
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
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()))
MOD = 10**9 + 7

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

Submission status: Accepted

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

distance = abs(A-B)
max_dist = (V-W)*T

if max_dist >= distance:
    ans = "YES"
else:
    ans = "NO"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if w >= v:
    print("NO")
    exit()
dist = abs(a - b)
vel = abs(v - w)
if dist <= t * vel:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,V,B,W,T=map(int, open(0).read().split())
if W==V:
    print("NO")
    exit()
ans=W<V
ans=ans and abs(A-B) <= (V-W)*T
print("YNEOS"[not ans::2])

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if B<A:
    A=-A
    B=-B

D=B-A
U=V-W

if D<=U*T:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    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:
            ans = 'YES'
        else:
            ans = 'NO'
    else:
        if A-V*T <= B-W*T:
            ans = 'YES'
        else:
            ans = 'NO'
    
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

speed = v - w
dist = abs(a - b)
dist1 = speed * t

if dist1 >= dist:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t=int(input())
    sa=abs(a-b)
    vsa=v-w
    if vsa<=0:
        print("NO")
    elif vsa*t<sa:
        print("NO")
    else:
        print("YES")
resolve()

Submission status: Accepted

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
v1 = abs(a - b)
v2 = v - w
if v2 > 0 and v2 * t >= v1: print("YES")
else: print("NO")

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
A,V = LI()
B,W = LI()
T = I()
if V<=W:
    print('NO')
else:
    if (max(A,B)-min(A,B))/(V-W)<=T:
        print('YES')
    else:
        print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, V = map(int, input().split())  # 座標Aにいて，秒速Vメートル
B, W = map(int, input().split())  # 座標Bにいて，秒速Wメートル
T = int(input())

# 右に移動していく場合
if B > A:
    if B + T*W > A + T*V:
        print("NO")
    else:
        print("YES")
else:
    # 左に移動していく場合
    if B - T*W < A - T*V:
        print("NO")
    else:
        print("YES")

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-

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

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

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

Submission status: Accepted

Solution code:
import sys

if sys.subversion[0] == "PyPy":
    import io, atexit

    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()
RS = raw_input
RA = lambda x=int: map(x, RS().split())
RN = lambda x=int: x(RS())


def solve():
    speed = (v- w)
    dist = abs(b - a)
    if speed * t >= dist:
        print("YES")
        return
    else:
        print("NO")
        return




a , v = RA()
b , w = RA()
t = RN()
solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

distance = abs(A-B)
speed = V - W

if speed > 0:
    if distance / speed <= T:
        print("YES")
    else:
        print("NO")
else:
    print("NO")

Submission status: Accepted

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

d = abs(a - b)
u = v - w
if u > 0 and (d+u-1) // u <= t:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

dist = abs(B-A)
spd = V-W
ans = "YES"

if spd*T < dist:
    ans = "NO"

print(ans)

Submission status: Accepted

Solution code:
from math import *

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

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

Submission status: Accepted

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

Submission status: Accepted

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

oni = v * w

tdist = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
x=input()
y=input()
x0=x.split()
a=int(x0[0])
v=int(x0[1])
y0=y.split()
b=int(y0[0])
w=int(y0[1])
t=int(input())
l=abs(a-b)
r=v-w
if r<=0:
    print("NO")
    sys.exit()
if l/r<=t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

f=False
if a == b:
    f=True
elif v - w > 0:
    if abs(b-a) <= (v-w)*t:
        f = True

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