#include "gondola.h"
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair<int, int> pii;
int valid(int n, int inputSeq[])
{
int min_val = 1000000, min_index = -1;
vector<int> L;
for (int i=0; i<n; i++){
L.push_back(inputSeq[i]);
if (min_val > inputSeq[i]){
min_index = i;
min_val = inputSeq[i];
}
}
sort(L.begin(), L.end());
for (int i=1; i<n; i++) {
if (L[i] == L[i-1]) return 0;
}
int mi = -1;
for (int i=0; i<n; i++){
if (L[i] > n && mi == -1) mi = i;
if (mi > -1 && L[i] != n+i-mi+1) return 0;
}
L.clear();
int bi = min_index;
for (int j=1; j<n; j++){
int i = (j + min_index) % n;
if (inputSeq[i] > n) continue;
if (inputSeq[i] < inputSeq[bi]) return 0;
bi = i;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int min_val = 1000000, min_index = -1;
vector<pii> L;
for (int i=0; i<n; i++){
if (min_val > gondolaSeq[i]){
min_index = i;
min_val = gondolaSeq[i];
}
}
bool b = (min_val > n);
for (int j=0; j<n; j++){
int i = min_index + j;
int c;
if (b) c = j;
else{
c = (j + min_val)%n;
}
L.push_back(pii(gondolaSeq[i%n], (c == 0 ? n : c)));
}
sort(L.begin(), L.end());
int l = 0;
for (int i=0; i<n; i++){
while (L[i].first != L[i].second){
replacementSeq[l] = L[i].second;
l++;
L[i].second = n+l;
}
}
return l;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
