# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701945 | PCTprobability | Gondola (IOI14_gondola) | C++17 | 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>
#include "gondola.h"
using namespace std;
using ll = long long;
const ll mod = 1000000009;
int valid(int n, int inputSeq[]){
for(int i=0;i<n;i++) inputSeq[i]--;
set<int> s;
for(int i=0;i<n;i++) s.insert(inputSeq[i]);
if(s.size()!=n) return 0;
for(int i=0;i<n;i++){
if(inputSeq[i]<n){
for(int j=0;j<n;j++){
if(inputSeq[(i+j)%n]<n&&inputSeq[(i+j)%n]!=(inputSeq[i]+j)%n) return 0;
}
return 1;
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
for(int i=0;i<n;i++) gondolaSeq[i]--;
int m=0;
for(int i=0;i<n;i++) m=max(m,gondolaSeq[i]);
vector<int> gon(n);
int v=0;
for(int i=0;i<n;i++){
if(gondolaSeq[i]<n){
v=(i-gondolaSeq[i]+n)%n;
}
}
for(int i=0;i<n;i++) gon[(i+v)%n]=i;
vector<int> rev(500000,-1);
for(int i=0;i<n;i++) rev[gondolaSeq[i]]=i;
set<int> idx;
for(int i=0;i<n;i++){
if(gondolaSeq[i]>=n) idx.insert(i);
}
for(int i=n;i<=m;i++){
if(rev[i]==-1){
int id=(*idx.begin());
replacementSeq[i-n]=gon[id]+1;
gon[id]=i;
}
else{
replacementSeq[i-n]=gon[rev[i]]+1;
idx.erase(rev[i]);
gon[rev[i]]=i;
}
}
return m-n+1;
}
int countReplacement(int n, int inputSeq[]){
bool ok=true;
set<int> s;
for(int i=0;i<n;i++) s.insert(inputSeq[i]);
if(s.size()!=n) ok=false;
for(int i=0;i<n;i++){
if(inputSeq[i]<n){
for(int j=0;j<n;j++){
if(inputSeq[(i+j)%n]<n&&inputSeq[(i+j)%n]!=(inputSeq[i]+j)%n) ok=false;
}
break;
}
}
if(!ok) return 0;
int m=0;
for(int i=0;i<n;i++) m=max(m,gondolaSeq[i]);
vector<int> gon(n);
int v=0;
for(int i=0;i<n;i++){
if(gondolaSeq[i]<n){
v=(i-gondolaSeq[i]+n)%n;
}
}
ll ans=1;
for(int i=0;i<n;i++) gon[(i+v)%n]=i;
vector<int> rev(500000,-1);
for(int i=0;i<n;i++) rev[gondolaSeq[i]]=i;
set<int> idx;
for(int i=0;i<n;i++){
if(gondolaSeq[i]>=n) idx.insert(i);
}
for(int i=n;i<=m;i++){
if(rev[i]==-1){
ans*=idx.size();
ans%=mod;
int id=(*idx.begin());
replacementSeq[i-n]=gon[id]+1;
gon[id]=i;
}
else{
replacementSeq[i-n]=gon[rev[i]]+1;
idx.erase(rev[i]);
gon[rev[i]]=i;
}
}
return int(ans);
}