Submission #1481853


Source Code Expand

#include <iostream>
#include <algorithm>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
#define MOD 1000000007
using namespace std;
typedef long long ll;

ll N, A[100000], B[100000];

int main(void) {
  cin >> N;
  REP(i, 0, N) cin >> A[i];
  REP(i, 0, N) cin >> B[i];

  ll ma = *max_element(A, A + N);
  ll mb = *max_element(B, B + N);

  if(ma != mb) {
    cout << 0 << endl;
    return 0;
  }

  ll cnt = 0;
  REP(i, 0, N) if(A[i] == ma && B[i] == mb) cnt++;

  if(cnt == 0) {
    cout << 0 << endl;
    return 0;
  }

  ll ans = 1;
  REP(i, 1, N) {
    if(A[i - 1] == A[i]) ans *= A[i], ans %= MOD;
    if(A[i] == ma) break;
  }
  REP(i, 1, N) {
    if(B[N - i] == B[N - i - 1]) ans *= B[N - i - 1], ans %= MOD;
    if(B[N - i - 1] == mb) break;
  }
  REP(i, 0, cnt - 2) ans *= ma, ans %= MOD;

  cout << ans << endl;
}

Submission Info

Submission Time
Task C - Two Alpinists
User kshinya
Language C++14 (GCC 5.4.1)
Score 0
Code Size 882 Byte
Status WA
Exec Time 86 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 4
AC × 20
WA × 1
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
0_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt WA 86 ms 1792 KB
1_009.txt AC 70 ms 1792 KB
1_010.txt AC 75 ms 1792 KB
1_011.txt AC 79 ms 1792 KB
1_012.txt AC 77 ms 1792 KB
1_013.txt AC 79 ms 1792 KB
1_014.txt AC 78 ms 1792 KB
1_015.txt AC 79 ms 1792 KB
1_016.txt AC 77 ms 1792 KB
1_017.txt AC 74 ms 1792 KB
1_018.txt AC 71 ms 1792 KB
1_019.txt AC 63 ms 1792 KB
1_020.txt AC 59 ms 1792 KB