Submission #1769047

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int n;
typedef long long ll;
ll t[100001];
ll a[100001];
ll dt[100001];
ll da[100001];
const ll mod = 1e9 + 7;

int main() {
  cin >> n;

  ll pre;
  for(int i = 0; i < n; i++) cin >> t[i];
  for(int i = 0; i < n; i++) cin >> a[i];

  if(t[n-1] < a[0]) {
    cout << "0" << endl;
    return 0;
}

  dt[0] = 1;
  da[n-1] = 1;
  for(int i = 1; i < n; i++) {
    if(t[i] == t[i-1]) dt[i] = t[i];
    else {
      dt[i] = 1;
      if(a[i] < t[i]) {
	cout << "0" << endl;
	return 0;
      }
    }
    
  }
  
  for(int i = n-2; i >= 0; i--) {
    if(a[i] == a[i+1]) da[i] = a[i];
    else {
      da[i] = 1;
      if(a[i] > t[i]) {
	cout << "0" << endl;
	return 0;
      }
    }
  }

  ll ans = 1;

  for(int i = 0; i < n; i++) {
    ans = ans * min(dt[i],da[i]) % mod;
    
  }

  cout << ans << endl;
}
  

    

  
  

Submission Info

Judge Result