Submission #2252145

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<set>
#define LL long long
LL N;
LL mod = 1000000000 + 7;
LL T[100010];
LL A[100010];
LL ans = 1;
int main() {
	std::cin >> N;
	LL bef = 0;
	for (int i = 1; i <= N; i++) {
		std::cin >> T[i];
	}
	for (int i = 1; i <= N; i++) {
		std::cin >> A[i];
	}
	if (T[1] > A[1] || T[N] < A[N]) {
		std::cout << 0 << std::endl;
		return 0;
	}
	for (int i = 2; i < N; i++) {
		if (T[i] == T[i - 1]) {
			if (A[i] == A[i + 1]) {
				ans *= std::min(T[i], A[i]);
			}
			else {
				if (T[i] < A[i]) {
					std::cout << 0 << std::endl;
					return 0;
				}
			}
		}
		else {
			if (A[i] < T[i]) {
				std::cout << 0 << std::endl;
				return 0;
			}
			if (A[i + 1] != A[i] &&  T[i] != A[i]) {
				std::cout << 0 << std::endl;
				return 0;
			}
		}
		ans %= mod;
	}
	std::cout << ans << std::endl;
	return 0;
}

Submission Info

Judge Result