#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
typedef int INT;
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
#define int long long
#define MMAX 16384
#define fast_io() ios::sync_with_stdio(false)
#define FOR(i, l, r) for(int i = (l); i < (r); i++)
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef set<int> si;
typedef double ld;
typedef pair<ld, ld> dd;
const ll INF = 1000000000000000000LL;
const int NMAX = 1e5+4;
const int mod = 1e9+7;
const ld eps = 1e-10;
const ld PI = acos(-1);
INT valid(INT n, INT inputSeq[]){
int k = -1;
FOR(i, 0, n) if(inputSeq[i] <= n) {k = i; break;}
if(k == -1) {
sort(inputSeq, inputSeq+n);
FOR(i, 0, n-1) if(inputSeq[i] == inputSeq[i+1]) return false;
return true;
}
int pos = (k-inputSeq[k]+1+n)%n;
rotate(inputSeq, inputSeq+pos, inputSeq+n);
FOR(i, 0, n){
if(inputSeq[i] <= n and inputSeq[i] != i+1) return false;
}
return true;
}
INT replacement(INT n, INT gondolaSeq[], INT replacementSeq[]){
}
INT countReplacement(INT n, INT inputSeq[]){
}
signed main(){
int n;
INT seq[NMAX];
cin >> n;
FOR(i, 0, n) cin >> seq[i];
cout << valid(n, seq) << endl;
fast_io();
}
Compilation message
gondola.cpp: In function 'INT replacement(INT, INT*, INT*)':
gondola.cpp:49:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
gondola.cpp: In function 'INT countReplacement(INT, INT*)':
gondola.cpp:53:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
/tmp/cc3OyNSU.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/ccJ7ZUL2.o:gondola.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
