# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638379 | ggoh | 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>
using namespace std;
typedef long long lint;
int valid(int n, int inputSeq[])
{
vector<int>check(n+1);
vector<int>copy)(n);
for(int i=0;i<n;i++)
{
copy[i]=inputSeq[i];
if(inputSeq[i]<=n)check[inputSeq[i]]=i+1;
}
sort(copy,copy+n);
for(int i=0;i<n;i++)if(copy[i]==copy[i+1])return 0;
int c=0,ans=1,pos,t;
for(int i=1;i<=n;i++)
{
if(check[i])
{
if(!c)c=i,pos=check[i];
else
{
t=check[i]-pos;
if(t<=0)t+=n;
if(t!=i-c)ans=0;
}
}
}
return ans;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
int countReplacement(int n, int inputSeq[])
{
return -3;
}