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 "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
int valido = 1, inicio = -1, valor = INT_MAX;
for(int i = 0; i < n; ++i){
if(inputSeq[i] <= n && inputSeq[i] < valor){
inicio = i;
valor = inputSeq[i];
}
}
if(inicio != -1){
valor++;
for(int i = inicio + 1; i < n; ++i){
if(inputSeq[i] <= n && inputSeq[i] != valor){
valido = 0;
}
valor++;
}
for(int i = 0; i < inicio; ++i){
if(inputSeq[i] <= n && inputSeq[i] != valor){
valido = 0;
}
valor++;
}
}
return valido;
}
//----------------------
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... |