Järjestäminen

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007
#define N (1 << 18)

using namespace std;

int v[101];

void move(int a, int b) {
    //cout << "moving: " << v[a] << " and " << v[b] << endl;
    //cout << "moving2: " << v[a + 1] << " and " << v[b + 1] << endl;
    swap(v[a], v[b]);
    swap(v[a + 1], v[b + 1]);
}

void test_case() {
	int n;
	cin >> n;
    //vector<int> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        v[i]--;
    }

    for (int i = 0; i < n; ++i) {
        int ti = -1; 
        for (int j = i; j < n; ++j) {
            if (v[j] == i) {
                ti = j;
                break;
            }
        }

        int dst = ti - i;
        if (dst == 0) continue;
        /*cout << "before: " << i << endl;
        for (int i = 0; i < n; ++i) {
            cout << v[i] << " ";
        }
        cout << endl;*/
        if (dst == 1) { // täytyy siirtää perälle
            if (i + 2 == n - 2) continue;
            move(i + 1, n - 2);
            i--;
        } else {
            if (ti == n - 1) continue;
            move(i, ti);
        }
        /*cout << "after: " << i << endl;
        for (int i = 0; i < n; ++i) {
            cout << v[i] << " ";
        }
        cout << endl;*/
    }

    bool ok = 1;

    for (int i = 0; i < n; ++i) {
        if (v[i] != i) ok = 0;
    }
    if (ok) {
        cout << "YES";
    } else {
        cout << "NO";
    }
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t = 0;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		test_case();
		cout << "\n";
	}

	return 0;
}

Test 1

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED