Ratsun reitit

#include <iostream>

using namespace std;

typedef long long ll;

ll n, c, i, j, d[100][100];

void r(ll x, ll y) {
	if (x < 0 || y < 0 || x >= n || y >= n) {
		return;
	}

	if (d[y][x] == 0 || c < d[y][x]) {
		d[y][x] = c + 1;
	} else {
		return;
	}

	c++;
	r(x - 1, y - 2);
	r(x + 1, y - 2);
	r(x - 2, y - 1);
	r(x + 2, y - 1);
	r(x - 1, y + 2);
	r(x + 1, y + 2);
	r(x - 2, y + 1);
	r(x + 2, y + 1);
	c--;
}

int main() {
	cin >> n;
	r(0, 0);
	for (; j < n; j++) {
		for (i = 0; i < n; i++) {
			cout << d[j][i] - 1 << ' ';
		}
		cout << endl;
	}
}

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: TIME LIMIT EXCEEDED

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