# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794741 | aymanrs | 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>
const int MOD = 1e9+7;
long long binp(long long a, long long n){
long long r = 1;
while(n){
if(n&1) r = r*a%MOD;
a = a*a%MOD;
n>>=1;
}
return r;
}
using namespace std;
int countReplacement(int n, int inputSeq[]){
int p[n+1];
fill(p, p+n+1, -1);
vector<int> a;
a.push_back(n);
for(int i = 0;i < n;i++) {
if(inputSeq[i] <= n) p[inputSeq[i]] = i;
a.push_back(inputSeq[i]);
}
sort(a.begin(), a.end());
for(int i = 1;i <= n;i++){
if(p[i] == -1) continue;
int pr = i == 1 ? n : i-1;
if(p[pr] == -1) continue;
if(p[pr] != (p[i]-1)%n) return 0;
}
long long ans = 1;
for(int i = 1;i < a.size();i++){
ans = ans*binp(int(a.size())-i+1, a[i]-a[i-1]-1)%MOD;
}
return ans;
}