# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
35514 | sinhriv | medians (balkan11_medians) | C++14 | 179 ms | 14988 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>
using namespace std;
const int N = 200010;
int n;
int a[N];
int b[N];
int d(int x){
if(x < 0) return abs(x);
return n + n - x;
}
int getopp(int x){
return x / abs(x);
}
bool cmp(pair < int, int > x, pair < int, int > y){
if(getopp(x.first) != getopp(y.first)){
return getopp(x.first) < getopp(y.first);
}
return d(x.first) < d(y.first);
}
int main(){
if(fopen("1.inp", "r")){
freopen("1.inp", "r", stdin);
}
set < int > used;
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
scanf("%d", b + i);
}
a[1] = b[1];
used.insert(a[1]);
vector < pair < int, int > > relate;
for(int i = 2; i <= n; ++i){
if(b[i] == b[i - 1]){
relate.emplace_back(b[i - 1], i + i - 1);
relate.emplace_back(-b[i - 1], i + i - 2);
continue;
}
if(used.count(b[i]) == 0){
a[i + i - 1] = b[i];
used.insert(b[i]);
}
else if(b[i] > b[i - 1]){
relate.emplace_back(b[i - 1], i + i - 1);
}
else{
relate.emplace_back(-b[i - 1], i + i - 1);
}
if(b[i] > b[i - 1]){
relate.emplace_back(b[i - 1], i + i - 2);
}
else{
relate.emplace_back(-b[i - 1], i + i - 2);
}
}
set < int > fre;
for(int i = 1; i < n + n; ++i){
if(used.count(i) == 0) fre.insert(i);
}
sort(relate.begin(), relate.end(), cmp);
for(auto p : relate){
if(p.first < 0){
a[p.second] = *fre.begin();
fre.erase(fre.begin());
}
else{
a[p.second] = *fre.rbegin();
fre.erase(a[p.second]);
}
}
for(int i = 1; i < n + n; ++i){
printf("%d ", a[i]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |