#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
/*
* If there is a duplicate, return 0.
* If all numbers are > n, return 1.
* idxMini -> index of minimum number, idxMaxi -> index of maximum number which is <= n.
Check if all numbers which is <= n between idxMini and idxMaxi are increasing.
*/
int valid(int n, int inputSeq[]) {
set<int> uniqGondolas;
int idxMini = -1, idxMaxi = -1;
for (int i = 0; i < n; i++) {
// There is a duplicate
if (uniqGondolas.find(inputSeq[i]) != uniqGondolas.end()) {
return 0;
}
uniqGondolas.insert(inputSeq[i]);
if (inputSeq[i] <= n) {
if (idxMini == -1 || inputSeq[i] < inputSeq[idxMini]) {
idxMini = i;
}
if (idxMaxi == -1 || inputSeq[i] > inputSeq[idxMaxi]) {
idxMaxi = i;
}
}
}
// All numbers are > n.
if (idxMini == -1) {
return 1;
}
int lastGondola = inputSeq[idxMini];
int currentIdx = (idxMini + 1)%n;
do {
if (inputSeq[currentIdx] <= n) {
if (inputSeq[currentIdx] < lastGondola) {
return 0;
}
lastGondola = inputSeq[currentIdx];
}
currentIdx = (currentIdx + 1)%n;
} while (currentIdx != idxMaxi);
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
