Sorting

input/code.cpp: In function 'void usaco()':
input/code.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("problem.in", "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:16:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("problem.out", "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
void fast() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
	srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
	long long a = rand();
	long long b = rand();
	return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
	freopen("problem.in", "r", stdin); 
	freopen("problem.out", "w", stdout);
}
template<typename T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
// #define endl '\n'
// #define double long double
// #define int long long
// const int MOD = 1000 * 1000 * 1000 + 7;
// const int MOD = 998244353;

map<vector<int>, bool> check;

void solve() {
	
	int n;
	cin >> n;
	vector<int> tr(n);
	
	for (int i=0; i<n; i++) {
		cin >> tr[i];
	}
	
	cout << (check[tr] ? "YES" : "NO") << endl;
	
}

signed main() {
	
	int n = 8;
	vector<int> vc;
	queue<vector<int>> tr;
	for (int i=1; i<=n; i++) {
		vc.push_back(i);
		check[vc] = true;
		tr.push(vc);
	}
	
	while (!tr.empty()) {
		
		vector<int> vc = tr.front(); tr.pop();
		
		int x = vc.size();
		
		for (int i=0; i<x; i++) {
			for (int j=i+2; j<x-1; j++) {
				
				swap(vc[i], vc[j]);
				swap(vc[i+1], vc[j+1]);
				
				if (!check[vc]) {
					check[vc] = true;
					tr.push(vc);
				}
				
				swap(vc[i], vc[j]);
				swap(vc[i+1], vc[j+1]);
				
			}
		}
		
	}
	
	int t;
	cin >> t;
	while (t--) solve();

}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED