# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
194168 | juanmartinez111 | 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<bits/stdc++.h>
#include "gondola.h"
int valid(int n, int inputSeq[])
{
vector<int>ans;
int ini=0,fin=0;
bool si=true;
for(int i=0;i<n;i++){
if(inputSeq[i]==n)fin=i;
if(inputSeq[i]==1)ini=i;
int cnt=1;
ans;
while(ini!=fin){
ans.push_back(inputSeq[ini]);
ini=(ini+1)%n;
cnt++;
}
ans.push_back(inputSeq[fin]);
for(int i=0;i<n;i++){
if(ans[i]!=i+1)si=false;
}
}
return si;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}