Ratsun reitit

#include <string>
#include <vector>
#include <queue>
#include <iostream>
#include <set>

std::queue<std::pair<int, int>> queue;
std::vector<std::vector<bool>> used;
std::vector<std::vector<int>> values;
int n;
const std::set<std::pair<int, int>> offsets = { {-2,-1} ,{-1,-2}, {1,-2} ,{2,-1} ,{-1,2} ,{-2,1} ,{2,1} ,{1,2} };

bool isInside(int y, int x) {
	if (y < 0 || x < 0) {
		return false;
	}
	if (y >= n || x >= n)
	{
		return false;
	}
	return true;
}

void process() {
	std::pair<int, int> current = queue.front();
	queue.pop();

	for (std::pair<int, int> offset : offsets)
	{
		std::pair<int, int> n = std::make_pair(current.first + offset.first, current.second + offset.second);
		if (isInside(n.first, n.second))
		{
			if (used[n.first][n.second] == false)
			{
				values[n.first][n.second] = values[current.first][current.second] + 1;
				queue.push(n);
				used[n.first][n.second] = true;
			}
		}
	}

}


int main() {


	std::cin >> n;
	values.resize(n);
	used.resize(n);
	for (int i = 0; i < n; i++)
	{
		values[i].resize(n);
		used[i].resize(n);
	}

	values[0][0] = 0;
	used[0][0] = true;
	queue.push(std::make_pair(0, 0));

	while (!queue.empty())
	{
		process();
	}


	for (auto it = values.begin(); it != values.end(); it++)
	{
		auto lastIt = --it->end();
		for (auto itt = it->begin(); itt != it->end(); itt++) {
			std::cout << *itt;
			if (itt != lastIt)
			{
				std::cout << " ";
			}
			else
			{
				std::cout << "\n";
			}
		}

	}


	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED