Submission #948214

---

Source Code Expand

#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <time.h>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef long long ll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000001
#define mod 1000000009
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)

int main()
{
    int n;
    long long t[100010],a[100010];
    long long kaku[100010];
    long long ans = 1;
    int flag = 0;
    cin >> n;
    for(int i = 0;i < n;i++){
        kaku[i] = -1;
    }
    for(int i = 0;i < n;i++){
        cin >> t[i];
        if(i == 0){
            kaku[i] = t[i];
        }
    }
    for(int i = 0;i < n;i++){
        cin >> a[i];
        if(i == n - 1){
            kaku[n - 1] = a[i];
        }
    }
    for(int i = 0;i < n; i++){
        if((t[n - 1] != a[0]) || (t[n - 1] < a[n - 1]) || (t[0] > a[0])){
            ans = 0;
            break;
        }
        if(kaku[i] == -1){
            if(t[i] - t[i - 1] != 0 && a[i] - a[i + 1] != 0){
                if(t[i] == a[i])kaku[i] = t[i];
                else ans = 0;
            }else if(t[i] - t[i - 1] != 0 && a[i] - a[i + 1] == 0){
                if(t[i] <= a[i])kaku[i] = t[i];
                else ans = 0;
            }else if(t[i] - t[i - 1] == 0 && a[i] - a[i + 1] != 0){
                if(a[i] <= t[i])kaku[i] = a[i];
                else ans = 0;
            }
        }
    }
    if(ans == 1){
        for(int i = 1;i < n - 1;i++){     
            if(kaku[i] == -1){
                if(t[i] <= a[i]){
                    ans *= t[i];
                }else if(t[i] > a[i]){
                    ans *= a[i];
                }
            }
           ans %= 1000000007; 
        }
        
    }
        
    cout << ans << endl;
}

Submission Info

Judge Result