#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
int valid(int n, int inputSeq[])
{
int p=-1;
for(int i=0;i<n;++i)
{
if(inputSeq[i]<=n)
{
p=i;
break;
}
}
if(p==-1)
return(1);
int ch=0,v=inputSeq[p]-1;
for(int i=p-1;i>=0;--i)
{
if(v==0)
v=n;
if(inputSeq[i]<=n&&inputSeq[i]!=v)
{
ch=1;
break;
}
v--;
}
v=inputSeq[p]+1;
for(int i=p+1;i<n;++i)
{
if(v==n+1)
v=1;
if(inputSeq[i]<=n&&inputSeq[i]!=v)
{
ch=1;
break;
}
v++;
}
return(!ch);
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int p=-1;
int x=0,v=n+1,val;
int varr[n],val1=1;
for(int i=0;i<n;++i)
{
if(gondolaSeq[i]<=n)
{
p=i;
break;
}
}
vector<ii> v1;
if(p!=-1)
{
val1=gondolaSeq[p]-1;
varr[p]=gondolaSeq[p];
for(int i=p-1;i>=0;--i)
{
if(val1==0)
val1=n;
varr[i]=val1;
val1--;
}
val1=gondolaSeq[p]+1;
for(int i=p+1;i<n;++i)
{
if(val1>n)
val1=1;
varr[i]=val1;
val1++;
}
}
for(int i=0;i<n;++i)
{
if(p==-1)
val=i+1;
else
{
val=varr[i];
}
if(gondolaSeq[i]>n)
v1.pb(mp(gondolaSeq[i],val));
}
for(int i=0;i<v1.size();++i)
{
replacementSeq[x]=v1[i].S;
x++;
while(v<v1[i].F)
{
replacementSeq[x]=v;
x++;
v++;
}
v++;
}
return(x);
}
int tel(int p,int n)
{
lli b=0,ans=1,a=n;
while((1LL<<b)<=n)
{
if(bit(p,b))
ans=(ans*a)%1000000007;
a=(a*a)*1000000007;
b++;
}
return(ans);
}
int countReplacement(int n, int inputSeq[])
{
int p=-1;
for(int i=0;i<n;++i)
{
if(inputSeq[i]<=n)
{
p=i;
break;
}
}
if(!valid(n,inputSeq))
return(0);
int co=0,ans=1,l=n;
for(int i=0;i<n;++i)
{
if(inputSeq[i]>n)
co++;
}
sort(inputSeq,inputSeq+n);
for(int i=0;i<n;++i)
{
if(inputSeq[i]<=n)
continue;
ans=(ans*tel(max(inputSeq[i]-l-1,1),co))%1000000007;
l=inputSeq[i];
co--;
}
return(ans);
}
int gondolaSequence[100001];
int replacementSequence[250001];
Compilation message
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:101:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<v1.size();++i)
~^~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:149:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if(inputSeq[i]<=n)
^~
gondola.cpp:151:7: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
ans=(ans*tel(max(inputSeq[i]-l-1,1),co))%1000000007;
^~~
gondola.cpp:129:7: warning: variable 'p' set but not used [-Wunused-but-set-variable]
int p=-1;
^
/tmp/ccVESJWF.o:(.bss+0xf4260): multiple definition of `gondolaSequence'
/tmp/cckn76RJ.o:(.bss+0xf4260): first defined here
/tmp/ccVESJWF.o:(.bss+0x0): multiple definition of `replacementSequence'
/tmp/cckn76RJ.o:(.bss+0x0): first defined here
/tmp/ccVESJWF.o: In function `main':
grader.cpp:(.text.startup+0xc3): undefined reference to `countReplacement'
grader.cpp:(.text.startup+0xe2): undefined reference to `valid'
grader.cpp:(.text.startup+0x106): undefined reference to `replacement'
collect2: error: ld returned 1 exit status
