| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 641992 | Tsiannis | medians (balkan11_medians) | C++17 | 45 ms | 3892 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];
  A[0]=B[0];
  ll mn=1;
  ll mx=2*n-1;
  if (A[0]==1)
    mn=2;
  A[1]=B[1];
  if (B[1]==2)
  mn=3;
  A[2]=mx;
  mx--;
  ll idx=2;
  for (int i=3;i<=2*n-2;i+=2){
    if (B[idx]==B[idx-1])
    {
      A[i]=mn;
      A[i+1]=mx;
      mn++;
      mx--;
    }
    else
    {
      A[i]=B[idx];
      if (B[idx]==mn)
      mn++;
      A[i+1]=mx;
      mx--;
    }
    idx++;
  }
  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... | ||||
