# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284202 | Bill_00 | 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 <stdlib.h>
#include "gondola.h"
#include <bits/stdc++.h>
#define MOD 1e9+9;
#define ll long long
using namespace std;
long long pow(long long a,int b){
if(b==1) return a;
long long c=1;
if(b%2==1) c=a;
long long d=pow(a,b/2);
return ((d*d)%MOD*c)%MOD;
}
int valid(int n, int a[])
{
int k[250000]={0};
int y[250000]={0},d=0;
for(int i=0;i<n;i++){
k[a[i]]++;
}
for(int i=0;i<n;i++){
if(k[a[i]]>1) return 0;
}
for(int i=0;i<n;i++){
if(a[i]<=n){
if(y[(a[i]-i+n)%n]==0) d++;
y[(a[i]-i+n)%n]++;
}
}
if(d<=1) return 1;
return 0;
}
//----------------------
int replacement(int n, int a[], int replacementSeq[])
{
int y[100000]={0};
for(int i=0;i<n;i++){
if(a[i]<=n){
y[(a[i]-i+n)%n]++;
}
}
int e=0;
for(int i=0;i<n;i++){
e=max(e,y[i]);
}
return n-e;
}
//----------------------
int countReplacement(int n, int a[])
{
int e=0,k[250000]={0};
int y[250000]={0},d=0;
vector<int>v;
for(int i=0;i<n;i++){
k[a[i]]++;
}
v.push_back(n);
for(int i=0;i<n;i++){
if(k[a[i]]>1) return 0;
}
for(int i=0;i<n;i++){
if(a[i]<=n){
e++;
if(y[(a[i]-i+n)%n]==0) d++;
y[(a[i]-i+n)%n]++;
}
else v.push_back(a[i]);
}
if(d>1) return 0;
if(d==1 && e==n) return 1;
sort(v.begin(),v.end());
int e=n-e;
long long ans=1;
for(int i=1;i<v.size();i++){
long long p=v[i]-v[i-1]-1;
if(p==0) continue;
ans=(ans*pow(p,e-i+1))%MOD;
}
return ans;
}