| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 308105 | juggernaut | 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"gondola.h"
#include<bits/stdc++.h>
//#include"grader.cpp"
using namespace std;
typedef long long int ll;
ll mod=1e9+7;
int valid(int n,int a[]){
int i=0,need;
while(i<n&&a[i]>n)i++;
need=a[i];
while(i<n){
if(a[i]<=n&&a[i]!=need)return 0;
if(need==n)need=1;
else need++;
i++;
}
sort(a,a+n);
for(i=1;i<n;i++)if(a[i]==a[i-1])return 0;
return 1;
}
int replacement(int n,int a[],int res[]){
vector<pair<int,int>>b;
int i=0,ind=n,need=1,len=0,x;
while(i<n&&a[i]>n)i++;
if(i!=n)need=a[i]-i;
if(need<1)need+=n;
for(i=0;i<n;i++,need=need%n+1)b.push_back({a[i],need});
sort(b.begin(),b.end());
i=0;
while(i<n){
if(b[i].first<=n){
i++;
continue;
}
res[len++]=b[i].second;
x=++ind;
while(x!=b[i].first){
res[len++]=x;
x=++ind;
}
i++;
}
return len;
}
ll pw(ll a,ll b){
ll res=1;
while(b)
if(b&1){
res=(res*a)%mod;
b--;
}else{
a=(a*a)%mod;
b>>=1ll;
}
return res;
}
int countReplacement(int n,int a[]){
if(!valid(n,a))return 0;
sort(a,a+n);
ll i,res=1;
for(i=0;i<n;i++){
if(a[i]<=n)continue;
res=(res*pw(n-i),a[i]-max(n,(i>0?a[i-1]:0))-1)%mod;
}
if(a[0]<=n)res=(res*n)%mod;
return res;
}