Submission #1475425

---

Source Code Expand

N = int(input())

T = list(map(int, input().split()))
A = list(map(int, input().split()))


def judge(t):
    if t[0] == t[1]:
        return True
    else:
        return False

if judge(A[0:2]) and A[0] < T[0]:
    ans = 0
    ansable = False
elif not judge(A[0:2]) and A[0] != T[0]:
    ans = 0
    ansable = False
else:
    ans = 1
    ansable = True
    

for i in range(1, N-1):
    if ansable == False:
        break
    
    elif not judge(A[i:i+2]) and not judge(T[i-1:i+1]):
        if A[i] != T[i]:
            ans = 0   
            ansable = False
    elif not judge(A[i:i+2]) and judge(T[i-1:i+1]):
        if A[i] > T[i]:
            ans = 0
            ansable = False
    elif judge(A[i:i+2]) and not judge(T[i-1:i+1]):
        if A[i] < T[i]:
            ans = 0  
            ansable = False
    elif judge(A[i:i+2]) and judge(T[i-1:i+1]):
         ans *= (min(A[i],T[i]))%(10**9+7)
            
print(ans%(10**9+7))

Submission Info

Judge Result