# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166958 | 2019-12-05T04:21:48 Z | davitmarg | Gondola (IOI14_gondola) | C++17 | 0 ms | 0 KB |
/*DavitMarg*/ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <set> #include <queue> #include <iomanip> #include <bitset> #include <stack> #include <cassert> #include <iterator> #include <fstream> #define mod 1000000009ll #define LL long long #define LD long double #define MP make_pair #define PB push_back #define all(v) v.begin(), v.end() using namespace std; #ifndef death #include "gondola.h" #endif int valid(int n, int inputSeq[]) { vector<int> a, b; for (int i = 0; i < n; i++) a.PB(inputSeq[i]); b = a; for (int i = 0; i < n; i++) { if (a[i] > n) continue; for (int j = 0; j < n; j++) b[(a[i] - 1 + j) % n] = a[(i + j) % n]; break; } a = b; for (int i = 0; i < n; i++) if (a[i] <= n && i + 1 != a[i]) return 0; return 1; } #ifdef death int main() { int N, A[102]; cin >> N; for (int i = 0; i < N; i++) cin >> A[i]; cout << valid(N, A) << endl; return 0; } #endif /* */