# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247391 | 2020-07-11T10:12:35 Z | Artyom123 | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define fi first #define se second #define all(x) (x).begin(), (x).end() #define pb emplace_back #define ll long long #define ld long double const int INF = 2e9 + 1; const ll INFLL = 1e18 + 1; const int mod = 1e9 + 7; int valid(int n, int InputSeq[]) { vector<int> a(n); set<int> lol; for (int i = 0; i < n; i++) { a[i] = InputSeq[i]; lol.insert(a[i]); } if ((int)lol.size() != n) return 0; int ind = -1; for (int i = 0; i < n; i++) { if (a[i] <= n) ind = i; } if (ind == -1) return 1; int now = a[ind]; for (int i = 0; i < n; i++) { if (a[ind] <= n && a[ind] != now) return 0; ind++; if (ind >= n) ind -= n; now++; if (now > n) now = 1; } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq) { return 0; } int countReplacement(int n, int inputSeq[]) { return 0; } /* int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> a(n); for (auto &c : a) cin >> c; cout << valid(n, a); return 0; } */