# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14214 | comet | medians (balkan11_medians) | C++98 | 179 ms | 11668 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
std::set<int> s,s2;
int main(){
int n,a[100010];
scanf("%d",&n);
for(int i=0;i<n;i++)scanf("%d",&a[i]);
for(int i=1;i<=2*n-1;i++)s.insert(i);
std::set<int>::iterator it,t;
int x,y;
s2.insert(a[0]);
s.erase(a[0]);
printf("%d ",a[0]);
for(int i=1;i<n;i++){
it=s2.find(a[i-1]);
if(*it>a[i]){
t=s.begin();
if(s2.find(a[i])==s2.end()){
s2.insert(a[i]);
x=*t;
s2.insert(*t);
printf("%d %d ",a[i],x);
s.erase(a[i]);
s.erase(x);
}
else{
x=*t;
y=*(++t);
s2.insert(x);
s2.insert(y);
printf("%d %d ",x,y);
s.erase(x);
s.erase(y);
}
}
else if(*it<a[i]){
t=s.end();
t--;
if(s2.find(a[i])==s2.end()){
s2.insert(a[i]);
x=*t;
s2.insert(*t);
printf("%d %d ",a[i],x);
s.erase(a[i]);
s.erase(x);
}
else{
x=*t;
y=*(--t);
s2.insert(x);
s2.insert(y);
printf("%d %d ",x,y);
s.erase(x);
s.erase(y);
}
}
else{
t=s.begin();
x=*t;
t=s.end();
t--;
y=*t;
s2.insert(x);
s2.insert(y);
printf("%d %d ",x,y);
s.erase(x);
s.erase(y);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |