제출 #833530

#제출 시각아이디문제언어결과실행 시간메모리
833530vjudge1Exam (eJOI20_exam)C++17
0 / 100
1085 ms1460 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 10;
const int INF = INT_MAX;
const long long LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;


void solv(){
    int n;
    cin >> n;
    int h[n], t[n];
    for(int i = 0; i < n; i++)cin >> h[i];
    for(int i = 0; i < n; i++)cin >> t[i];

    int temp = t[0];
    int ans = 0;
    int nyala[n] = {};
    for(int i = 0; i < n; i++){
        if(h[i] == temp){
            int l = 0, r = n-1;
            for(int j = 0; j < n; j++){
                if(i == j)continue;
                if(h[j] > temp){
                    if(j < i)l = j+1;
                    else{
                        r = j-1;
                        break;
                    }
                }
            }
            // cerr << l << " " << r << endl;
            for(int i = l; i <= r; i++){
                nyala[i] = 1;
            }
        }
    }

    for(int i = 0; i < n; i++){
        if(nyala[i] == 1)ans++;
    }

    cout << ans << endl;
}

int main(){
    int tc = 1;
//    cin >> tc;
    while(tc--)solv();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...