Submission #2867741


Source Code Expand

// finish date: 2018/07/19
#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int (i)=a;(i)<(b);(i)++)
#define rep(i, n)  FOR(i,0,n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<double> vd;
typedef vector<vector<double>> vvd;
typedef vector<vector<vector<double>>> vvvd;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, pair<int, int>> plii;
const int bigmod = 1000000007;
const int INF = 1050000000;
const long long INFll = 100000000000000000;


//足し算
int add(int a, int b) {
    return (int) (((ll) a + b + bigmod) % bigmod);
}

//引き算
int sub(int a, int b) {
    return (int) (((ll) a - b + bigmod) % bigmod);
}

//掛け算
int mul(int a, int b) {
    return (int) (((ll) (a % bigmod) * (b % bigmod)) % bigmod);
}

int main() {
    int N;
    cin >> N;
    vi T(N);
    vi A(N);
    rep(i, N) cin >> T[i];
    rep(i, N) cin >> A[i];
    vi h(N, -1);
    if(N==1 &&A[0] != T[0]){
        cout<<0<<endl;
        return 0;
    }
    h[0] = T[0];
    FOR(i, 1, N) {
        if (T[i] != T[i - 1]) h[i] = T[i];
    }
    h[N - 1] = A[N - 1];
    for (int i = N - 1; i >= 0; i--) {
        if (A[i] < h[i]) {
            cout << 0 << endl;
            return 0;
        }
        if (A[i] != A[i + 1]) {
            if (h[i] != -1 && h[i] != A[i]) {
                cout << 0 << endl;
                return 0;
            } else {
                h[i] = A[i];
                if (h[i] > T[i]) {
                    cout << 0 << endl;
                    return 0;
                }
            }
        }
    }
    int ans = 1;
    rep(i, N) {
        if (h[i] != -1) continue;
        ans = mul(ans, min(T[i], A[i]));
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Submission Time
Task C - Two Alpinists
User TASSAN
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2103 Byte
Status AC
Exec Time 88 ms
Memory 1408 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 21
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 AC 88 ms 1408 KB
1_009.txt AC 71 ms 1408 KB
1_010.txt AC 76 ms 1408 KB
1_011.txt AC 81 ms 1408 KB
1_012.txt AC 77 ms 1408 KB
1_013.txt AC 80 ms 1408 KB
1_014.txt AC 80 ms 1408 KB
1_015.txt AC 81 ms 1408 KB
1_016.txt AC 77 ms 1408 KB
1_017.txt AC 75 ms 1408 KB
1_018.txt AC 72 ms 1408 KB
1_019.txt AC 64 ms 1408 KB
1_020.txt AC 59 ms 1408 KB