Järjestäminen

input/code.cpp: In function 'bool explore()':
input/code.cpp:33:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < current.size() - 3; i++) {
                  ~~^~~~~~~~~~~~~~~~~~~~
input/code.cpp:34:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i + 2; j < current.size() - 1; j++) {
                       ~~^~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
#include <unordered_map>
#define ll long long
#define ull unsigned long long
 
using namespace std;
 
unordered_map<string, bool> m;
unordered_map<string, bool> m2;
 
// bool arr[87654322];
string current = "";
string target = "";
 
void reset() {
	// memset(arr, 0, sizeof(arr));
	m = {};
	m2 = {};
	current = "";
	target = "";
}
 
int x = 0;
 
bool explore() {
	x++;
	if (current == target) return true;
	if (m2[current]) return true;
	if (m[current]) return false;
 
	m[current] = true;
 
	for (int i = 0; i < current.size() - 3; i++) {
		for (int j = i + 2; j < current.size() - 1; j++) {
			swap(current[i], current[j]);
			swap(current[i+1], current[j+1]);
			if (explore()) return true;
 
			swap(current[i], current[j]);
			swap(current[i + 1], current[j + 1]);
		}
	}
 
	return false;
}
 
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
 
//	istringstream cin(R"(3
//2
//1 2
//5
//2 3 5 1 4
//5
//1 4 5 2 3)");
 
 
	ll t; cin >> t;
 
	for (int i = 0; i < t; i++) {
		char n; cin >> n;
 
		reset();
 
		for (int j = '1'; j <= n; j++) {
			char x; cin >> x;
			current += x;
			target += j;
		}
 
		if (explore()) {
			cout << "YES" << "\n";
			for (auto x : m) {
				m2[x.first] = true;
			}
		} else {
			cout << "NO" << "\n";
		}
	}
 
	cout << x;
 
}

Test 1

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 1, 2

Verdict: TIME LIMIT EXCEEDED