Sorting

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

int n;
vector<int> a,pos;

int main () {
    ios::sync_with_stdio(false); cin.tie(0);
    int t; cin>>t;
    while(t--) {
        cin>>n; a.resize(n+1),pos.resize(n+1);
        for(int i=1;i<=n;i++) {
            cin>>a[i]; pos[a[i]]=i;
        }
        for(int i=1;i<=n;i++) {
            int p=pos[i];
            if(p==i) continue;
            if(p<i or p==i+1 or p==n) {
                cout<<"NO"<<endl; goto newT;
            }
            swap(pos[a[i]],pos[a[p]]);
            swap(pos[a[i+1]],pos[a[p+1]]);
            swap(a[i],a[p]);
            swap(a[i+1],a[p+1]);

        }
        for(int i=1;i<=n;i++) {
            if(a[i]!=i) {
                cout<<"NO"<<endl; goto newT;
            }
        }
        cout<<"YES"<<endl;
        newT:;
    }
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: WRONG ANSWER