#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int val[100005],here[250005],p[250005];
int valid(int n, int inputSeq[])
{
int idx=-1;
for (int i = 0; i < n; ++i){
if(here[inputSeq[i]])return 0;
here[inputSeq[i]]=1;
if(inputSeq[i]<=n)idx=i;
}
if(idx==-1)return 1;
int h=inputSeq[idx];
for (int i = 0; i < n; ++i)
val[(idx+i)%n]=((h-1+i)%n)+1;
for (int i = 0; i < n; ++i)
if(inputSeq[i]<=n && inputSeq[i]!=val[i])return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
memset(here,-1,sizeof here);
int flag=-1;
for (int i = 0; i < n; ++i){
if(gondolaSeq[i]<=n)flag=i;
else here[gondolaSeq[i]]=i;
}
priority_queue<int,vector<int>,greater<int> > pq;
if(flag!=-1){
int g=gondolaSeq[flag];
for (int i = 0; i < n; ++i){
int r=((g-1+i)%n)+1;
if(gondolaSeq[(flag+i)%n]!=r)pq.push(gondolaSeq[(flag+i)%n]),p[gondolaSeq[(flag+i)%n]]=r;
}
}
else{
for (int i = 0; i < n; ++i)
p[gondolaSeq[i]]=i+1,pq.push(gondolaSeq[i]);
}
int h=n+1,idx=0;
while(!pq.empty()){
int f=pq.top();
pq.pop();
replacementSeq[idx++]=p[f];
while(h<f)replacementSeq[idx++]=h++;
h++;
}
return idx;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
