Submission #1691606

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
	ll n; cin >> n;
	ll t[n], a[n];
	for(int i = 0; i < n; ++i) cin >> t[i];
	for(int i = 0; i < n; ++i) cin >> a[i];
	vector<pair<ll, bool> > po(n, pair<ll, bool>(1145148931919810, 0));
	ll maxv = t[0];
	po[0] = pair<ll, bool>(t[0], 1);
	for(int i = 1; i < n; ++i){
		if(t[i] > maxv){
			maxv = t[i];
			po[i] = pair<ll, bool>(t[i], 1);
		}else{
			po[i] = pair<ll, bool>(maxv, 0);
		}
	}
	if(po[n - 1].first != a[n - 1] && po[n - 1].second){
		cout << 0 << endl;
		return 0;
	}else{
		po[n - 1] = pair<ll, bool>(a[n - 1], 1);
	}
	maxv = a[n - 1];
	for(int i = n - 2; i >= 0; --i){
		if(a[i] > maxv){
			if(po[i].first != a[i] && po[i].second){
				cout << 0 << endl;
				return 0;
			}
			po[i] = pair<ll, bool>(a[i], 1);
			maxv = a[i];
		}else{
			if(po[i].second && po[i].first > maxv){
				cout << 0 << endl;
				return 0;
			}else{
				if(!po[i].second) po[i].first = min<ll>(po[i].first, a[i]);
			}
		}
	}
	ll ans = 1;
	ll mod = 1e9 + 7;
	for(int i = 0; i < n; ++i){
		if(!po[i].second){
			ans *= po[i].first;
			ans %= mod;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result