#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
Normie's Template v2.5
Changes:
Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
a=(a<b)?a:b;
}
template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
a=(a>b)?a:b;
}
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
if (!x) return 1;
ll res=BOW(a,x/2,p);
res*=res;
res%=p;
if (x%2) res*=a;
return res%p;
}
ll INV(ll a, ll p)
{
return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> vec;
int n,m,i,j,k,t,t1,u,v,a,b;
int arr[200001];
int brr[100001];
set<int> lmao;
int main()
{
fio;
cin>>n;
for (i=1;i<=n;i++) cin>>brr[i];
for (i=1;i<=2*n-1;i++) lmao.insert(i);
int g;
for (i=1;i<=n;i++) {
if (i==1) {
arr[i]=brr[i];
lmao.erase(i);
} else if (brr[i]==brr[i-1]) {
g=(*lmao.begin());
arr[2*i-2]=g;
lmao.erase(g);
g=(*(--lmao.end()));
arr[2*i-1]=g;
lmao.erase(g);
} else if (brr[i]>brr[i-1]) {
g=(*(--lmao.end()));
arr[2*i-2]=g;
lmao.erase(g);
if (lmao.find(brr[i])!=lmao.end()) {
arr[2*i-1]=brr[i];
lmao.erase(brr[i]);
}
else {
g=(*(--lmao.end()));
arr[2*i-1]=g;
lmao.erase(g);
}
}
else {
g=(*(lmao.begin()));
arr[2*i-2]=g;
lmao.erase(g);
if (lmao.find(brr[i])!=lmao.end()) {
arr[2*i-1]=brr[i];
lmao.erase(brr[i]);
}
else {
g=(*(lmao.begin()));
arr[2*i-1]=g;
lmao.erase(g);
}
}
}
for (i=1;i<=2*n-1;i++) cout<<arr[i]<<' ';
}
Compilation message
medians.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
23 | #pragma comment(linker, "/stack:200000000")
|
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
204 KB |
Not a permutation |
| 2 |
Incorrect |
1 ms |
204 KB |
Not a permutation |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Incorrect |
1 ms |
204 KB |
Not a permutation |
| 5 |
Incorrect |
0 ms |
204 KB |
Not a permutation |
| 6 |
Incorrect |
0 ms |
204 KB |
Not a permutation |
| 7 |
Incorrect |
1 ms |
204 KB |
Not a permutation |
| 8 |
Incorrect |
1 ms |
204 KB |
Not a permutation |
| 9 |
Incorrect |
0 ms |
204 KB |
Not a permutation |
| 10 |
Incorrect |
0 ms |
204 KB |
Not a permutation |
| 11 |
Incorrect |
1 ms |
332 KB |
Not a permutation |
| 12 |
Incorrect |
1 ms |
332 KB |
Not a permutation |
| 13 |
Incorrect |
1 ms |
332 KB |
Not a permutation |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
460 KB |
Not a permutation |
| 2 |
Incorrect |
3 ms |
716 KB |
Not a permutation |
| 3 |
Incorrect |
8 ms |
1228 KB |
Not a permutation |
| 4 |
Incorrect |
14 ms |
2124 KB |
Not a permutation |
| 5 |
Incorrect |
27 ms |
4008 KB |
Not a permutation |
| 6 |
Incorrect |
66 ms |
7844 KB |
Not a permutation |
| 7 |
Incorrect |
99 ms |
12148 KB |
Not a permutation |
