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;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 1000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define input(n, v) {for(int i = 0;i<n;i++) cin>>v[i];}
#define output(n, v) {for(int i = 0;i<n;i++) cout<<v[i]<<" "; cout<<endl;}
#define single_case solve();
#define line cout<<"------------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); }
const int N = 2e5 + 50;
vector<int> a;
int b[N];
int n;
int c[N];
int l, r;
int main()
{
ios
cin>>n;
for(int i = 1;i<=n;i++) cin>>b[i];
a.pb(b[1]);
c[b[1]]++;
int l = 1;
int r = 2*n-1;
for(int i = 2;i<=n;i++)
{
while(c[l])l++;
while(c[r])r--;
int levo = l-1;
int desno = 2*n-1-r;
if(l>b[i]) levo--;
if(r<b[i]) desno--;
if(!c[b[i]])
{
c[b[i]]++;
while(c[l])l++;
while(c[r])r--;
a.pb(b[i]);
if(levo<desno)
{
a.pb(l);
c[l]++;
}
else
{
a.pb(r);
c[r]++;
}
}
else
{
if(levo<desno)
{
while(c[l])l++;
c[l]++;
a.pb(l);
while(c[l])l++;
c[l]++;
a.pb(l);
}
else if(desno>levo)
{
while(c[r])r--;
c[r]++;
a.pb(r);
while(c[r])r--;
c[r]++;
a.pb(r);
}
else
{
while(c[r])r--;
a.pb(r);
c[r]++;
while(c[l])l++;
a.pb(l);
c[l]++;
}
}
}
for(int x : a) cout<<x<<" ";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |