| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 362481 | Pety | 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>
using namespace std;
int valid (int n, int inputSeq[]) {
vector<int>f;
f.resize(250002);
for (int i = 0; i < n; i++) {
int next = (i + 1) % n;
if (f[inputSeq[i]])
return 0;
f[inputSeq[i]] = 1;
if (inputSeq[i] <= n && inputSeq[next] <= n) {
if (inputSeq[i] == n && inputSeq[next] != 1)
return 0;
else if (inputSeq[i] < n && inputSeq[next] != inputSeq[i] + 1)
return 0;
}
}
return 1;
}
int replacement (int n, int gondola[], int replacement[]);
int countReplacement (int n, int gondola[]);
/*int main()
{
int aux[] = {10, 4, 3, 11, 12};
cout << valid(5, aux);
return 0;
}*/
