Submission #947611

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <string>
#include <sstream>
#include <iomanip>
#include <functional>


using namespace std;

int main() {

  int n;
  int max=1000000007;
  std::cin >> n;
  vector<int> t(n),a(n);
  vector<int> wid(n,0);
  wid[0]=1;
  wid[n-1]=1;
  for (size_t i = 0; i < n; i++){
    std::cin >> t[i];
    if (i>0) {
      if(t[i]!=t[i-1]){
        wid[i]=1;
      }
      
    }
  }
  for (size_t i = 0; i < n; i++){
    std::cin >> a[i];
    if (i>0) {
      if (a[i]!=a[i-1]) {
        wid[i-1]=1;
      }
    }
  }
  long long sum=1;
  for (size_t i = 0; i < n; i++) {
    if (wid[i]!=1) {
      if (a[i]-t[i]+1>0) {
        wid[i]=a[i]-t[i]+1;
      }else{
        wid[i]=t[i]-a[i]+1;
      }
    }
    if (sum*wid[i]>max) {
      sum=(sum*wid[i])%max;
    }else{
      sum*=wid[i];
    }
  }
  std::cout << sum << std::endl;

  return 0;
}

Submission Info

Judge Result