#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
bool v=true;
int mn=INT_MAX;
int idx=-1;
for(int i=0;i<n;i++){
if(inputSeq[i]>n) continue;
if(mn>inputSeq[i]){
mn=inputSeq[i];
idx=i;
}
}
//cout<<mn <<"\n";
int now;
if(idx!=-1){
now=inputSeq[idx];
for(int i=idx;i<idx+n;i++,now++){
int con=i%n;
if(inputSeq[con]>n) continue;
if(inputSeq[con]!=now){
v=false;
//cout<<con <<" " <<now <<"\n";
}
}
}
return v;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |