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>
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
const int MAXN = 3000000;
int t, n;
int a[MAXN+1];
int p[MAXN+1];
int cnt;
vector <pii> ans;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> t;
while (t--) {
cin >> n;
bool tf = 1;
for (int i = 1; i <= n; i++)
cin >> a[i], p[a[i]] = i;
ans.clear();
cnt = 0;
for (int i = 1; i <= n/2 && tf; i++) {
if (abs(a[n-i+1] + a[i]) != n+1) tf = 0;
if (a[i] > n/2) {
swap(a[n-i+1], a[i]);
cnt++;
}
}
if (cnt % 2) tf = 0;
if (!tf) {
cout << -1 << "\n";
} else {
cout << 0 << " " << 0 << "\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... |