제출 #1046261

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1046261		Nickpapadak	Exam (eJOI20_exam)	C++14	0 / 100	3 ms	2652 KiB

exam

#include<bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define INF 1000000010
#define ll long long
ll N, B[MAXN];
ll A[MAXN];
pair<ll,ll> Range[MAXN];

ll solveEQ(){
    ll ans = 0;
    ll 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(ll i =1;i<=N;++i){
        ll 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};
    }
}

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

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

컴파일 시 표준 에러 (stderr) 메시지

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

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