# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140159 | ggoh | Gondola (IOI14_gondola) | C11 | 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>
int ch[250005],i;
int valid(int n, int inputSeq[])
{
int ST=-1,st,C=1;
for(i=0;i<n;i++)ch[i]=0;
for(i=0;i<n;i++)
{
if(ch[inputSeq[i]]==1){C=0;break;}
ch[inputSeq[i]]=1;
}
for(i=0;i<n;i++)
{
if(inputSeq[i]<=n)
{
st=i-inputSeq[i]+1;st=(st+n)%n;
if(ST==-1)ST=st;
else if(ST!=st){C=0;break;}
}
}
return C;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
int m=-1,sz=0;
for(i=1;i<=250000;i++)ch[i]=0;
for(i=0;i<n;i++)
{
m=std::max(gondolaSeq[i],m);
ch[gondolaSeq[i]]=1;
}
for(i=1;i<=m;i++)
{
if(ch[i]==0)replacementSeq[sz++]=i;
}
return sz;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}