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:
def main():
    from sys import setrecursionlimit, stdin, stderr
    from os import environ
    from collections import defaultdict, deque, Counter
    from math import ceil, floor
    from itertools import accumulate, combinations, combinations_with_replacement
    setrecursionlimit(10**6)
    dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
    input = lambda: stdin.readline().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    P = 10**9+7
    INF = 10**18+10

    A,V = LMIIS()
    B,W = LMIIS()
    T = II()

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

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

def main():
    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')
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from scipy.sparse.csgraph import floyd_warshall
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations, combinations_with_replacement
from heapq import heappop, heappush, heapify
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    a,v = inpm()
    b,w = inpm()
    t = inp()
    if w >= v:
        print('NO')
        return
    if abs(a-b)/(v-w) <= t:
        print('YES')
        return
    print('NO')

    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

a, v, b, w, t = map(int, sys.stdin.buffer.read().split())
d = abs(a - b)

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

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)

YES = "YES"  # type: str
NO = "NO"  # type: str

def solve(A: int, V: int, B: int, W: int, T: int):
    d = abs(A - B)
    if V > W and d / (V - W) <= T:
        ret = YES
    else:
        ret = NO
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    V = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    solve(A, V, B, W, T)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


sys.setrecursionlimit(20000000)

MOD = 10 ** 9 + 7
INF = float("inf")


def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    diff = abs(A - B)
    mov = V - W
    if mov <= 0:
        print("NO")
    elif mov * T < diff:
        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 v <= w:
    print("NO")
elif abs(a-b) / abs(v-w) <= t:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())
    if V <= W: print("NO")
    else:
        diff = abs(A - B)
        if (V - W) * T >= diff: print("YES")
        else: print("NO")

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.buffer.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    dist = abs(b - a)
    vel = v - w

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

dif = abs(A-B)

if dif <= (V-W)*T:
    print ("YES")
else:
    print ("NO")

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    a, va = map(int, input().split())
    b, vb = map(int, input().split())
    T = int(input())
    if vb >= va:
        print("NO")
    else:
        if (va - vb) * T >= abs(a - b):
            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 (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 abs(a-b)<=t*(v-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())

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

if V > W and 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())
def gcd(a,b):
  while b:a,b=b,a%b
  return a
aa=a-t*v
ab=a+t*v
ba=b-t*w
bb=b+t*w
if aa<=ba<=bb<=ab:print("YES")
else:print("NO")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 8)

def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]

def main():
    A, V = ZZ()
    B, W = ZZ()
    T = Z()
    print('YES' if abs(A-B) <= T * (V - W) else 'NO')

    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    A,V=MI()
    B,W=MI()
    T=I()
    if abs(A-B)<=T*(V-W):
        print("YES")
    else:
        print("NO")

main()

Submission status: Accepted

Solution code:
import sys
input=lambda: sys.stdin.readline().rstrip()
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if t*(v-w)>=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 abs(a-b) > (v-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())
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())

d = abs(a - b)

aa = v * t
bb = d + w * t
if aa < bb:
    print('NO')
else:
    print('YES')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')
AtoZ = "abcdefghijklmnopqrstuvwxyz"

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
A,V = IL()
B,W = IL()
T = I()

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
#define dd long double

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll a,v;
    cin>>a>>v;
    ll b,w;
    cin>>b>>w;
    ll t;
    cin>>t;
    ll dist=abs(a-b);
    ll vel=v-w;
    if(vel<=0){
        cout<<"No"<<endl;
    }
    else{
        ll time=ceil(dist/vel);
        if(time<=t){
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }

}

Submission status: Runtime Error

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

Submission status: Runtime Error

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




main()

Submission status: Runtime Error

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

if (A < 0 and B < 0) or (A > 0 and B > 0):
    D = max(A, B) - min(A, B)
elif (A > 0 and B < 0) or (A < 0 and B > 0):
    D = max(A, B) + abs(min(A, B))

check = D + (W * T) - (V * T)

if check > 0:
    print('NO')
else:
    print('YES')

Submission status: Runtime Error

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

V *= T
W *= T

if (A < 0 and B < 0) or (A > 0 and B > 0):
    D = max(A, B) - min(A, B)
elif (A > 0 and B < 0) or (A < 0 and B > 0):
    D = max(A, B) + abs(min(A, B))

check = D + W - V

if check > 0:
    print('NO')
else:
    print('YES')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,v,b,w,t=int(input().split())
 
if a<b and b+w*t<=a+v*t:
    print('YES')

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=int(input())
v=int(input())
b=int(input())
w=int(input())
t=int(input())

if a<b:
  if b+wt<=a+vt:
    print('YES')
  else:
    print('NO')
if a>b:
  if a-vt<=b-wt:
    print('YES')
  else:
    print('NO')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if a<b:
  if b+wt<=a+vt:
    print('YES')
  else:
    print('NO')

if a>b:
  if a-vt<=b-wt:
    print('YES')
  else:
    print('NO')

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys

a, v = map(int, inpu().split())
b, w = map(int, inpu().split())
t = int(input())
if (a == b):
  print('YES')
  sys.exit(0)
if (v <= w):
  print('NO')
  sys.exit(0)
res = abs(a - b) / (v - w)
if (res > t):
  print('NO')
else:
  print('YES')
sys.exit(0)

Submission status: Runtime Error

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

for i in range(1, T+1):
    if i *(V-W) >= B-A: print("YES") break
print("NO")

Submission status: Runtime Error

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (B-A)/(W-V) <= T:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

#これO(1)で解けそう。

# スピードが同じ or 逃げる方のスピードが速いと無理
if V == W:
    print("NO")
    sys.exit()
elif W < V:
    print("YES")
    sys.exit()


# 鬼の方がスピードが速い場合で場合訳
distance_AB = abs(A-B)
speed_AB = abs(V-W)

if speed_AB * T < distance_AB:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
if v==w:
    if a==b:
        print("YES")
    else:
        print("NO")
else:
    x = (b-a)/(v-w)
    if x.is_integer == False:
        print("NO")
    else:
        if 1 <= x <= t:
            print("YES")
        else:
            print("NO")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

ans = 'NO'
distance = abs(B-A)

t = distance/(V-W)

if 0 < t <= T:
  ans = 'YES'

print(ans)

Submission status: Runtime Error

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

ans = 'NO'
t = (B-A)/(V-W)

if 0 < t <= T:
  ans = 'YES'

print(ans)

Submission status: Runtime Error

Solution code:
object Main extends App{
  val sc = new java.util.Scanner(System.in)
  var a,v= sc.nextLong()
  var b,w= sc.nextLong()
  var t= sc.nextLong()
  var av = BigInt(a+(v*t))
  var bw = BigInt(b+(w*t))
  if (a < b) {
    print(if (av >= bw) "YES" else "NO")
  }else{
    print(if (a-(v*t) <= (b-(w*t))) "YES" else "NO")
  }
}

Submission status: Runtime Error

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

ct, ca = divmod(b-a, v-w)
if 0<v-w and ca==0 and ct<=t:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
a = int(input("A "))
b = int(input("B "))
v = int(input("V "))
w = int(input("W "))
t = int(input("T "))
if a > b:
    A = a-v*t
    B = b-w*t
    if A <= B:
        print("yes")
    else:
        print("no")

else:
    A = a+v*t
    B = b+w*t
    if A >= B:
        print("yes")

Submission status: Runtime Error

Solution code:
a = int(input("A "))
b = int(input("B "))
v = int(input("V "))
w = int(input("W "))
t = int(input("T "))

if (a-b/v-w) <= 0:
    print("yes")

else:
    print("no")

Submission status: Runtime Error

Solution code:
a = int(input("A "))
b = int(input("B "))
v = int(input("V "))
w = int(input("W "))
t = int(input("T "))

a1 = (v * t) + a
b1 = (w * t) + b

if (b1-a1) <= 0:
    print("yes")

else:
    print("no")

Submission status: Runtime Error

Solution code:
import copy

def main():
    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')

main()

Submission status: Runtime Error

Solution code:
A=input('A')
V=input('V')
B=input('B')
W=input('W')
T=input('T')

A = int(A)
V = int(V)
B = int(B)
W = int(W)
T = int(T)

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

Submission status: Runtime Error

Solution code:
A=int(input('A'))
B=int(input('B'))
V=int(input('V'))
W=int(input('W'))
T=int(input('T'))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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')
elif ans <= 0 and (b - a) % (v - w) != 0:
    print('NO')
else:
    print('YES')

Submission status: Runtime Error

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



T1=d//move_b
T2=(d%move_b)//move_b
if((d%move_b)%move_b!=0):
    print('No')
    sys.exit(0)
if(T2+T1<=T):
    print('yes')
    sys.exit(0)
else:
    print('No')
    sys.exit(0)

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

if distance ==0:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

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

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

if A_gigo>B_gigo:
	print("NO")
else:
	print("YES")

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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

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

Submission status: Runtime Error

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: Runtime Error

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

p=abs(a-b)
u = v-w
if d-u*t<=0:
    print("YES")

else:
    print('NO')

Submission status: Runtime Error

Solution code:
import numpy as np

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

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

else:
    if x >= t:
        print('YES')
    else:
        print('NO')

Submission status: Runtime Error

Solution code:
using System;

namespace myApp {
    class Program {
        static void Main (string[] args) {
            int a, v;
            int b, w;
            int t;
            string[] str = Console.ReadLine ().Split (' ');
            a = int.Parse (str[0]);
            v = int.Parse (str[1]);
            string[] str1 = Console.ReadLine ().Split (' ');
            b = int.Parse (str1[0]);
            w = int.Parse (str1[1]);
            t = int.Parse (Console.ReadLine ());

            if (a <= b) {
                if (a + v * t >= b + t * w) {
                    System.Console.WriteLine ("YES");
                } else {
                    System.Console.WriteLine ("NO");
                }
            } else {
                if (a - v * t <= b - w * t) {
                    System.Console.WriteLine ("YES");
                } else {
                    System.Console.WriteLine ("NO");
                }
            }
        }
    }
}

Submission status: Runtime Error

Solution code:
a_index, a_v = list(map(int, input().split()))
b_index, b_v = list(map(int, input().split()))
t = int(input().split())
 
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: Runtime Error

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = int(input().split())

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: Runtime Error

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = map(int, input().split())
 
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: Runtime Error

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = 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: Runtime Error

Solution code:
a_index, a_v = map(float, input().split())
b_index, b_v = map(float, input().split())
t = 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: Runtime Error

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = 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: Runtime Error

Solution code:
a_index, a_v = map(int, input().split())
b_index, b_v = map(int, input().split())
t = input()
 
d = abs(b_index - a_index)
d_v = abs(b_v - a_v)
t_at = d / a_v
 
if (t_at < t) :
  print("YES")
else :
  print("NO")