| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1198423 | TahirAliyev | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 9;
int valid(int n, int arr[]){
set<int> s;
set<int> s2;
int cnt = 0;
for(int i = 0; i < n; i++){
if(arr[i] <= n) s.insert((arr[i] - i + n) % n);
else cnt++;
s2.insert(arr[i]);
}
#undef long long
if(!(s2.size() == n && s.size() == 1)) return 0;
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int binpow(int a, int b){
a %= MOD;
int res = 1;
while(b){
if(b & 1) res = res * a % MOD;
b /= 2;
a = a * a % MOD;
}
return res;
}
int countReplacement(int n, int arr[]){
if(!valid(n, arr)){
#undef long long
return 0;
}
vector<int> v;
for(int i = 0; i < n; i++){
if(arr[i] > n) v.push_back(arr[i]);
}
sort(v.begin(), v.end());
v.insert(v.begin(), n);
int ans = 1;
for(int i = 1; i < v.size(); i++){
ans = ans * binpow(v.size() - i, v[i] - v[i - 1] - 1) % MOD;
}
if(v.size() - 1 == n) ans = ans * n % MOD;
#undef long long
return ans;
}