/**
* author: milos
* created: 09.04.2021 10:49:32
**/
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n, int* a) {
set<int> s(a, a + n);
if ((int) s.size() != n) {
return 0;
}
vector<bool> was(n + 1, false);
vector<int> g;
for (int i = 0; i < n; i++) {
if (a[i] > n) {
g.push_back(a[i]);
continue;
}
was[a[i]] = true;
}
sort(g.begin(), g.end());
for (int i = 0; i < (int) g.size(); i++) {
if (g[i] != n + i + 1) {
return 0;
}
}
vector<int> b;
for (int i = 0; i < n; i++) {
if (a[i] <= n) {
b.push_back(a[i]);
}
}
int cnt = 0;
for (int i = 1; i < (int) b.size(); i++) {
if (b[i] < b[i - 1]) {
++cnt;
}
}
return (cnt <= 1 ? 1 : 0);
}
int replacement(int n, int* a, int* ans) {
vector<int> b;
vector<bool> was(n + 1, false);
vector<int> pos;
for (int i = 0; i < n; i++) {
if (a[i] > n) {
b.push_back(i);
} else {
was[a[i]] = true;
}
}
if ((int) b.size() == n) {
return 1;
}
vector<int> val;
for (int i = 1; i <= n; i++) {
if (!was[i]) {
val.push_back(i);
}
}
vector<int> id((int) val.size());
iota(id.begin(), id.end(), 0);
sort(id.begin(), id.end(), [&](int i, int j) {
return b[i] < b[j];
});
for (int i = 0; i < (int) val.size(); i++) {
ans[id[i]] = val[i];
}
return (int) val.size();
}
int countReplacement(int n, int* a) {
return 1;
}
