제출 #675675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675675		a_aguilo	Exam (eJOI20_exam)	C++14	12 / 100	76 ms	1100 KiB

exam

#include<bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin >> n;
    int A[n];
    int B[n];
    for(int i = 0; i < n; ++i) cin >> A[i];
    for(int i = 0; i < n; ++i) cin >> B[i];
    queue<int> Q;
    int counter = 0;
    for(int i = 0; i < n; ++i){
        if(A[i] == B[i]) Q.push(i);
    }
    while(!Q.empty()){
        int actPos = Q.front();
        Q.pop();
        if(A[actPos] == B[actPos]) counter++;
        else continue;
        if(actPos > 0){
            if(A[actPos-1] != B[actPos] and A[actPos-1]<A[actPos]){
                A[actPos-1] = B[actPos];
                Q.push(actPos-1);
            }
        }
        if(actPos < (n-1)){
            if(A[actPos+1] != B[actPos] and A[actPos+1]<A[actPos]){
                A[actPos+1] = B[actPos];
                Q.push(actPos+1);
            }
        }
    }
    cout << counter<< endl;
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22