# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
584864 | Mazaalai | Gondola (IOI14_gondola) | C++17 | 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 <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n, int nums[]) {
int mini = 0;
for (int i = 1; i < n; i++)
if (nums[i] < nums[mini]) mini = i;
int st = nums[mini];
vector <int> tmp;
for (int i = 0; i < n; i++) {
int j = (mini + i) % n;
if (nums[j] == st+i) continue;
if (nums[j] > n) tmp.pb(nums[j]);
if (nums[j] <= n) return 0;
}
sort(ALL(tmp));
for (int i = 1; i < tmp.size(); i++)
if (tmp[i] == tmp[i-1]) return 0;
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
return -2;
}
int countReplacement(int n, int inputSeq[]) {
return -3;
}