Ratsun reitit

input/code.cpp: In function 'int minimumTile(int, int, int)':
input/code.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <bits/stdc++.h> 
#define ll long long int
 
using namespace std;
 
struct Tiles
{
	int x, y;
	int Distance;
	Tiles() {}
	Tiles(int x, int y, int Distance) : x(x), y(y), Distance(Distance) {}
};
 
int minimumTile(int x, int y, int n)
{
	if(x == 1 && y == n) {return 0;}
	
	int MovementX[] = {-2,-1,1,2,-2,-1,1,2};
	int MovementY[] = {-1,-2,-2,-1,1,2,2,1};
	
	int CurrentPosition[] = {1,n};
	int GetTo[] = {x,y}; 
	
	queue<Tiles> BFS_Queue;
	BFS_Queue.push(Tiles(CurrentPosition[0], CurrentPosition[1], 0));
	
	Tiles CurrentTile;
	int X_Axis, Y_Axis;
	bool BFS_Visit_Bool[n+1][n+1];
	
	for (int b = 1; b <= n; b++) 
        for (int m = 1; m <= n; m++) 
            BFS_Visit_Bool[b][m] = false;         
    BFS_Visit_Bool[CurrentPosition[0]][CurrentPosition[1]] = true;
    while(!BFS_Queue.empty())
    {
    	CurrentTile = BFS_Queue.front();
    	BFS_Queue.pop();
    	
    	if(CurrentTile.x == GetTo[0] && CurrentTile.y == GetTo[1])
    		return CurrentTile.Distance;
    		
    		
    		
    	for(int g = 0; g < 8; g++)
    	{
    		X_Axis = CurrentTile.x + MovementX[g];
    		Y_Axis = CurrentTile.y + MovementY[g];
    		
    		bool WeAreOnBoard = (X_Axis >= 1 && X_Axis <= n && Y_Axis >= 1 && Y_Axis <= n);
    		
    		if(WeAreOnBoard && !BFS_Visit_Bool[X_Axis][Y_Axis])
    		{
    			BFS_Visit_Bool[X_Axis][Y_Axis] = true;
    			BFS_Queue.push(Tiles(X_Axis, Y_Axis, CurrentTile.Distance + 1));
			}
		}
	}
}
 
 
 
int main() {
	int n;
	cin >> n;
	
	for(int y = n; y > 0; y--)
	{
		for(int x = 1; x <= n; x++)
		{
			cout << minimumTile(x,y,n) << " ";
		}
		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: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED