Submission #7559424

---

Source Code Expand

import bisect
n,m=map(int,input().split())
x,y=map(int,input().split())
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]

start=a[0]
now='a'
ans=0
while True:
    if now=='a':
        arrive=start+x
        now='b'
        idx=bisect.bisect_left(b,arrive)
        if idx >=m:
            break
        start=b[idx]
        ans+=1
    else:
        arrive=start+y
        now='a'
        idx=bisect.bisect_left(a,arrive)
        if idx >=n:
            break
        start=a[idx]
        
print(ans)
    

Submission Info

Judge Result