Submission #1455399

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<random>
#include<unordered_set>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const int big=1e8+10;
const long double pai=3.141592653589793238462643383279;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int gcd(int a,int b){if(a%b==0){return b;}else return gcd(b,a%b);}//a>b
int main(void){
	llint n,i,ans=1;cin>>n;
	vector<int> taka(n+2);
	vector<int> ao(n+2);
	for(i=1;i<=n;i++){cin>>taka[i];}taka.back()=taka[n];
	for(i=1;i<=n;i++){cin>>ao[i];}ao[0]=ao[1];
	if(taka[n]!=ao[1]){cout<<0<<endl;return 0;}
	int mata=0,mao=n+2;
	for(i=1;i<=n;i++){
		if(taka[i-1]<taka[i]){mata=i;}
		if(ao[i]>ao[i+1]&&mao==n+2){mao=i;}
		if(taka[i-1]<taka[i]||ao[i]>ao[i+1]){continue;}
		ans*=min(taka[i],ao[i]);
		ans%=mod;
	}
	if(mao<mata){cout<<0<<endl;return 0;}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result