# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1032060 | tolbi | 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 "gondola.h"
int valid(int n, int inputSeq[])
{
map<int,int> mp;
int p = -1;
for (int i = 0; i < n; ++i)
{
if (mp[inputSeq[i]]) return 0;
mp[inputSeq[i]]++;
}
for (int i = 0; i < n; i++){
if (inputseQ[i]<=n){
p=i;
break;
}
}
if (p==-1) return 1;
for (int i = 0; i < n; i++){
if (inputseQ[i]>n) continue;
int step = i-p;
if (i<p) step = n-p+i;
int a = inputSeq[p]-1;
a+=step;
a%=n;
a++;
if (inputseQ[i]!=a) return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
pair<int,int> v[n];
for (int i = 0; i < n; ++i)
{
v[i]={gondolaSeq[i],i};
}
sort(v,v+n);
int cnt = 0;
for (int i = 0; i < v.size(); i++){
if (v[i].first<=n) continue;
while (cnt<v[i].first-n) replacement[cnt++]=v[i].second;
}
return cnt;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}