Submission #2251914

---

Source Code Expand

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

Submission Info

Judge Result