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;
using ll = long long;
int valid(int n, int a[]) {
    int mn = n + 1;
    int idx = 0;
    for (int i = 0;i < n;i++) {
        if (a[i] <= n) {
            if (a[i] < mn) {
                mn = a[i];
                idx = i;
            }
        }
    }
    if (mn == n + 1) return 1;
    vector<int> v;
    for (int i = 0;i < n;i++) {
        if (a[(i + idx) % n] <= n) {
            v.push_back(a[(i + idx) % n]);
        }
    }
    int m = v.size();
    bool ch1 = 1, ch2 = 1;
    for (int i = 1;i < m;i++) {
        if (v[i - 1] > v[i]) ch1 = 0;
        if (v[i - 1] < v[i]) ch2 = 0;
    }
    return (ch1 || ch2);
}
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... |