# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209586 | Lukoloz | Gondola (IOI14_gondola) | C++14 | 24 ms | 2164 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>
#include "gondola.h"
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define MAXN 100005
#define NASH 1000000009LL
using namespace std;
ll pow(ll i, ll j){
if (j==0) return 1;
if (j==1) return i;
ll ret=pow(i,j/2);
ret=(ret*ret)%NASH;
if (j%2) ret=(ret*i)%NASH;
return ret;
}
int valid(int n, int inputSeq[]){
bool fl[250005];
int tdif,dif=-1;
for (int i=0; i<250005; i++) fl[i]=0;
for (int i=0; i<n; i++){
if (fl[inputSeq[i]]) return 0;
fl[inputSeq[i]]=1;
if (inputSeq[i]<=n){
tdif=inputSeq[i]-1-i;
if (tdif<0) tdif+=n;
if (dif!=-1 && tdif!=dif) return 0;
dif=tdif;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int dif=0,mx=0,mxi;
for (int i=0; i<n; i++){
if (gondolaSeq[i]>mx){ mx=gondolaSeq[i]; mxi=i; }
if (gondolaSeq[i]<=n){
dif=gondolaSeq[i]-1-i;
if (dif<0) dif+=n;
}
}
for (int i=0; i<mx-n; i++) replacementSeq[i]=0;
for (int i=0; i<n; i++){
if (i==mxi || gondolaSeq[i]<=n) continue;
replacementSeq[gondolaSeq[i]-n-1]=(i+dif)%n+1;
}
mxi=(mxi+dif)%n+1;
for (int i=0; i<mx-n; i++){
if (replacementSeq[i]!=0) continue;
replacementSeq[i]=mxi;
mxi=i+n+1;
}
// for (int i=0; i<mx-n; i++) cout<<replacementSeq[i]<<" "; cout<<endl;
return mx-n;
}
int countReplacement(int n, int inputSeq[]){
if (!valid(n,inputSeq)) return 0;
ll ans=1;
vector <int> v;
v.pb(n);
for (int i=0; i<n; i++) if (inputSeq[i]>n) v.pb(inputSeq[i]);
sort(v.begin(),v.end());
for (int i=1; i<v.size(); i++){
ans=(ans*pow((ll)v.size()-i,(ll)(v[i]-v[i-1]-(ll)(v.size()!=n+1))))%NASH;
}
return (int)ans;
}
// int main(){
// int n;
// cin>>n;
// int arr[n];
// for (int i=0; i<n; i++) cin>>arr[i];
// cout<<countReplacement(n,arr)<<endl;
// }
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |