# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160359 | BlueDiamond | 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;
const int L = 250000 + 7;
int who[L];
int valid(int n, vector <int> a) {
memset(who, -1, sizeof who);
for (int i = 0; i < n; i++) {
a[i]--;
who[a[i]] = i;
}
int i = L - 1;
while (i >= 0) {
if (who[i] == -1) {
i--;
continue;
}
int j = i - 1;
while (j >= 0 && who[j] != -1)
j--;
if (j < 0)
break;
who[j] = who[i];
who[i] = -1;
i = j - 1;
}
for (int i = 0; i < n; i++)
if (who[i] == -1)
return -1;
for (int i = 1; i < n; i++) {
int dist = who[i] - who[i - 1];
if (dist < 0)
dist += n;
if (dist != 1)
return 0;
}
return 1;
}