제출 #1154188

#제출 시각아이디문제언어결과실행 시간메모리
1154188Ciprian중앙값 배열 (balkan11_medians)C++20
5 / 100
65 ms13504 KiB

#include <bits/stdc++.h>
using namespace std;
#define int long long

set<int> mis;
vector<int>A;
void Mex(int n){
    for (int i = 1; i <=2*n-1; i++)
        mis.insert(i);

    for (int x : A) {
        
        if(mis.find(x)!=mis.end())mis.erase(x);
    }
}

int mex() {
    return *mis.begin();
}

void update(int new_value) {
    
    if(mis.find(new_value)!=mis.end())mis.erase(new_value);
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
   // freopen("medians.in", "r", stdin);
    //freopen("medians.out", "w", stdout);
    
    int n;
    cin>>n;
    vector<int> a(n+2);
    vector<bool>check(2*n+1);
    for(int i=1; i<=n; i++)cin>>a[i];
    A.push_back(a[1]);
    check[a[1]]=true;
    Mex(n);
    
    int mx=2*n-1;
    

    for(int i=2; i<=n; i++){
        if(a[i-1]>a[i]){
            A.push_back(a[i]);
            update(a[i]);
            int m=mex();
            A.push_back(m);
            update(m);
            
        }else if(a[i-1]==a[i]){
            int m=mex();
            A.push_back(m);
            A.push_back(mx);
            update(mx);
            mx--;
        }else{
            A.push_back(a[i]);
            A.push_back(mx);
            update(a[i]);
            update(mx);
            mx--;
        }
    }for(auto e: A){
        cout<<e<<" ";
        
    }cout<<endl;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...