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<bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n, int a[]) {
	int cnt = 0, mn = n + 1, ind = 0;
	for (int i = 0; i < n; i ++) {
		if ( a[i] <=n) {
			cnt ++;
			if ( mn >= a[i]) {
				mn = a[i];
				ind = i;
			}
		}
	}
	int last = 0;
	for (int j = 0; j < n; j ++) {
		if (a[ind] <= n &&  a[ind] > last) {
			last = a[ind];
			cnt --;
		}
		ind = (ind + 1) % n;
	}
	if ( cnt == 0) 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... |