Submission #1698341

---

Source Code Expand

#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
typedef pair<int, int> P;
int T[100000];
int A[100000];
int h1[100000];
int h2[100000];
int c[100000];
int main() {
	int N;
	cin >> N;
	rep(i, N) cin >> T[i];
	rep(i, N) cin >> A[i];
	h1[0] = T[0];
	for (int i = 1; i < N; i++) {
		if (T[i - 1] < T[i]) h1[i] = T[i];
		else c[i] = T[i];
	}
	h2[N - 1] = A[N - 1];
	for (int i = N - 2; i >= 0; i--) {
		if (A[i + 1] < A[i]) h2[i] = A[i];
		else c[i] = min(c[i], A[i]);
	}
	LL ans = 1;
	rep(i, N) {
		if ((h1[i] != 0 && h2[i] != 0 && h1[i] != h2[i]) || (h1[i] != 0 && c[i] < h1[i]) || (h2[i] != 0 && c[i] < h2[i])) {
			cout << 0 << endl;
			return 0;
		}
		if (h1[i] == 0 && h2[i] == 0) (ans *= c[i]) %= MOD;
	}
	cout << ans << endl;
}

Submission Info

Judge Result