提出 #947707

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

int N = 1000000007;

int n;

vector<int> t;
vector<int> a;
int ans[100000] = {0};

unsigned long long mainmain(){
    int M = 0;
    cin >> n;
    for (int i = 0;i < n; i++){
        int m;
        cin >> m;
        t.push_back(m);
        M = max(M,m);
        if (i == 0) {
            ans[0] = m;
            continue;
        }
        if(t[i-1] < m){
            ans[i] = m;
        }
    }
    for (int i = 0;i < n; i++){
        int m;
        cin >> m;
        a.push_back(m);
    }
    unsigned long long tans = 1;
    for (int i= 0;i < n; i++){
        if(i == 0){
            if (ans[n-1] != 0 && ans[n-1] != a[n-1]) {tans = 0;break;}
            ans[n-1] = a[n-1];
            continue;
        }
        //if(ans[i-n-1]!=0 && a[i-n-1]<ans[i-n-1]){tans = 0;break;}
        if(a[n-i] < a[n-i-1]){
            if (ans[n-i-1]!=0 && ans[n-i-1] != a[n-i-1]) {tans = 0;break;}
            ans[n-i-1] = a[n-i-1];
        }
    }
    
    
    if (tans == 0)return 0;
    int num = 1;
    int ind = 0;
    for(int i = 0;i<n;i++){
        if(ans[i] == M){
            ind = i;
            break;
        }
        if(ans[i] != 0){
            num = ans[i];
        }else{
            tans *= num;
            tans %= N;
        }
    }
    num = 1;
    for(int i = n-1;i>ind-1;i--){
        if(ans[i] != 0){
            num = ans[i];
        }else{
            tans *= num;
            tans %= N;
        }
    }
    return tans;

}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    unsigned long long an = mainmain();
    cout << an%N << endl;
    return 0;
}

提出情報

ジャッジ結果