Submission #1688355

---

Source Code Expand

#include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<int,pii> piii;
signed main()
{
    int n,m; cin>>n;
    vector<int>v(n);
    vector<int>u(n);
    rep(i,n)cin>>v[i];
    rep(i,n)cin>>u[i];
    vector<bool>def(n,false);
    def[0]=def[n-1]=true;
    for(int i=0; i<n;i++){
        if(i==0||i==n-1)continue;
        if(v[i-1]!=v[i])def[i]=true;
        if(v[i-1]>v[i])return puts("0")*0;
    }
    for(int i=n-1; i>0;i--){
        if(i==0||i==n-1)continue;
        if(u[i]!=u[i+1])def[i]=true;
        if(u[i]<u[i-1])return puts("0")*0;
    }
    int ans=1;
    int MOD=INF+7;
    for(int i=0;i<n/2+n%2;i++){
        int ui=(int)u.size()-1-i;
        if(ui!=i){
            if(def[i]==false){
                ans*=v[i];
                ans%=MOD;
            }
            if(def[ui]==false){
                ans*=u[ui];
                ans%=MOD;
            }
        }else {
            if(def[i])continue;
            ans*=min(v[i],u[ui]);
            ans%=MOD;
        }
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result