Sorting

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = a - 1; i >= (b); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set
#define INF 1000000000

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);

    int tc, n, arr[101];
    cin >> tc;
    while (tc--) {
        string ans = "YES";
        cin >> n;
        rep(i, 0, n) cin >> arr[i];
        rep(i, 0, n) {
            int indx;
            rep(j, i, n) if (arr[j] == i + 1) indx = j;
            if (indx == i) continue;

            if (indx - i == 2 && indx + 1 < n) {
                swap(arr[i], arr[indx]);
                swap(arr[i + 1], arr[indx + 1]);
            } else if (indx - i > 2) {
                swap(arr[i], arr[indx]);
                swap(arr[i + 1], arr[indx + 1]);
            } else {
                if (indx + 3 >= n) {
                    ans = "NO";
                    break;
                }
                swap(arr[i], arr[indx + 1]);
                swap(arr[i + 1], arr[indx + 2]);
                swap(arr[i], arr[indx + 2]);
                swap(arr[i + 1], arr[indx + 3]);
            }
        }
        cout<<ans<<'\n';
    }
    return 0;
}

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