# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
470096 | dantoh000 | Cat (info1cup19_cat) | C++14 | 400 ms | 16608 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 <bits/stdc++.h>
using namespace std;
int main(){
int t;
scanf("%d",&t);
while (t--){
int n;
scanf("%d",&n);
vector<int> a(n+1,0);
vector<int> vis(n/2+1,0);
for (int i = 1; i <= n; i++){
scanf("%d",&a[i]);
}
bool can = true;
int sw = 0;
int extra = 0;
for (int i = 1; i <= n/2; i++){
if (a[i]+a[n+1-i] != n+1) can = false;
if (a[i] > n/2){
sw++;
a[i] = n+1-a[i];
if (a[i] == i) extra++;
}
}
if (sw % 2 != 0) can = false;
if (!can){
printf("-1\n");
continue;
}
int ans = n/2;
for (int i = 1; i <= n/2; i++){
if (vis[i] == 0){
vis[i] = 1;
ans--;
int cur = a[i];
while (cur != i){
vis[cur] = 1;
cur = a[cur];
}
}
}
if (extra % 2 == 1) extra++;
printf("%d 0\n",ans+extra);
}
}
Compilation message (stderr)
# | 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... |