/*input
5
1 3 3 4 5
*/
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main()
{
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int m[n];
for (int i = 0; i < n; i++)
cin >> m[i];
set<int>nebus;
for (int i = 1; i <= 2 * n - 1; i++)
nebus.insert(i);
for (int i = 0; i < n; i++)
nebus.erase(m[i]);
deque<int>answer;
for (int i = n - 1; i > 0; i--)
{
if (m[i] == m[i - 1])
{
answer.push_front(*nebus.begin());
nebus.erase(nebus.begin());
answer.push_front(*(--nebus.end()));
nebus.erase(--nebus.end());
}
else
{
nebus.insert(m[i]);
if (m[i] > m[i - 1])
{
answer.push_front(*(--nebus.end()));
nebus.erase(--nebus.end());
answer.push_front(*(--nebus.end()));
nebus.erase(--nebus.end());
}
else
{
answer.push_front(*nebus.begin());
nebus.erase(nebus.begin());
answer.push_front(*nebus.begin());
nebus.erase(nebus.begin());
}
}
}
answer.push_front(m[0]);
for (int i : answer)
cout << i << " ";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
2 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
3 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
4 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
5 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
6 |
Correct |
2 ms |
384 KB |
Output is correct |
7 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
9 |
Incorrect |
3 ms |
384 KB |
Not a permutation |
10 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
11 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
12 |
Incorrect |
2 ms |
428 KB |
Not a permutation |
13 |
Incorrect |
2 ms |
384 KB |
Not a permutation |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
640 KB |
Not a permutation |
2 |
Incorrect |
4 ms |
768 KB |
Not a permutation |
3 |
Incorrect |
7 ms |
1280 KB |
Not a permutation |
4 |
Incorrect |
14 ms |
2304 KB |
Not a permutation |
5 |
Incorrect |
28 ms |
4096 KB |
Not a permutation |
6 |
Incorrect |
58 ms |
7800 KB |
Not a permutation |
7 |
Incorrect |
99 ms |
12008 KB |
Not a permutation |