Sorting

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define pii pair<int,int>
#define N 2000005
#define INF 1e9+5
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define fori(i,l,r) for(int i=l;i<=r;i++)
#define forf(i,r) fori(i,1,r)
#define rof(i,r,l) for(int i=r;i>=l;i--)
#define ll long long
#define int ll
using namespace std;

int binpow(int x,int y){
    int ans=1;
    for(;y>0;x*=x,y>>=1){
        if(y&1)
            ans*=x;
    }
    return ans;
}

void solve(){
    int n;
    cin >> n;
	int a[n];
	for(int i=0;i<n;i++){
        cin >> a[i];
	}
	bool flag=false;
	int ans=0;
	while(!flag){
        flag=true;
        for(int i=0;i<n-1;i++){
            if(a[i]>a[i+1]){
                flag=false;
                swap(a[i],a[i+1]);
                i++;
                ans++;
            }
        }
	}
	if(ans%2==0)
        cout << "YES\n";
    else
        cout << "NO\n";
}

int32_t main(){
	fastio()
	int t=1;
	cin >> t;
	while(t--){
		solve();
	}
}

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED