Submission #1326757

#	Time	Username	Problem	Language	Result	Execution time	Memory
1326757		vahagng	medians (balkan11_medians)	C++20	80 / 100	1095 ms	10948 KiB

medians

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(unordered_set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 3e5 + 10, M = 2e7 + 10;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

ll binpow(ll a, ll b, ll m) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = (res * a) % m;
        }
        b >>= 1;
        a = (a * a) % m;
    }
    return res;
}

ll n, a[N], ans[N];

void solve(int tc) {
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    set<int>st;
    for (int i = 1; i <= 2 * n - 1; i++) st.insert(i);
    ans[1] = a[1];
    st.erase(a[1]);
    for (int i = 2; i <= n; i++) {
        int sort_mid = a[i];
        int len = 2 * i - 1;
        int c_poqr = 0, c_mec = 0;
        for (int j = 1; j <= 2 * i - 3; j++) {
            if (ans[j] < a[i]) c_poqr++;
            else if(ans[j] > a[i]) c_mec++;
        }
        if (st.find(a[i]) == st.end()) {
            if (c_poqr == c_mec) {
                auto it1 = *st.begin();
                auto it2 = *prev(st.end());
                ans[2 * i - 2] = it1;
                ans[2 * i - 1] = it2;
                st.erase(st.begin());
                st.erase(prev(st.end()));
            }
            else if (c_poqr < c_mec) {
                auto it1 = st.begin();
                ans[2 * i - 2] = *it1;
                st.erase(it1);
                it1 = st.begin();
                ans[2*i - 1] = *it1;
                st.erase(it1);
            }
            else {
                auto it1 = prev(st.end());
                ans[2 * i - 2] = *it1;
                st.erase(it1);
                it1 = prev(st.end());
                ans[2*i - 1] = *it1;
                st.erase(it1);
            }
        }
        else {
            st.erase(a[i]);
            ans[2 * i - 2] = a[i];
            if (c_mec < c_poqr) {
                auto it = prev(st.end());
                ans[2 * i - 1] = *it;
                st.erase(it);
            }
            else {
                auto it = st.begin();
                ans[2 * i - 1] = *it;
                st.erase(it);
            }
        }
    }
    for (int i = 1; i <= 2 * n - 1; i++) {
        cout << ans[i] << ' ';
    }
    cout << endl;
}


void precalc() {

}

int main() {
    // SetIO("teamwork");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

Compilation message (stderr)

medians.cpp: In function 'void SetIO(std::string)':
medians.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
medians.cpp:49:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
medians.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
medians.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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