# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1153479 | Ciprian | 중앙값 배열 (balkan11_medians) | C++20 | 2 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
set<int> missing_numbers;
vector<int>A;
void Mex(int n){
for (int i = 1; i <=n; i++)
missing_numbers.insert(i);
for (int x : A) {
missing_numbers.erase(x);
}
}
int mex() {
return *missing_numbers.begin();
}
void update(int new_value) {
missing_numbers.erase(new_value);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
freopen("medians.in", "r", stdin);
freopen("medians.out", "w", stdout);
int n;
cin>>n;
vector<int> a(n+2);
for(int i=1; i<=n; i++)cin>>a[i];
A.push_back(a[1]);
Mex(n);
int mn=2, mx=2*n-1;
set<int> q;
q.insert(a[1]);
for(int i=2; i<=n; i++){
if(q.find(a[i])==q.end()){
A.push_back(a[i]);
A.push_back(mx);
q.insert(a[i]);
q.insert(mx);
update(a[i]);
update(mx);
mx--;
}else{
int m=mex();
A.push_back(m);
A.push_back(mx);
update(m);
update(mx);
mx--;
}
}for(auto e: A){
cout<<e<<" ";
}cout<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |