Submission #853109

#	Time	Username	Problem	Language	Result	Execution time	Memory
853109		sofijavelkovska	medians (balkan11_medians)	C++17	5 / 100	89 ms	12884 KiB

medians

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

int main()
{
    int n, lb, ub, x, y, i;
    set<int> notused;
    cin >> n;
    int a[2*n-1], b[n];
    for (i=0; i<n; i++)
        cin >> b[i];
    for (i=1; i<=2*n-1; i++)
        notused.insert(i);
    a[0]=b[0];
    notused.erase(b[0]);
    for (i=1; i<n; i++)
    {
        if (i==n-1)
        {
            lb=b[i];
            ub=b[i];
        }
        else
        {
            if (b[i+1]<b[i])
            {
                lb=b[i+1];
                ub=b[i];
            }
            else
            {
                lb=b[i];
                ub=b[i+1];
            }
        }
        if (b[i]==b[i-1])
        {
            auto it=notused.lower_bound(max(b[i], ub));
            x=*it;
            notused.erase(x);
            it=notused.upper_bound(min(b[i], lb));
            it--;
            y=*it;
            notused.erase(y);
        }
        if (b[i]>b[i-1])
        {
            auto it=notused.lower_bound(max(b[i], ub));
            x=*it;
            it++;
            y=*it;
            notused.erase(x);
            notused.erase(y);
        }
        if (b[i]<b[i-1])
        {
            auto it=notused.upper_bound(min(b[i], ub));
            it--;
            x=*it;
            it--;
            y=*it;
            notused.erase(x);
            notused.erase(y);
        }
        a[2*i-1]=x;
        a[2*i]=y;
    }
    for (i=0; i<2*n-1; i++)
        cout << a[i] << " ";

    return 0;
}

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