Submission #1965154

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long

using namespace std;
int main(){
  int n;cin>>n;
  vector<ll>t(n);
  vector<ll>a(n);
  for(int i=0;i<n;i++)
    cin>>t[i];
  for(int i=0;i<n;i++)
    cin>>a[i];
  //reverse(a.begin(),a.end());
  bool flag[n]={};
  flag[0]=true;
  flag[n-1]=true;
  for(int i=1;i<n;i++){
    if(t[i]!=t[i-1])flag[i]=true;
  }
  for(int i=n-2;i>=0;i--){
    if(a[i]!=a[i+1])flag[i]=true;
  }
  const ll MOD=1000000007;
  ll ans=1;
  ll nnn=0;
  for(int i=0;i<n;i++){
    int cnt=0;
    while((i!=n)&&(!flag[i])){
      cnt++;
      i++;
    }
    if(cnt>0){
      ll ans2=1;
      ll num=min(a[i-1],t[i-1]);
      for(int j=0;j<cnt;j++){
	ans=(ans*num)%MOD;
      }
    }
  }
  bool flag2=true;
  for(int i=0;i<n;i++){
    if(a[i]==t[n-1]&&t[i]==t[n-1]){
      flag2=false;
      break;
    }
  }
  if((t[n-1]!=a[0])||flag2){
    cout<<0<<endl;
  }else if(n==1&&a[0]==t[0])
    cout<<1<<endl;
  else
    cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result