Ratsun reitit

/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <iostream>
#include <vector>
#include <tuple>
#include <array>
#include <map>
#include <string>

using namespace std;


int y_offsets[] = {1, 2, -1, 2, -1, -2, 1, -2};
int x_offsets[] = {2, 1, 2, -1, -2, -1, -2, 1};

int n;


map<vector<int>, int> shortestpath;


std::vector<vector<int>> get_neighbours(vector<int> node)
{

    vector<vector<int>> neighbours;
    
    
    for(int i = 0; i < 8; i++)
    {
        vector<int> newnode = {node[0]+y_offsets[i], node[1] + x_offsets[i]};
        
        if(0 <= newnode[0] && newnode[0] < n &&
            0 <= newnode[1] && newnode[1] < n){
            neighbours.push_back(newnode);
            
        }
    }
    
    return neighbours;
}

void visit(vector<int> node, int length){
    length += 1;
    
    vector<vector<int>> neighbours = get_neighbours(node);
    
    for(vector<int> newnode : neighbours)
    {
        if(length < shortestpath[newnode])
        {
            shortestpath[newnode] = length;
            
            visit(newnode, length);
        }
    }
}

int main(){
    cin >> n;
    
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            shortestpath[vector<int>{i, j}] = 999999;
        }
    }
        
    
    
    vector<int> start = {0, 0};
    shortestpath[start] = 0;
    visit(start, 0);
    //vector<vector<int>> neighbours = get_neighbours(start);
    
    //cout << neighbours.size();
    
    for(int i = 0; i < n; i++){
        string row = "";
        
        for(int j = 0; j < n; j++){
            row += std::to_string(shortestpath[vector<int>{i, j}]) + " ";
        }
        cout << row << 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: 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