Ratsun reitit

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

int ci[] = {1, 1, -1, -1, 2, 2, -2, -2};
int cj[] = {2, -2, 2, -2, 1, -1, 1, -1};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;
	vector<vector<int>> dist(n, vector<int>(n, -1));
	dist[0][0] = 0;
	queue<pair<int, int>> q;
	q.emplace(0, 0);
	while (!q.empty()) {
		auto [i, j] = q.front();
		q.pop();
		for (int k = 0; k < 8; ++k) {
			int ni = i + ci[k], nj = j + cj[k];
			if (ni < 0 || nj < 0 || ni >= n || nj >= n)
				continue;
			if (dist[ni][nj] != -1 && dist[ni][nj] <= dist[i][j] + 1)
				continue;
			dist[ni][nj] = dist[i][j] + 1;
			q.emplace(ni, nj);
		}
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j)
			cout << dist[i][j] << ' ';
		cout << '\n';
	}
}

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