#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, x, y, i;
set<int> notused;
cin >> n;
int a[2*n-1], b[n];
for (i=0; i<n; i++)
cin >> b[i];
for (i=1; i<=2*n-1; i++)
notused.insert(i);
a[0]=b[0];
notused.erase(b[0]);
for (i=1; i<n; i++)
{
auto it=notused.lower_bound(b[i]);
if (b[i]==b[i-1])
{
x=*it;
it--;
y=*it;
}
if (b[i]>b[i-1])
{
x=*it;
it++;
y=*it;
}
if (b[i]<b[i-1])
{
if (*it!=b[i])
it--;
x=*it;
it--;
y=*it;
}
a[2*i-1]=x;
notused.erase(x);
a[2*i]=y;
notused.erase(y);
}
for (i=0; i<2*n-1; i++)
cout << a[i] << " ";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
344 KB |
Not a permutation |
2 |
Incorrect |
0 ms |
344 KB |
Not a permutation |
3 |
Incorrect |
0 ms |
360 KB |
Not a permutation |
4 |
Incorrect |
0 ms |
344 KB |
Not a permutation |
5 |
Incorrect |
0 ms |
348 KB |
Not a permutation |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Incorrect |
0 ms |
348 KB |
Not a permutation |
8 |
Incorrect |
0 ms |
600 KB |
Not a permutation |
9 |
Incorrect |
0 ms |
344 KB |
Not a permutation |
10 |
Incorrect |
1 ms |
344 KB |
Not a permutation |
11 |
Incorrect |
1 ms |
344 KB |
Not a permutation |
12 |
Incorrect |
1 ms |
348 KB |
Not a permutation |
13 |
Incorrect |
1 ms |
344 KB |
Not a permutation |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
600 KB |
Not a permutation |
2 |
Incorrect |
4 ms |
856 KB |
Not a permutation |
3 |
Incorrect |
6 ms |
1368 KB |
Not a permutation |
4 |
Incorrect |
12 ms |
2136 KB |
Not a permutation |
5 |
Incorrect |
24 ms |
3920 KB |
Not a permutation |
6 |
Incorrect |
52 ms |
7824 KB |
Not a permutation |
7 |
Incorrect |
85 ms |
12068 KB |
Not a permutation |