# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
754572 | Stickfish | Cat (info1cup19_cat) | C++17 | 901 ms | 17064 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 <vector>
using namespace std;
vector<pair<int, int>> sort_ops(vector<int> p) {
int n = p.size();
vector<int> rp(n);
for (int i = 0; i < n; ++i)
rp[p[i]] = i;
vector<pair<int, int>> ans;
for (int t = 0; t < n; ++t) {
if (p[t] == t)
continue;
int i = rp[t];
ans.push_back({t, i});
swap(p[i], p[t]);
rp[p[t]] = t;
rp[p[i]] = i;
}
return ans;
}
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";
# | 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... |