# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
783082 |
2023-07-14T15:08:19 Z |
Andrey |
Cat (info1cup19_cat) |
C++14 |
|
9 ms |
716 KB |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n,a;
cin >> n;
vector<int> p(n+1);
for(int i = 1; i <= n; i++) {
cin >> a;
p[a] = i;
}
for(int i = 1; i <= n/2; i++) {
if(p[i] != n-p[n-i+1]+1) {
cout << -1 << " " << 0 << "\n";
return;
}
}
cout << 0 << " " << 0 << "\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while(t--) {
solve();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
340 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
716 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
340 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
9 ms |
716 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
340 KB |
Wrong answer |
2 |
Halted |
0 ms |
0 KB |
- |