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



main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,v = LI()
    b,w = LI()
    t = I()
    if v <= w:
        print("NO")
        return
    s = b-a
    k = v-w
    if s <= t*k:
        print("YES")
    else:
        print("NO")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,v = LI()
    b,w = LI()
    t = I()
    if v <= w:
        print("NO")
        return
    s = v-w
    k = b-a
    if s <= t*k:
        print("YES")
    else:
        print("NO")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,v = LI()
    b,w = LI()
    t = I()
    if v < w:
        print("NO")
        return
    s = v-w
    k = b-a
    if s <= t*k:
        print("YES")
    else:
        print("NO")
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

    if(A<B and V<=W):
        print("NO")
        return

    if(A>B and V>=W):
        print("NO")
        return

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

    if(A<B and V<=W):
        print("NO")
        return

    if(A>B and V>=W):
        print("NO")
        return

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

    if(A<B and V<W):
        print("NO")
        return

    if(A>B and V>W):
        print("NO")
        return

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

    if(A<B and V<W):
        print("NO")
        return

    if(A>B and V>W):
        print("NO")
        return

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

    if(A<B and V<W):
        print("NO")
        return

    if(A>B and V>W):
        print("NO")
        return

    print("YES")

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

resolve()

Submission status: Wrong Answer

Solution code:
import math
import collections
import itertools
import copy

def YesNo(Bool):
    if(Bool):
        print("YES")
    else:
        print("NO")
    return

def resolve():

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

resolve()

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) // (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) // (V - W) <= T:
        print('YES')

Submission status: Wrong Answer

Solution code:
def main():
  xy = [map(int, input().split()) for _ in range(2)]
  x,y = [list(i) for i in zip(*xy)]
  a = int(input())
  
  for j in range(a):
    x[0] = x[0] + y[0]
    x[1] = x[1] + y[1]
    
    
    if x[0] >= x[1]:
      print("YES")
      break
      
    elif j == a-1:
      print("NO")
      break
      
      
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())
A_ = A + V*T
B_ = B + W*T

if (A-B)*(A_-B_) <= 0:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a,v,b,w,t=map(int,open(0).read().split());print('YNEOS'[w>=v or t<-(-abs(a-b)//(w-v))::2])

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a == b:
    print("NO")
    
As = v * t + a
Bs = w * t + b

if As >= Bs:
    print("YES")
elif As < Bs:
    print("NO")

Submission status: Wrong Answer

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

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

if As >= Bs:
    print("YES")
elif As < Bs:
    print("NO")

Submission status: Wrong Answer

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: Wrong Answer

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 a >= b:
        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())

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

if A < B:
    if a >= b:
        print("YES")
    else:
        print("NO")
elif A == B:
    print("NO")
else:
    if b >= a:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

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

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

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

if dv<=0:
    print("NO")

elif d/dv >= 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())

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

if dv<=0:
    print("NO")
elif d%dv !=0 :
    print("NO")
elif d/dv > T-1:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

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

if dv<=0:
    print("NO")
elif d%dv !=0 :
    print("NO")
elif d/dv >= 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())

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a < b:
    if a + v * t >= b + 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:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

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

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

if V == W:
    print('NO')
else:
    t = (B - A) // (V - W)

    print('\n', t)
    print('YES' if t <= T and t > 0 else 'NO')

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

can_catch = 'NO'

for t in range(T):
    A += V
    B += W
    
    if A == B:
        can_catch = 'YES'
        break

print(can_catch)

Submission status: Wrong Answer

Solution code:
# 東京海上日動　プログラミングコンテスト2020: B – Tag
A, V = [int(i) for i in input().split()]
B, W = [int(j) for j in input().split()]
T = int(input())

can_catch = 'NO'

for t in range(1, T + 1):
    A_t = A + V * t
    B_t = B + W * t
    
    if A_t == B_t:
        can_catch = 'YES'

print(can_catch)

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:
  if abs(A-B)%(V-W)==0:
    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())
N = int(input())
if W > V:
  print('No')
else:
  if abs(A-B) <= N*(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())
N = int(input())
if W > V:
  print('No')
else:
  if abs(A-B) <= N*(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())
N = int(input())
if W > V:
  print('No')
else:
  if abs(A-B) <= N*(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 w >= v:
  print("NO")
elif (v - w)*t >=  b - a and (b - a)%(v - w)==0:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if w >= v:
  print("NO")
elif (v - w)*3 >=  b - a:
  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 v <= w:
        print("NO")
        exit()

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

    print("NO")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

    if abs(a - b) % (v - w) == 0:
        if abs(a - b) // (v - w) <= t:
            print("YES")
            exit()

    print("NO")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

def main():
    A, V = ril()
    B, W = ril()
    T = ri()
    print('Yes' if abs(A - B) <= T * (V - W) else 'No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

dis0 = abs(b - a)
dis = v - w
if dis <= 0:
  print('No')
  exit()

d = dis*t
if d < dis0:
  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())

dis0 = b - a
dis = abs(v - w)
if dis <= 0:
  print('No')
  exit()

d = dis*t
if d < dis0:
  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())

dis0 = b - a
dis = v - w
if dis <= 0:
  print('No')
  exit()

d = dis*t
if d < dis0:
  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())

dis0 = b - a
dis = v - w
if dis <= 0:
  print('No')
  exit()

d = dis*t
if d < dis:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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


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

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

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

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if w == v:
    u = (a - b)
else:
    u = (a - b)/(w - v) 
if u <= 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())
ans = 'NO'
if w != v:
    if (a -b)/(w - v) <= t:
        ans = 'YES'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
boy, t1= map(int, input().split())
girl, t2= map(int, input().split())
time = int(input())
s1 = boy + (t1*time)
s2 = girl + (t2*time)
if(s1>=s2):
    print("YES")
elif(s2>s1):
    print("NO")

Submission status: Wrong Answer

Solution code:
boy, t1= map(int, input().split())
girl, t2= map(int, input().split())
time = int(input())
s1 = boy + (t1*time)
s2 = girl + (t2*time)
if(s1>s2):
    print("YES")
elif(s2>s1):
    print("NO")

Submission status: Wrong Answer

Solution code:
boy, t1= map(int, input().split())
girl, t2= map(int, input().split())
time = int(input())
s1 = boy + (t1*time)
s2 = girl + (t2*time)
if(s1>s2):
    print("Yes")
elif(s2>s1):
    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 A+V*T >= B+W*T or A-V*T <= B-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 A+V*T >= B+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')
    exit()

if (B-A)/(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())

current_diff = abs(a - b)

# -方向に逃げるか，+方向に逃げるか
if a < b:
  current_diff += t * (w - v)
else:
  current_diff += t * (v - w)

print("YES" if current_diff < 0 else "NO")

Submission status: Wrong Answer

Solution code:
#! python3
# coding:utf-8

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

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:

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

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

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

Submission status: Wrong Answer

Solution code:
#! python3
# coding:utf-8

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

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