#include <bits/stdc++.h>
#include "gondola.h"
// #include "grader.cpp"
using namespace std;
using ll = long long;
int valid(int n, int a[]) {
int x = -1;
for (int i = 0; i < n; i++) {
if (a[i] == 1) {
x = i;
break;
}
}
if (x == -1) return 0;
int y = 1;
while (y <= n) {
if (a[x] != y) return 0;
y++; x = (x + 1) % n;
}
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... |