Submission #947152

---

Source Code Expand

import math as mt

import operator as op
def ncr(n, r):
    r = min(r, n-r)
    if r == 0: return 1
    numer = reduce(op.mul, xrange(n, n-r, -1))
    denom = reduce(op.mul, xrange(1, r+1))
    return numer//denom

N = input()
T = map(lambda x:int(x), raw_input().split())
A = map(lambda x:int(x), raw_input().split())

check = [False for x in range(N)]
check[0] = True
check[N - 1] = True

ans = N - 2
n = max(T)

for i in range(1, len(T) - 1):
    if T[i - 1] < T[i]:
        global LastT
        LastT = T[i]
        check[i] = True
    if A[i + 1] < A[i]:
        global LastA
        LastA = A[i]
        check[i] = True

if max(T) != max(A):
    print 0
else:
    if (((N % (10 ** 9 + 7) - sum(check) % (10 ** 9 + 7)) % (10 ** 9 + 7)) ** 2) % (10 ** 9 + 7) == 0:
        print 1
    else:
        print (((N % (10 ** 9 + 7) - sum(check) % (10 ** 9 + 7)) % (10 ** 9 + 7)) ** 2) % (10 ** 9 + 7)
    #print ncr((n % (10 ** 9 + 7) - (N % (10 ** 9 + 7) - sum(check) % (10 ** 9 + 7))) % (10 ** 9 + 7), ((N - sum(check)) % (10 ** 9 + 7)))

Submission Info

Judge Result