Submission #1477310

---

Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using namespace std;

int main() {
	int n;
	int t[100001], a[100001];
	bool wakaranaiT[100001] = {false};
	bool wakaranaiA[100001] = { false };
	cin >> n;
	int maxt = 0, maxa = 0;
	for (int i = 0; i < n; i++) {
		cin >> t[i];
		if (maxt < t[i]) {
			maxt = t[i];
		}
		else {
			wakaranaiT[i] = true;
		}
	}
	for (int i = 0; i < n; i++)cin >> a[i];
	for (int i = n - 1; i >= 0; i--) {
		if (maxa < a[i]) {
			maxa = a[i];
		}
		else {
			wakaranaiA[i] = true;
		}
	}
	long long ans = 1;
	for (int i = 0; i < n; i++) {	
		if (wakaranaiA[i] && wakaranaiT[i])ans *= (min(t[i],a[i]) % MOD);
	}
	cout << (maxt == maxa ? ans : 0) << endl;
}

Submission Info

Judge Result