#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
int INF = 1e9;
int valid(int n, int arr[])
{
set<int> occ;
for(int i = 0; i < n; i++){
if(occ.count(arr[i])){
return 0;
}
occ.insert(arr[i]);
}
pii mpos = {INF,INF};
for(int i = 0; i < n; i++){
mpos = min(mpos,{arr[i],i});
}
int s = mpos.second;
int cnt = 1;
for(int i = 0; i < n; i++){
int p = (s+i)%n;
if(arr[p] < n && p != arr[p]){
return 0;
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -1;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -1;
}
# | 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... |