Submission #1674672

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define INF (1LL << 31 - 1)
#define MOD int(1e9+7)
#define repi(i,j,n) for(int i = (j); i < (n); ++i)
#define rep(i,n) repi(i,0,n)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()

inline void init() {
    cin.tie(0);
    ios::sync_with_stdio(false);
}

using ll = long long;

ll n, ans = 1;
vector<ll> t, a, mi, tt, aa;

int main() {
  init();
  cin >> n;
  t.resize(n);
  a.resize(n);
  mi.resize(n + 1);
  tt.resize(n);
  aa.resize(n);
  rep(i,n) cin >> t[i];
  rep(i,n) cin >> a[i];

  rep(i,n) mi[i] = min(t[i], a[i]);
  mi[n] = -1;

  tt[0] = mi[0];
  aa[n - 1] = mi[n - 1];

  repi(i,1,n) tt[i] = max(mi[i], tt[i - 1]);
  for (int i = n - 2; i >= 0; --i) aa[i] = max(mi[i], aa[i + 1]);


  if (tt != t or aa != a) {

    cout << 0 << endl;
    return 0;
  }

  int s = 0, pre = -1, cnt = 1;

  for (int i = 1; i < n - 1; ++i) {
    if (mi[i] == pre and mi[i] == mi[i + 1] or mi[i] == pre and mi[i] != mi[i + 1] and t[i] != a[i]) {
      ans = (ans * mi[i]) % MOD;
    }
    if (pre == mi[i]) cnt++;
    else cnt = 1;
    pre = mi[i];
  }

  //if (mi[n - 1] == mi[n - 2] and mi[n - 1] == mi[n - 3]) ans = (ans * mi[n - 1]) % MOD;

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result