# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431539 | MilosMilutinovic | 곤돌라 (IOI14_gondola) | C++14 | 0 ms | 0 KiB |
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 A[]) {
int j = -1;
for (int i = 0; i < N; i++)
if (A[i] >= 1 && A[i] <= N) {
j = i;
break;
}
if (j == -1)
return 1;
for (int i = j; i < N; i++) {
if (A[i] >= 1 && A[i] <= N && A[i] != j)
return 0;
j++;
if (j == N + 1)
j = 1;
}
return 1;
}