# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236946 | crossing0ver | 곤돌라 (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;
const int MAXN = 1E5+5;
int n,a[MAXN];
int valid(int n1, int inputSeq[]) {
n = n1;
int pos = -1;
for (int i = 0; i < n; i++) {
a[i] = inputSeq[i];
if (a[i] <= n)
pos = i;
}
if (pos != -1) {
int x = (a[pos] - pos - 1)%n;
if (x <0) x+= n;
int b[MAXN];
for (int i = 0; i < n; i++) {
b[(x + i)%n] = a[i];
}
for (int i = 0;i < n; i++)
a[i] = b[i];
}
set<int> s;
for (int i = 0; i < n; i++) {
if (a[i] < n) {
if (a[i] != i + 1) return 0;
}
s.insert(a[i]);
}
if (s.size() != n) return 0;
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]);
int countReplacement(int n, int inputSeq[]);
/*
main() {
int n;
cin >> n;
int inputseq[n];
for (int i = 0;i < n; i++)
cin >> inputseq[i];
cout << valid(n,inputseq);
}*/