Ratsun reitit

input/code.cpp: In function 'void r(uint*, uint, uint, int, int)':
input/code.cpp:21:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x - 1 >= 0 && y + 2 < n) {
                   ~~~~~~^~~
input/code.cpp:27:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x - 2 >= 0 && y + 1 < n) {
                   ~~~~~~^~~
input/code.cpp:33:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x + 1 < n && y - 2 >= 0) {
     ~~~~~~^~~
input/code.cpp:39:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x + 2 < n && y - 1 >= 0) {
     ~~~~~~^~~
input/code.cpp:45:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x + 1 < n && y + 2 < n) {
     ~~~~~~^~~
input/code.cpp:45:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x + 1 < n && y + 2 < n)...

#include <bits/stdc++.h>

using namespace std;

#define g(x, y)((x) + (y) * n)

void r(uint *t, uint n, uint s, int x, int y){
	uint ss = s + 1;
	if(x - 1 >= 0 && y - 2 >= 0) {
		if(t[g(x - 1, y - 2)] > ss){
			t[g(x - 1, y - 2)] = ss;
			r(t, n, ss, x - 1, y - 2);
		}
	}
	if(x - 2 >= 0 && y - 1 >= 0) {
		if(t[g(x - 2, y - 1)] > ss){
			t[g(x - 2, y - 1)] = ss;
			r(t, n, ss, x - 2, y - 1);
		}
	}
	if(x - 1 >= 0 && y + 2 < n) {
		if(t[g(x - 1, y + 2)] > ss){
			t[g(x - 1, y + 2)] = ss;
			r(t, n, ss, x - 1, y + 2);
		}
	}
	if(x - 2 >= 0 && y + 1 < n) {
		if(t[g(x - 2, y + 1)] > ss){
			t[g(x - 2, y + 1)] = ss;
			r(t, n, ss, x - 2, y + 1);
		}
	}
	if(x + 1 < n && y - 2 >= 0) {
		if(t[g(x + 1, y - 2)] > ss){
			t[g(x + 1, y - 2)] = ss;
			r(t, n, ss, x + 1, y - 2);
		}
	}
	if(x + 2 < n && y - 1 >= 0) {
		if(t[g(x + 2, y - 1)] > ss){
			t[g(x + 2, y - 1)] = ss;
			r(t, n, ss, x + 2, y - 1);
		}
	}
	if(x + 1 < n && y + 2 < n) {
		if(t[g(x + 1, y + 2)] > ss){
			t[g(x + 1, y + 2)] = ss;
			r(t, n, ss, x + 1, y + 2);
		}
	}
	if(x + 2 < n && y + 1 < n) {
		if(t[g(x + 2, y + 1)] > ss){
			t[g(x + 2, y + 1)] = ss;
			r(t, n, ss, x + 2, y + 1);
		}
	}
}

int main(){
	uint n;
	cin >> n;
	uint t[n * n] = {};
	for(uint i = 0; i < n * n; i++) t[i] = 1e8;
	t[0] = 0;
	r(t, n, 0, 0, 0);
	for(uint i = 0; i < n; i++){
	for(uint j = 0; j < n; j++){
		cout << t[g(j, i)] << ' ';
	}
		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