# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
712998 | mdub | Gondola (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 <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int valid(int n, int inputSeq[]) {
for (auto& elem: inputSeq) {
elem--;
}
pair<int, int> smallest = {1e9, -1};
for (int i = 0; i < n; i++) {
if (inputSeq[i] < smallest.first) {
smallest = {inputSeq[i], i};
}
}
set<int> seen;
if (smallest.first >= n) smallest.first = 0;
int next = smallest.first;
for (int i = smallest.second; i < n + smallest.second; i++) {
if (inputSeq[i % n] != next && (seen.count(inputSeq[i % n]) || inputSeq[i % n] < n)) {
return 0;
}
next = (next + 1) % n;
seen.insert(inputSeq[i % n]);
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{ return 0;}
int countReplacement(int n, int inputSeq[])
{return 0;}