# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
642002 | Tsiannis | 중앙값 배열 (balkan11_medians) | C++14 | 48 ms | 5676 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;
typedef long long ll;
#define INF 10000009
int main ()
{
ll n; cin>>n;
ll B[n];
for (int i=0;i<n;i++){
cin>>B[i];
}
ll A[2*n-1];
ll V[2*n-1]={};
A[0]=B[0];
ll mn=1;
ll mx=2*n-1;
if (A[0]==1)
mn=2;
ll idx=1;
for (int i=1;i<=2*n-2;i+=2){
if (B[idx]==B[idx-1])
{
A[i]=mn;
V[A[i]]=1;
A[i+1]=mx;
V[A[i+1]]=1;
}
else
{
A[i]=B[idx];
V[A[i]]=1;
if (A[i]==mx)
A[i+1]=mn;
else
A[i+1]=mx;
V[A[i+1]]=1;
}
idx++;
while(V[mn])
{
mn++;
}
while(V[mx])
{
mx--;
}
}
for (int i=0;i<2*n-1;i++)
cout<<A[i]<<' ';
cout<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |