제출 #877410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
877410		amin_2008	중앙값 배열 (balkan11_medians)	C++17	100 / 100	68 ms	12172 KiB

medians

#pragma GCC optimize ("O3")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

// author: amin_2008

#define ios          ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll           long long
#define vi           vector<int>
#define vs           vector<string>
#define vc           vector<char>
#define vl           vector<ll>
#define all(v)       v.begin(), v.end()
#define rall(v)      v.rbegin(), v.rend()
#define pb           push_back
#define bpc          __builtin_popcount
#define pii          pair<int, int>
#define pll          pair<ll, ll>
#define piii         pair<pii, int>
#define vpii         vector<pii>
#define vpll         vector<pll>
#define vvpii        vector<vpii>
#define vvi          vector<vector<int>>
#define vvl          vector<vector<ll>>
#define ins          insert
#define ts           to_string
#define F            first
#define S            second
#define lb           lower_bound
#define ub           upper_bound
#define ld           long double
#define ull          unsigned long long
#define endl         '\n'
//#define int          ll

using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
template<class T> using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll inf = 2e5 * 1e9;
const int mod = 1e9+7;
const int sz = 2e5+5;
const int N = 33;
const int logg = 18;
const int P = 40000005;
const ll M = 8e5+5;

int a[sz];

void solve()
{
    int n;
    cin >> n;
    set<int> s;
    for(int i = 1; i <= n * 2 - 1; i++)
        s.ins(i);
    vi v, a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    v.pb(a.front());
    s.erase(a.front());
    for(int i = 1; i < n; i++)
    {
        if ( a[i] == a[i-1] )
        {
            int mini = *s.begin();
            int maks = *s.rbegin();
            v.pb(mini), v.pb(maks);
            s.erase(mini), s.erase(maks);
            continue;
        }
        if ( a[i] > a[i-1] )
        {
            int maks = *s.rbegin();
            v.pb(maks);
            s.erase(maks);
            if ( s.find(a[i]) != s.end() )
                v.pb(a[i]),
                s.erase(a[i]);
            else
            {
                maks = *s.rbegin();
                v.pb(maks);
                s.erase(maks);
            }
            continue;
        }
        int mini = *s.begin();
        v.pb(mini);
        s.erase(mini);
        if ( s.find(a[i]) != s.end() )
            v.pb(a[i]),
            s.erase(a[i]);
        else
        {
            mini = *s.begin();
            v.pb(mini);
            s.erase(mini);
        }
    }
    for(auto i : v)
        cout << i << ' ';
}

signed main()
{
    ios;
    //precompute();
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

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