#include "gondola.h" #include <bits/stdc++.h> #define endl "\n" #define yeap cout<<"YES"<<endl #define nope cout<<"NO"<<endl #define ll long long using namespace std; const ll N = 1e6; ll vis[N]; int valid(int n, int inputSeq[]) { ll mn = 300000; ll mx = -1; ll mnind = 0; ll status = 1; for(int i=0; i<n; i++){ ll a = inputSeq[i]; if(a<mn){ mn = a; mnind = i; } mx = max(mx, a); vis[a]++; if(vis[a]>1){ status = -1; } } // cout << mn << " " << mx << " " << mnind << " " << status << endl; if((mx-mn)>=n){ status = -1; } // cout << status << endl; if(status==-1){ return 0; } else { if(mn>=n){ return 1; } else { ll cnt = 0; ll ind = mnind; ll temp = mn; while(cnt<n){ ll temp1 = ind%n; // cout << inputSeq[temp1] << " " << temp << " " << temp1 << " " << status << " " << ind << endl; if(inputSeq[temp1]<=n){ if(inputSeq[temp1]!=temp){ status = -1; // cout << inputSeq[temp1] << " " << temp << " " << temp1 << " " << status << endl; break; } cnt++; ind++; temp++; } } if(status==-1){ return 0; } else { return 1; } } } } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }