def sol(s, d, l):
    N = len(s)
    total_cost = 0
    max_station = 0
    
    for i in range(N):
        ride_cost = 1
        ride_cost += 2 * abs(d[i] - s[i])
        total_cost += ride_cost
        max_station = max(max_station, max(s[i], d[i]))
    
    capped_cost = min(total_cost, l[max_station])
    return capped_cost

def solution(A, B):
    N = len(A)
    dp = [[0] * N for _ in range(2)]
    dp[0][0] = A[0]
    dp[1][0] = max(A[0], B[0])
    
    for j in range(1, N):
        dp[0][j] = max(dp[0][j - 1], A[j])
        dp[1][j] = min(max(dp[0][j], B[j]), max(dp[1][j - 1], B[j]))
    
    return dp[1][N - 1]

TECH Mahindra round 1 result