Submission #1150698

#	Time	Username	Problem	Language	Result	Execution time	Memory
1150698		somefolk	medians (balkan11_medians)	C++20	0 / 100	1096 ms	2736 KiB

medians

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
// #define int long long

const int INF = 2 * 1e5 + 5;
const int MOD = 1e9 + 7;

int median(int n, vector<int> a){
    sort(a.begin(), a.end());
    return a[n/2];
}

vector<int> get(int n, vector<int> a){
    vector<int> b, acpy;
    for(int i = 0; i < n; i+=2){
        acpy.push_back(a[i]);
        b.push_back(median(i, acpy));
        acpy.push_back(a[i+1]);
    }
    return b;
}

void solve(){
    int n;
    cin >> n;
    vector<int> b(n);
    for(int i = 0; i < n; i++){
        cin >> b[i];
    }

    vector<int> perm;
    for(int i = 1; i < 2*n; i++){
        perm.push_back(i);
    }

    do {
        vector<int> ourB = get(2*n-1, perm);
        bool good = true;
        for(int i = 0; i < n; i++){
            if(ourB[i] != b[i]){
                good = false;
                break;
            }
        }

        if(!good) continue;

        for(int i = 0; i < 2*n-1; i++){
            cout << perm[i] << " ";
        }
        cout << endl;
        break;
    } while(next_permutation(perm.begin(), perm.end()));
}

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

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