Submission #1455613

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

#define ll long long
#define MOD 1000000007

using namespace std;

ll N;
vector<ll> T;
vector<ll> A;

ll to[100001]={0};
ll hi[100001]={0};

int main(){
  ll inp;
  ll result=0;
  
  T.push_back(0);
  A.push_back(0);//0潰し
  cin >> N;
  for(ll i = 0 ;i<N;i++){
    cin >> inp;
    T.push_back(inp);
  }
  for(ll i =0;i<N;i++){
    cin >> inp;
    A.push_back(inp);
  }

  
  if(T[N]!=A[1]) {
    cout << "0" << endl;
    return 0;
  }

  for(ll i = 2;i<=N;i++){
    if(T[i]!=T[i-1]){
      to[i] = 1;
      hi[i]=T[i];
    }
  }

  for(ll i =2;i<=N;i++){
    if(A[N+1-i]!=A[N+2-i]){
      if(to[N+1-i]!= 0){
	to[N-i+1] = 1;
	hi[N-i+1] = A[N+1-i];
      }
    } 
  }
  
  to[1]=1;hi[1]=T[1];
  to[N] = 1; hi[N] = A[N];

  for(ll i =1;i<=N;i++){
    if((T[i]<hi[i])||(A[i]<hi[i])){
      cout << "0" << endl;
      return 0;
    }
  }

  for(ll i = 1;i<=N;i++){
    if(to[i] == 0){
      to[i] = T[i];
    }
  }
  for(ll i = 1;i<=N;i++){
    if((to[i] == 0)||(to[i]>A[i])) to[i] = A[i];    
  }


  result = 1;
  for(ll i=1;i<=N;i++){
    result*=to[i];
    result %= MOD;
  }
  
  cout << result << endl;


  return 0;
  
}

Submission Info

Judge Result