# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
958383 | AndreiBOTO | medians (balkan11_medians) | C++14 | 19 ms | 3672 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>
#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
///#include <tryhardmode>
///#include <GODMODE::ON>
using namespace std;
const int NMAX=2e5+5;
bool viz[NMAX];
int a[NMAX];
int b[NMAX];
int st,dr;
void go_left()
{
while(viz[st])
st++;
return ;
}
void go_right()
{
while(viz[dr])
dr--;
return ;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,i;
cin>>n;
st=1,dr=2*n-1;
for(i=1;i<=n;i++)
cin>>b[i];
a[1]=b[1];
viz[b[1]]=true;
for(i=2;i<=n;i++)
{
if(b[i]==b[i-1])
{
go_left();
a[2*(i-1)]=st;
viz[st]=true;
go_right();
a[2*(i-1)+1]=dr;
viz[dr]=true;
}
else if(b[i]>b[i-1])
{
if(!viz[b[i]])
{
a[2*(i-1)]=b[i];
viz[b[i]]=true;
go_right();
a[2*(i-1)+1]=dr;
viz[dr]=true;
}
else
{
go_right();
a[2*(i-1)]=dr;
viz[dr]=true;
go_right();
a[2*(i-1)+1]=dr;
viz[dr]=true;
}
}
else if(b[i]<b[i-1])
{
if(!viz[b[i]])
{
a[2*(i-1)]=b[i];
viz[b[i]]=true;
go_left();
a[2*(i-1)+1]=st;
viz[st]=true;
}
else
{
go_left();
a[2*(i-1)]=st;
viz[st]=true;
go_left();
a[2*(i-1)+1]=st;
viz[st]=true;
}
}
}
for(i=1;i<=2*n-1;i++)
cout<<a[i]<<" ";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |