Ratsun reitit

#include <iostream>
#include <queue>

using namespace std;

int t[101][101];
int e[101][101];
int o[101][101];

int main() {
	int n;
	queue<pair<int,int>> q;
	cin >> n;
	q.push({0, 0});
	e[0][0] = -1;
	while (!q.empty()) {
		auto p = q.front();
		q.pop();
		int y = p.first;
		int x = p.second;
		t[y][x] = e[y][x]+1;
		o[y][x] = 1;
		for (int i = -2; i <= 2; i++) {
			if (!i) continue;
			if (y+i >= 0 && y+i < n) {
				if (x+2/i >= 0 && x+2/i < n) {
					if (!o[y+i][x+2/i]) {
						q.push({y+i, x+2/i});
						e[y+i][x+2/i] = t[y][x];
					}
				}
				if (x-2/i >= 0 && x-2/i < n) {
					if (!o[y+i][x-2/i]) {
						q.push({y+i, x-2/i});
						e[y+i][x-2/i] = t[y][x];
					}
				}
			}
		}
	}
	for (int y = 0; y < n; y++) {
		for (int x = 0; x < n; x++) {
			cout << t[y][x] << ' ';
		}
		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: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED