oj.uz

Submission #861265

# Submission time Handle Problem Language Result Execution time Memory
861265 2023-10-15T18:23:30 Z Ahmed57 Cat (info1cup19_cat) C++17
0 / 100
 28 ms 436 KB 
#include <bits/stdc++.h>

using namespace std;
int main(){
    int t;cin>>t;
    z:while(t--){
        int n;cin>>n;
        int arr[n+1],pos[n+1];
        for(int i = 1;i<=n;i++){
            cin>>arr[i];pos[arr[i]] = i;
        }
        int g = 0;
        for(int i = 1;i<=n/2;i++){
            if((arr[i]==i)^(arr[n-i+1]==n-i+1)){
                cout<<-1<<endl;
                goto z;
            }
            if(arr[i]!=i)g++;
        }
        int e = 0;
        for(int i = 1;i<=n;i++){
            int x = pos[i];
            if(arr[i]==i)continue;
            if(arr[n-i+1]==n-x+1&&arr[n-x+1]==n-i+1){
                e++;
            }
        }
        cout<<g-(e/4)<<" "<<0<<endl;
    }
}

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 348 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 436 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 348 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 436 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 348 KB Wrong answer
2 Halted 0 ms 0 KB -