# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306788 | vipghn2003 | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int Power(int x,int n)
{
if(!n) return 1;
if(n%2) return 1ll*Power(x,n-1)*x%mod;
int tmp=Power(x,n/2);
return 1ll*tmp*tmp%mod;
}
int countReplacement(int n,int inputSeq[])
{
vector<int>b(n);
for(int i=0;i<n;i++) inputSeq[i]--;
int res=0;
for(int i=0;i<n;i++)
{
int cnt=i;
bool kt=true;
vector<int>cur;
for(int j=0;j<n;j++)
{
if(cnt>=n) cnt=0;
b[j]=cnt;
cnt++;
if(b[j]>inputSeq[j]) kt=false;
else
{
if(inputSeq[j]>(n-1)) cur.push_back(inputSeq[j]-n+1);
}
}
if(!kt) continue;
sort(cur.begin(),cur.end());
int sz=cur.size();
int val=Power(sz,cur[0]-1);
for(int j=1;j<sz;j++)
{
if(cur[j]==cur[j-1])
{
val=0;
break;
}
val=1ll*val*Power(sz-j,cur[j]-cur[j-1]-1)%mod;
}
//cout<<val<<'\n';
res=(res+val)%mod;
}
return res;
}
/*
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
cout<<countReplacement(n,a);
}*/