#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int arr[])
{
vector <int> v;
long long mn=1e18,idx=0;
for(int i=0;i<n;i++){
if(arr[i]<mn){
mn=arr[i];
idx=i;
}
}
//cout<<mn<<endl;
for(int i=idx;i<idx+n;i++){
if(arr[i%n]>n) continue;
v.push_back(arr[i%n]);
}
for(int i=1;i<v.size();i++){
if(v[i]<v[i-1]) return 0;
}
return 1;
}
//----------------------
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... |