oj.uz

답안 #1046257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046257 2024-08-06T12:14:10 Z Nickpapadak Exam (eJOI20_exam) C++14
0 / 100
 3 ms 604 KB 
#include<bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define INF 1000000010
int N, B[MAXN];
int A[MAXN];
pair<int,int> Range[MAXN];

int solveEQ(){
    int ans = 0;
    int i = 1, j =1;
    bool foundB = false;
    for(;j<=N;++j){
        if(A[j] > B[1]) {
            ans += (j-i) * foundB;           
            i= j+1;
            foundB = false;
        }
        else if(A[j] == B[1]) foundB= true;
    }
    return ans;
}

void setRange(){
    A[0] = INF;
    A[N+1] = INF;
    for(int i =1;i<=N;++i){
        int j =i,k =i;
        while(A[j-1] <= A[i] || A[k+1] <=A[i]){
            if(A[j-1] <= A[i]) --j;
            if(A[k+1] <= A[i]) ++k;
        }
        Range[i] = {j,k};
    }
}

int solveSORT(){
    int ans =0;
    for(int i = 1;i<=N;++i){
        for(int j = Range[i].first; j<=Range[i].second; ++j){
            if(B[j] == A[i]) ans++;
        }
    }
    
    return ans;
}

int main(){
    scanf("%d",&N);
    for(int i=1;i<=N;++i){
        scanf("%d",&A[i]);
    }
    bool AllB = true;
    for(int i =1;i<=N;++i){
        scanf("%d",&B[i]);
        if(B[i] != B[i-1] && i > 1) AllB = false;
    }
    if(AllB)
        printf("%d\n", solveEQ());
    else if(is_sorted(A+1, A+N+1)){
        setRange();
        printf("%d\n", solveSORT());
    }
    
    return 0;
}

Compilation message

exam.cpp: In function 'int main()':
exam.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
exam.cpp:51:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         scanf("%d",&A[i]);
      |         ~~~~~^~~~~~~~~~~~
exam.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         scanf("%d",&B[i]);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 3 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -