This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Subtask 1
#ifndef NOTSUBMIT
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#endif // NOTSUBMIT
int valid(int n, int inputSeq[]){
int st = 0;
for (int i = 0; i < n; i++){ if (inputSeq[i] == 1){ st = i; } }
for (int i = 0; i < n; i++){
int p = (i+st) % n;
if (inputSeq[p] != i+1){ return 0; }
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 0; }
int countReplacement(int n, int inputSeq[]){ return 0; }
# | 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... |