Ratsun reitit

#include <bits/stdc++.h>
#include <string.h>
#include <deque>

using namespace std;

char *board;
int sz;

struct coord{char x; char y; short step;};

deque<coord> que;

void queIfFree(char x, char y, short step){
    if(!board[sz * y + x]){
        board[sz * y + x] = step;
        board[sz * x + y] = step;
        que.push_back({x, y, step});
    }
}

void queNextSteps(char x, char y, int step){
    if(x >= 1){
        if(y >= 2) queIfFree(x - 1, y - 2, step);
        if(y < sz - 2) queIfFree(x - 1, y + 2, step);
    }
    if(x >= 2){
        if(y >= 1) queIfFree(x - 2, y - 1, step);
        if(y < sz - 1) queIfFree(x - 2, y + 1, step);
    }

    if(x < sz - 1){
        if(y >= 2) queIfFree(x + 1, y - 2, step);
        if(y < sz - 2) queIfFree(x + 1, y + 2, step);
    }
    if(x < sz - 2){
        if(y >= 1) queIfFree(x + 2, y - 1, step);
        if(y < sz - 1) queIfFree(x + 2, y + 1, step);
    }
}


int main(int argv, char *argc[]){
    cin >> sz;

    board = new char[sz * sz]();

    board[sz + 2] = 1;
    board[2 * sz + 1] = 1;

    coord c = {2, 1, 2};

    while(1){
        queNextSteps(c.x, c.y, c.step);

        if(que.empty()) break;

        c = que.front();
        c.step++;

        que.pop_front();
    }

    board[0] = 0;

    // Print
    int row = 0;
    for(int i = 0; i < sz * sz; i++){
        cout << (int) board[i];
        if(++row >= sz){
            row = 0;
            cout << endl;
        }else cout << ' ';
    }



    return EXIT_SUCCESS;
}

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