Submission #96933

#	Time	Username	Problem	Language	Result	Execution time	Memory
96933		dalgerok	medians (balkan11_medians)	C++14	100 / 100	96 ms	12024 KiB

medians

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


const int N = 2e5 + 5;



int n, a[N];
int L, R;
map < int, bool > used;


inline void Left(){
    while(used.find(L) != used.end()){
        L += 1;
    }
    cout << L << " ";
    used[L] = true;
    L += 1;
}
inline void Right(){
    while(used.find(R) != used.end()){
        R -= 1;
    }
    cout << R << " ";
    used[R] = true;
    R -= 1;
}


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    L = 1;
    R = 2 * n - 1;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    cout << a[1] << " ";
    used[a[1]] = true;
    for(int i = 2; i <= n; i++){
        if(used.find(a[i]) != used.end()){
            if(a[i - 1] > a[i]){
                Left();
                Left();
            }
            else if(a[i - 1] < a[i]){
                Right();
                Right();
            }
            else{
                Left();
                Right();
            }
        }
        else{
            used[a[i]] = true;
            cout << a[i] << " ";
            if(a[i - 1] > a[i]){
                Left();
            }
            else if(a[i - 1] < a[i]){
                Right();
            }
            else{
                assert(false);
            }
        }
    }
}

• Subtask 1: 65 / 65
• Subtask 2: 35 / 35