提出 #945214

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define all(v) (v).begin(),(v).end()
#define endl '\n'
#define int long long
const int INF = (1 << 30);
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
    bool hcao[(int)1e5+5] = {};
    bool hctk[(int)1e5+5] = {};
    bool hc[(int)1e5+5] = {};
void solve(){
    int n;
    cin >> n;
    vi tk(n), ao(n), hoge(n);

    REP(i,n){
        cin >> tk[i];
        if(i && tk[i] != tk[i-1]) hctk[i] = true;
    }
    REP(i,n){
        cin >> ao[i];
        if(i && ao[i] != ao[i-1]){
            hcao[i] = true;
        }
    }
    hcao[0]=hcao[n]=hctk[0]=hctk[n]=true;
    REP(i,n){
        hoge[i] = min(tk[i], ao[i]);
        if(i && hoge[i] != hoge[i-1]){
            hc[i] = true;
        }
    }
    int ans = 1;
    REP(i,n){
        if(hctk[i] && hcao[i+1]){
            if(tk[i] != ao[i]){
                cout << 0 << endl;
                return;
            }
        }
        else if(hctk[i] && !hcao[i+1]){
            if(tk[i] > ao[i]){
                cout << 0 << endl;
                return;
            }
        }
        else if(!hctk[i] && hcao[i+1]){
            if(tk[i] < ao[i]){
                cout << 0 << endl;
                return;
            }
        }
        else{
            ans *= hoge[i];
            ans %= (int)1e9+7;
        }
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    solve();
}

提出情報

ジャッジ結果