Submission #5948276


Source Code Expand

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<algorithm>
#include<cstdio>
#include<iomanip>
#include<queue>
#include<stack>
 
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
 
using namespace std;
 
const int MOD = 1000000007;
 
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
 
    ll N;
    cin >> N;
    vector<ll> T(N), A(N);
    Rep (i, N) {
        cin >> T[i];
    }
    Rep (i, N) {
        cin >> A[i];
    }
 
    vector<ll> ttmp(N), atmp(N), mt(N);
    vector<bool> t(N, false), a(N, false), m(N, false);
 
    ll tmp = 0, ans = 1;
    Rep (i, N) {
        if (T[i] > tmp) {
            ttmp[i] = T[i];
            t[i] = true;
            tmp = T[i];
        } else if (T[i] == tmp) {
            ttmp[i] = T[i];
        }
    }
    tmp = 0;
    for (ll i = N - 1; i >= 0; i--) {
        if (A[i] > tmp) {
            atmp[i] = A[i];
            a[i] = true;
            tmp = A[i];
        } else if (A[i] == tmp) {
            atmp[i] = A[i];
        }
    }
 
    Rep (i, N) {
        if (!t[i] && !a[i]) mt[i] = min(ttmp[i], atmp[i]);
        else if (t[i] && a[i]) {
            if (ttmp[i] == atmp[i]) {
                mt[i] = 1;
            }
            else mt[i] = 0;
        }
        else if (t[i] && !a[i]) {
            if (ttmp[i] <= atmp[i]) {
                mt[i] = 1;
            } else mt[i] = 0;
        } else if (!t[i] && a[i]) {
            if (atmp[i] <= ttmp[i]) mt[i] = 1;
            else mt[i] = 0;
        }
    }
 
    Rep (i, N) {
        ans *= mt[i];
        ans %= MOD;
    }
 
    cout << ans << "\n";
}

Submission Info

Submission Time
Task A - CF
User nazonazokun
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1724 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
WA × 4
WA × 12
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
Case Name Status Exec Time Memory
0_000.txt WA 1 ms 256 KB
0_001.txt WA 1 ms 256 KB
0_002.txt WA 1 ms 256 KB
0_003.txt WA 1 ms 256 KB
1_004.txt WA 1 ms 256 KB
1_005.txt WA 1 ms 256 KB
1_006.txt WA 1 ms 256 KB
1_007.txt WA 1 ms 256 KB
1_008.txt WA 1 ms 256 KB
1_009.txt WA 1 ms 256 KB
1_010.txt WA 1 ms 256 KB
1_011.txt WA 1 ms 256 KB