#include "gondola.h"
#include <algorithm>
#define MOD 1000000009
int arr[250001];
int now[250001];
int valid(int n, int inputSeq[])
{
int i,j;
for(i=0;i<n;i++)if(inputSeq[i]<=n)break;
if(i<n)for(j=0;j<n;j++)if(inputSeq[i]<=n&&(inputSeq[j]+i)%n!=(inputSeq[i]+j)%n)return 0;
std::sort(inputSeq,inputSeq+n);
for(i=1;i<n;i++)if(inputSeq[i-1]==inputSeq[i])return 0;
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int i,j;
for(i=1;i<=250000;i++)arr[i]=-1;
for(i=0;i<n;i++)arr[gondolaSeq[i]]=i;
for(i=0;i<n;i++)if(gondolaSeq[i]<=n)break;
for(j=0;j<n;j++)now[j]=i<n?(gondolaSeq[i]+j-i+n-1)%n+1:j+1;
j=0;
for(i=0;i<n;i++)if(gondolaSeq[i]>j)j=gondolaSeq[i];
for(i=n+1;i<=j;i++)
{
replacementSeq[i-n-1]=arr[i]>=0?now[arr[i]]:now[arr[j]];
now[arr[i]>=0?arr[i]:arr[j]]=i;
}
return j-n;
}
int f(int x,int y)
{
if(y==0)return 1;
if(y&1)return 1LL*x*f(x,y-1)%MOD;
x=f(x,y>>1);
return 1LL*y*y%MOD;
}
int countReplacement(int n, int inputSeq[])
{
if(!valid(n,inputSeq))return 0;
int i,r=1;
std::sort(inputSeq,inputSeq+n);
for(i=0;i<n;i++)
{
if(a[i]<=n)continue;
r=1LL*r*f(n-i,inputSeq[i]-std::max(inputSeq[i-1],n)-1)%MOD;
}
return r;
}
Compilation message
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:51:8: error: 'a' was not declared in this scope
