#include "gondola.h"
#include <bits/stdc++.h>
#include "grader.cpp"
const int N = 1e6+5;
int mark[N], mep[N];
using namespace std;
int valid(int n, int inputSeq[])
{
for(int i=0; i<n; i++)
{
if(mark[inputSeq[i]]) return 0;
else mark[inputSeq[i]] = 1;
}
int j = -1;
for(int i=0; i<n; i++) if(inputSeq[i] > 0 && inputSeq[i] <= n) j = i;
if(j == -1) return 1;
for(int i=0; i<n; i++)
{
int id = (i+j)%n, jd = (i+j+1)%n;
if(inputSeq[jd] > n) inputSeq[jd] = inputSeq[id]%n + 1;
if(inputSeq[jd] != inputSeq[id]%n + 1) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int inputSeq[], int replacementSeq[])
{
memset(mep, 0, sizeof mep);
int j = -1, c = n;
for(int i=0; i<n; i++) if(inputSeq[i] <= n) j = i;
if(j == -1)
{
for(int i=0; i<n; i++) replacementSeq[inputSeq[i]-n-1] = i+1;
return n;
}
for(int i=0; i<n; i++)
{
int id = (i+j) % n, jd = (i+j+1) % n;
if(inputSeq[jd] > n) c = max(c, inputSeq[jd]), mep[inputSeq[jd]] = inputSeq[id]%n + 1, inputSeq[jd] = inputSeq[id]%n + 1;
}
int last = -1;
for(int i=c; i>n; i--)
{
if(mep[i] && last == -1) last = i;
if(!mep[i])
replacementSeq[i-n-1] = replacementSeq[last-n-1], replacementSeq[last-n-1] = i;
else replacementSeq[i-n-1] = mep[i];
}
return c-n;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
Compilation message
/tmp/ccbuTnej.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cchmSvyU.o:gondola.cpp:(.text.startup+0x0): first defined here
/tmp/ccbuTnej.o:(.bss+0xf4260): multiple definition of `gondolaSequence'
/tmp/cchmSvyU.o:(.bss+0x8954a0): first defined here
/tmp/ccbuTnej.o:(.bss+0x0): multiple definition of `replacementSequence'
/tmp/cchmSvyU.o:(.bss+0x7a1240): first defined here
collect2: error: ld returned 1 exit status
