제출 #1150709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150709		somefolk	medians (balkan11_medians)	C++20	0 / 100	1096 ms	1216 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 mex(vector<int>& a) {
    unordered_set<int> ck;
    for(auto &i : a){
        ck.insert(i);
    }
    int sol = 0;
    while(ck.find(sol) != ck.end()){
        sol++;
    }
    return sol;
}

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

    int m = 2*n-1;

    vector<int> sol;
    sol.push_back(b[0]);

    int l = mex(sol), r = m;
    int cnt = 0;
    for(int i = 1; i < n; i++){
        if(b[i] == b[i-1]){
            cnt++;
            sol.push_back(l);
            sol.push_back(r);
        } else {
            sol.push_back(b[i]);
            sol.push_back(r);
        }
        l = mex(sol);
        r--;
    }

    for(auto &i : sol){
        cout << i << " ";
    }
    cout << endl;
}

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