#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define prev(i) ((i-1+n)%n)
int valid(int n, int a[])
{
int cnt = a[0]-1;
for(int i = 1;i<n-cnt;i++) {
if(a[i] != a[i-1]+1) {
return 0;
}
}
for(int i = n-cnt+1;i<n;i++) {
if(a[i]!=a[i-1]+1)return 0;
}
if(cnt==0)return 1;
if(a[0] != a[n-1]+1)return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int cnt=0;
for(int i = 0;i<n;i++) {
if(gondolaSeq[i]>n)cnt++;
}
if(cnt == 0)return 0;
else if(cnt == n) {
for(int i = 0;i<n;i++) {
replacementSeq[i] = gondolaSeq[i]-n;
}
return n;
}
else {
vector<pair<int,int>> res;
res.push_back(make_pair(n,n));
for(int i = 0;i<n;i++) {
if(gondolaSeq[i] > n and gondolaSeq[prev(i)]<=n) {
int tmp = gondolaSeq[i];
gondolaSeq[i] = (gondolaSeq[prev(i)]%n)+1;
res.push_back(make_pair(tmp, gondolaSeq[i]));
}
}
for(int i = 0;i<n;i++) {
if(gondolaSeq[i] > n and gondolaSeq[prev(i)]<=n) {
int tmp = gondolaSeq[i];
gondolaSeq[i] = (gondolaSeq[prev(i)]%n)+1;
res.push_back(make_pair(tmp, gondolaSeq[i]));
}
}
sort(res.begin(), res.end());
vector<int> ans;
for(int i=1;i<(int)res.size();i++) {
ans.push_back(res[i].second);
for(int j = max(res[i].second, res[i-1].first);j<res[i].first-1;j++) {
ans.push_back(j+1);
}
}
for(int i=0;i<(int)ans.size();i++) {
replacementSeq[i]=ans[i];
}
return (int)ans.size();
}
return 0;
}
int countReplacement(int n, int inputSeq[])
{
return -3;
}
