#include <bits/stdc++.h>
using ll = long long;
int const nmax = 100000;
int a[1 + nmax], b[1 + 2 * nmax];
bool fr[1 + nmax];
std::set<int> s;
int main() {
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
int n;
std::cin >> n;
for(int i = 1;i <= n; i++) {
std::cin >> a[i];
}
for(int i = 1;i < 2 * n; i++)
s.insert(i);
b[1] = a[1];
fr[a[1]] = 1;
s.erase(a[1]);
for(int i = 2;i <= n; i++) {
if(a[i - 1] < a[i]) {
auto it = s.end();
b[2 * i - 1] = *it;
s.erase(b[2 * i - 1]);
if(fr[a[i]]) {
it = s.end();
b[2 * i - 2] = *it;
} else {
b[2 * i - 2] = a[i];
}
s.erase(b[2 * i - 2]);
fr[b[2 * i - 1]] = true;
fr[b[2 * i - 2]] = true;
} else if(a[i] == a[i - 1]) {
auto it = s.end();
b[2 * i - 1] = *s.begin();
b[2 * i - 2] = *it;
s.erase(b[2 * i - 1]);
s.erase(b[2 * i - 2]);
fr[b[2 * i - 1]] = true;
fr[b[2 * i - 2]] = true;
} else {
auto it = s.begin();
b[2 * i - 1] = *it;
it++;
if(fr[a[i]])
b[2 * i - 2] = *it;
else
b[2 * i - 2] = a[i];
s.erase(b[2 * i - 1]);
s.erase(b[2 * i - 2]);
fr[b[2 * i - 1]] = 1;
fr[b[2 * i - 2]] = 1;
}
}
for(int i = 1;i <= 2 * n - 1; i++)
std::cout << b[i] << " ";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Not a permutation |
2 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
3 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
5 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
6 |
Correct |
0 ms |
340 KB |
Output is correct |
7 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
8 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
9 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
10 |
Incorrect |
0 ms |
340 KB |
Not a permutation |
11 |
Incorrect |
1 ms |
340 KB |
Not a permutation |
12 |
Incorrect |
1 ms |
340 KB |
Not a permutation |
13 |
Incorrect |
1 ms |
340 KB |
Not a permutation |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
468 KB |
Not a permutation |
2 |
Incorrect |
3 ms |
724 KB |
Not a permutation |
3 |
Incorrect |
5 ms |
1236 KB |
Not a permutation |
4 |
Incorrect |
11 ms |
2176 KB |
Not a permutation |
5 |
Incorrect |
22 ms |
4036 KB |
Not a permutation |
6 |
Incorrect |
49 ms |
7964 KB |
Integer 16900353 violates the range [1, 127999] |
7 |
Incorrect |
81 ms |
12164 KB |
Integer 16843009 violates the range [1, 199999] |