# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
762929 | Trunkty | Cat (info1cup19_cat) | C++14 | 416 ms | 20728 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;
typedef long long ll;
#define int ll
int t;
int n;
int arr[200005],pos[200005];
int val(int x){
if(x>n/2){
return n-x+1LL;
}
else{
return x;
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> t;
for(int e=1;e<=t;e++){
cin >> n;
for(int i=1;i<=n;i++){
cin >> arr[i];
}
bool bad = false;
for(int i=1;i<=n/2;i++){
if(arr[i]+arr[n-i+1LL]!=n+1LL){
# | 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... |