Järjestäminen

#include <iostream>
#include <vector>

using namespace std;

void swappair(vector<int>& v, vector<int>& d, int i, int j) {
	swap(v[i+1], v[j+1]);
	swap(d[v[i+1]], d[v[j+1]]);
	swap(v[i], v[j]);
	swap(d[v[i]], d[v[j]]);
}

int main() {
	int t;
	cin >> t;
	while (t --> 0) {
		int n;
		cin >> n;
		vector<int> v(n), d(n);
		for (int i = 0; i < n; ++i) {
			cin >> v[i];
			d[--v[i]] = i;
		}
		bool b = 0;
		for (int i = 0; i < n; ++i) {
			if (d[i] == i) continue;
			if ((d[i] == n-1 && i > n-4) || (n-d[i]-2 < 2 && d[i]-i < 2)) {
				cout << "NO\n";
				b = 1;
				break;
			} else if (d[i] == n-1) {
				swappair(v, d, i+1, d[i]-1);
				swappair(v, d, i, d[i]);
			} else if (d[i]-i > 1) {
				//cout << "else if: " << i << ' ' << d[i] << endl;
				swappair(v, d, i, d[i]);
			} else {
				//cout << "else: " << i << ' ' << d[i] << endl;
				swappair(v, d, d[i], d[i]+2);
				swappair(v, d, i, d[i]);
			}
		}
		if (b) continue;
		cout << "YES\n";
	}
}

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