Submission #1964134

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

using ll = long long;
using P = pair<int, int>;

const int INF = 1e9;
const int MOD = 1e9 + 7;

// 4近傍、8近傍
int dx[] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[] = {0, 1, 0, -1, 1, 1, -1, -1};

int main() {
  // 入力
  int N;
  cin >> N;
  ll T[N], A[N];
  for (int i = 0; i < N; i++) cin >> T[i];
  for (int i = 0; i < N; i++) cin >> A[i];

  ll ans = 0;
  if (T[N-1] == A[0] && T[0] <= A[0]) {
    ans = 1;
    for (int i = 1; i < N - 1; i++) {
      if (T[i-1] < T[i]) {
        if (A[i] < T[i]) {
          ans = 0;
          break;
        }
      } else if (A[i] > A[i+1]) {
        if (T[i] < A[i]) {
          ans = 0;
          break;
        }
      } else {
        ans *= min(T[i], A[i]);
        ans %= MOD;
      }
    }
  }

  // 解答
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result