#include "gondola.h"
#include <bits/stdc++.h>
#include "grader.cpp"
using namespace std;
typedef long long ll;
const int N = 1e6+5, mod = 1e9+9;
int mep[N];
ll power(ll a, ll b)
{
if(!b) return 1;
ll temp = power(a, b/2);
temp = (temp*temp)%mod;
if(b%2) temp *= a, temp %= mod;
return temp;
}
int valid(int n, int inputSeq[])
{
sort(inputSeq, inputSeq+n);
for(int i=0; i<n-1; i++) if(inputSeq[i] == inputSeq[i+1]) return 0;
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++)
{
int id = (i+j) % n, jd = (i+j+1) % n;
c = max(c, inputSeq[jd]), mep[inputSeq[jd]] = i+1;
}
int last = -1;
for(int i=n+1; i<c; i++)
{
if(mep[i]) replacementSeq[i-n-1] = mep[i];
else replacementSeq[i-n-1] = mep[c], last = i;
}
if(last != -1) replacementSeq[c-n-1] = last;
else replacementSeq[c-n-1] = mep[c];
return c-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=n+1; i<c; i++)
{
if(mep[i]) replacementSeq[i-n-1] = mep[i];
else replacementSeq[i-n-1] = mep[c], last = i;
}
if(last != -1) replacementSeq[c-n-1] = last;
else replacementSeq[c-n-1] = mep[c];
return c-n;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
int tmp[n];
for(int i=0; i<n; i++) tmp[i] = inputSeq[i];
if(!valid(n, inputSeq)) return 0;
for(int i=0; i<n; i++) inputSeq[i] = tmp[i];
ll j = -1, c = n;
vector<ll> vec;
for(int i=0; i<n; i++) if(inputSeq[i] <= n) j = i;
else vec.push_back(inputSeq[i]);
ll ans = 1;
vec.push_back(n);
sort(vec.begin(), vec.end());
for(int i=0; i<vec.size()-1; i++)
{
ll tmp = power((ll)vec.size()-i-1, vec[i+1]-vec[i]-1);
ans = (ans%mod * tmp%mod)%mod;
}
return (ans*(j==-1? n:1))%mod;
}
Compilation message
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:43:8: warning: unused variable 'id' [-Wunused-variable]
int id = (i+j) % n, jd = (i+j+1) % n;
^~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:88:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<vec.size()-1; i++)
~^~~~~~~~~~~~~
gondola.cpp:81:13: warning: unused variable 'c' [-Wunused-variable]
ll j = -1, c = n;
^
/tmp/ccGqMDUC.o: In function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'
/tmp/cci63mpe.o:gondola.cpp:(.text.startup+0x0): first defined here
/tmp/ccGqMDUC.o:(.bss+0xf4260): multiple definition of `gondolaSequence'
/tmp/cci63mpe.o:(.bss+0x4c4b80): first defined here
/tmp/ccGqMDUC.o:(.bss+0x0): multiple definition of `replacementSequence'
/tmp/cci63mpe.o:(.bss+0x3d0920): first defined here
collect2: error: ld returned 1 exit status
