# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754721 | Stickfish | Cat (info1cup19_cat) | C++17 | 471 ms | 21256 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 <iostream>
#include <cassert>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i)
cin >> p[i], --p[i];
for (int i = 0; i < n; ++i) if (p[i] + p[n - i - 1] != n - 1) {
cout << "-1\n";
return;
}
int e1 = 0;
for (int i = 0; i < n / 2; ++i)
e1 += p[i] >= n / 2;
if (e1 % 2) {
cout << "-1\n";
return;
}
vector<int> rp(n);
for (int i = 0; i < n; ++i)
rp[p[i]] = i;
vector<int> pcp(n / 2);
vector<bool> pcp_leap(n / 2);
for (int i = 0; i < n / 2; ++i) {
if (p[i] < n / 2) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |