# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
861271 | 2023-10-15T18:45:23 Z | Ahmed57 | Cat (info1cup19_cat) | C++17 | 106 ms | 596 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(n-pos[arr[i]]+1!=arr[n-i+1]){ cout<<-1<<endl; } } 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&&arr[x]==i){ e++; } } cout<<g-(e/4)<<" "<<0<<endl; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 344 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 106 ms | 596 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 344 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 106 ms | 596 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 21 ms | 344 KB | Wrong answer |
2 | Halted | 0 ms | 0 KB | - |