Sorting

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

void solve(){
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0 ; i < n; i ++ ){
        cin >> a[i];
        a[i]--;
    }
    for(int i = 0 ; i < n; i ++ ){
        if(a[i] == i) continue;
        if(a[n - 1] == i){
            if(n - 1 - i >= 4){
                swap(a[n - 1], a[n - 3]);
                swap(a[n - 2], a[n - 4]);
            }
            else{
                cout << "NO\n";
                return;
            }
        }
        for(int j = i + 1; j < n; j ++ ){
            if(a[j] == i){
                swap(a[i],a[j]);
                swap(a[i+1],a[j+1]);
                break;
            }
        }
    }
    cout << "YES\n";
}

int main(){
    int tc;
    cin >> tc;
    for(int t = 1; t <= tc; t ++ ){
        solve();
    }
}

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