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:
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
import itertools
import math
from decimal import *
# read = sys.stdin.buffer.read
# readline = sys.stdin.buffer.readline
# readlines = sys.stdin.buffer.readlines
input = sys.stdin.readline

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

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

Submission status: Wrong Answer

Solution code:
# 2020/06/13
# 東京海上日動　プログラミングコンテスト2020 - B

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

# Calc
if w >= v:
    ans = 'NO'
else:
    if v * t + a >= w * t + b:
        ans = 'YES'
    else:
        ans = 'NO'

# Output
print(ans)

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

Submission status: Wrong Answer

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


if a > b and v > w:
    print("NO")
    exit(0)
elif a < b and v < w:
    print("NO")
    exit(0)


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

else:
    if (w-v) * t >= abs(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())

r=a+t*v
s=b+t*w
if a>b and r>s:
    print('NO')
elif a<b and r>s:
    print('YES')
elif a<b and r<s:
    print('NO')
elif a>b and r<s:
    print('YES')
elif a==b:
    print('YES')
elif r==s:
    print('YES')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(T):
    if (A + V * i) == (B + W * i):
        print("YES")
        exit()

print("NO")

Submission status: Wrong Answer

Solution code:
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
print("YES" if (T*(W-V)) >= (A-B) else "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:
    if (V - W) * T >= abs(A - B):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

t = V - W
if((B-A) / T <= t and (B-A) % 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())
ans = 0

for i in range(0,t):
    if a >= b:
        ans = 1
        break
    else:
        a += v
        b += w

if ans == 1:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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


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

print("NO")

Submission status: Wrong Answer

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

for i in range(t):
    A=a+v*i
    B=b+w*i
    if A==B:
        print('YES')
        sys.exit()
print('NO')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
n = list(map(int,input().split()))
m = list(map(int,input().split()))
k = int(input())

if n[0] + n[1]*k >= m[0] + m[1]*k:
    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 w>=v and abs(b-a)>t*(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())

delta_v = V - W
if delta_v <= 0:
    print('No')
elif (abs(A - B) + delta_v - 1) // delta_v > T:
    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 > 0) and (a != b):
    if abs(a-b) <= (v - w) * t:
        print("Yes")
    else:
        print("No")
    
elif 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 b>a:
    if ((v-w)*t) > (b-a):
        print('YES')
    else:print('NO')
else:
    if ((w-v)*t) > (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+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:
    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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from copy import deepcopy
import random
import time
import os
import sys
import datetime
from functools import lru_cache
from functools import reduce
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
alphabet="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):
    if b:print("yes")
    else:print("no")
def Yn(b):
    if b:print("Yes")
    else:print("No")
def YN(b):
    if b:print("YES")
    else:print("NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(bbool,ret1,ret2):
    if bbool:return ret1
    else:return  ret2
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def pm(x):
    return x//abs(x)
def inputintlist(): 
    return list(map(int,input().split()))
def inputfloatlist(): 
    return list(map(float,input().split()))
def tozero(A):
    ret=[None]*len(A)
    for a in range(len(A)):
        ret[a]=A[a]-1
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])#[cost,x]
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)#x→yが複数ある場合のためにmin()する
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def ruisekiwa(A):
    ret=[0]*(len(A)+1)
    for a in range(len(A)):
        ret[a+1]=ret[a]+A[a]
    return ret
def getmd(x1,y1,x2,y2):
    return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):
    return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def heron(a,b,c):
    s=(a+b+c)/2
    S=s(s-a)(s-b)(a-c)
    S=math.sqrt(S)
    return S
def getAreaOfTriangle(x1,y1,x2,y2,x3,y3):
    a=geted(x1,y1,x2,y2)
    b=geted(x2,y2,x3,y3)
    c=geted(x3,y3,x1,y1)
    return heron(a,b,c)






######################################################################################################



A,V=inputintlist()
B,W=inputintlist()
T=int(input())
f=False
if A==B:
    f=True
else:
    if V>W:
        f=True
    else:
        f=False
YN(f)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

x_diff = abs(B - A)
v_diff = V - W

if v_diff > 0:
    if (x_diff + v_diff - 1)/ v_diff <= T:
        print('YES')
    else:
        print('NO')
else:
    if x_diff == 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 = input()
T = int(t)

d = b - a
dv = v - w

if int(d) <= int(dv) * 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:
    t *= -1
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 (V-W) == 0:
    print("NO")
else:
    if (V-W) > 0:
        if T >= ((B-A)/(V-W)):
            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())

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

Submission status: Wrong Answer

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

if V-W <= 0:
  print("No")
else:
  if ((B-A)/(V-W)) <= T:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
[a,v] = list(map(int, input().split()))
[b,w] = list(map(int, input().split()))
t = int(input())
dis = b-a
reVel = w-v
if v<=w:
    print('No')
else:
    time = dis/reVel
    if time<=t:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
a,v = ma()
b,w = ma()
t = ni()
if w>=v:
    print("NO")
    exit()
d = abs(a-b)
if d + w*t <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())


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

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


if(D / S > T):
    print('NO')
    exit(0)
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
a = [list(map(int, input().split())) for i in range(2)]
s = int(input())
if (a[1][0] - a[0][0]) -(a[0][1] - a[1][1])*s <= 0:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

c = a + (v*t)
d = b + (w*t)

if c >= 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 v <= w:
    print('No')
elif ((a-b)/(v-w))**2 <t**2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def main():

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

    if A == B: return "YES"
    if V <= W: return "NO"
    # else:
    #     if abs(B-A) <= (V-W) * T:
    #         return "YES"
    #     return "No"

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
import math
import itertools
import collections
import bisect
import heapq

def IN(): return int(input())
def sIN(): return input()
def MAP(): return map(int,input().split())
def LMAP(): return list(map(int,input().split()))
def TATE(n): return [input() for i in range(n)]
MOD = 10**9 + 7

a,v = MAP()
b,w = MAP()
t = IN()

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

Submission status: Wrong Answer

Solution code:
def read_input(trans=int):
    return list(map(trans, input().split()))


# 1行
A, V = read_input()
B, W = read_input()
T = int(input())

if W > V:
    print("No")
elif (V-W)*T >= abs(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())
kyo=B-A
sub=V-W
ans=1
for i in range(T):
    ans=kyo-sub
    if ans<=0:
        print("YES")
        break
    kyo=ans
if ans>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 v > w 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())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, V = list(map(int, input().split()))  # 入力のときに N を使う必要はありません
B, W = list(map(int, input().split()))  # 入力のときに N を使う必要はありません
T = int(input())  # 入力のときに N を使う必要はありません

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())
for i in range(T+1):
  if A>B and A-B!=V:
    B-=W
    A-=V
  else:
    B+=W
    A+=V
  if A==B:
    print("YES")
    break
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 T >= (abs(A-B)/(V-W)) >= 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())

a_x = a+v*t
b_x = b + w*t
if a_x > b_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:
in1 = input().split()
in2 = input().split()
in3 = input()

oni = int(in1[0])
onispeed = int(in1[1])

kid = int(in2[0])
kidspeed = int(in2[1])

time = int(in3)

oniend = (onispeed * time) + oni
kidend = (kidspeed * time) + kid

if oniend >= kidend:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
A,v1=map(int,input().split())
B,v2=map(int,input().split())
t=int(input())
if((B>A and v2>=v1) or (A>B and v1>=v2)):
  print("NO")
else:
  d = abs(A-B)/abs(v2-v1)
  if(d<=t):
    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())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

def main():
    if V >= W:
        print("NO")
        return
    
    elif abs(B-A)%abs(V-W)!=0:
        print("NO")
        return
    
    elif abs(B-A)//abs(V-W) <= T:
        print("YES")
    else:
        print("NO")
        



main()

Submission status: Wrong Answer

Solution code:
import sys
import os
import itertools
from collections import deque

def main():
    if os.getenv("ENV")=='LOCAL':
        sys.stdin = open(os.path.dirname(__file__)+'/input.txt', 'r')

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

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print ( "Yes" if A+(V*T) >= B+(W*T) else "No" )

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A, V = map(int, readline().split())
B, W = map(int, readline().split())
T = int(readline())
if W >= V:
  print('NO')
  sys.exit()
else:
  for i in range(1,T+1):
    if (V-W)*i == abs(A-B):
      print('YES')
      sys.exit()
print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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

if a == b:
    print('YES')
    exit()
if b - a > 0:
    if (v - w) * t >= b - a:
        print('YES')
        exit()
    else:
        print('NO')
        exit()
else:
    if (v - w) * t >= a - b:
        print('YES')
        exit()
    else:
        print('NO2')
        exit()

print('NO')

Submission status: Wrong Answer

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

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