#include "gondola.h"
#include <algorithm>
using namespace std;
int valid(int n, int inputSeq[])
{
int i;
int s,t;
bool check[250010];
s = -1;
for(i=0; i<n; i++){
if(check[inputSeq[i]]) return 0;
check[inputSeq[i]] = true;
if(inputSeq[i] <= n){
t = i+2-inputSeq[i];
if(t <= 0) t += n;
if(s == -1){
s = t;
}else if(s != t){
return 0;
}
}
}
return 1;
}
//----------------------
struct datar{
int num,value;
}a[100002];
bool cmp(datar x,datar y){
return x.value < y.value;
}
int first[100002];
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int i,j,cnt;
int s,t,big,nnum;
s = -1;
for(i=0; i<n; i++){
if(gondolaSeq[i] <= n){
t = i+2-gondolaSeq[i];
if(t <= 0) t += n;
s = t;
break;
}
}
big = 0;
for(i=0; i<n; i++) big = max(big,gondolaSeq[i]);
if(big == n){
return 0;
}
for(i=n; i>=1; i--) gondolaSeq[i] = gondolaSeq[i-1];
cnt = 0;
if(s == -1) s = 1;
first[s] = 1;
for(i=1; i<n; i++){
t = s+i;
if(t > n) t -= n;
first[t] = i+1;
}
for(i=1; i<=n; i++){
a[i].num = i;
a[i].value = gondolaSeq[i];
}
sort(a+1,a+n+1,cmp);
nnum = n+1;
if(a[1].value > n){
replacementSeq[cnt] = first[a[1].num];
cnt++; nnum++;
for(i=nnum; i<=a[1].value; i++){
replacementSeq[cnt] = nnum-1;
cnt++; nnum++;
}
}
for(i=2; i<=n; i++){
if(a[i].value <= n) continue;
replacementSeq[cnt] = first[a[i].num]; cnt++; nnum++;
for(j=nnum; j<=a[i].value; j++){
replacementSeq[cnt] = nnum-1;
cnt++; nnum++;
}
}
return cnt;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
