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[]){
bool works = true;
int idx = 0;
for(int i = 0; i < n; i++){
if(inputSeq[i] <= n){
idx = i;
works = false;
}
}
if(works){
return 1;
}
int a[n];
int val = inputSeq[idx];
for(int i = idx; i < n; i++){
a[i] = val++;
val %= n;
if(val == 0) val = n;
}
for(int i = 0; i < idx; i++){
a[i] = val++;
val %= n;
if(val == 0) val = n;
}
bool works2 = true;
for(int i = 0; i < n; i++){
if(inputSeq[i] <= n){
if(inputSeq[i] != a[i]){
works2 = false;
}
}
}
if(works2){
return 1;
}
return 0;
}
//----------------------
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... |