Ratsun reitit

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
 
void printBoard(int board[], int size) {
	board[0] = 0;
	for(int y = 0; y < size; y++) {
		for(int x = 0; x < size; x++) {
			cout << board[x + size * y] << " ";
		}
		cout << "\n";
	}
	return;
}
int* initArray(int size) {
	int* board = new int[size*size];
	for(int i = 1; i < (size*size); i++)
		board[i] = 0;
	board[0] = -1;
	return board;
}
int main() {
	int size;
	cin >> size; // Pyydetään koko
 
	int* board = initArray(size); //Luodaan lauta
 
	int moveCount = 1; //Alkuperäinen aktiivisien siirtojen määrä
	int newMoveCount = -1;
	int* newMoves = new int[size*size];
	int* latestMoves = new int[moveCount]; //Viimeisimpien siirtojen sijainnit (index)
	latestMoves[0] = 0; //Alkuperäinen ensimmäisen siirron sijainti
	int moveIndex = 0;
	
	while(newMoveCount != 0) {
		newMoves = new int[size*size];
		newMoveCount = 0;
		moveIndex++;
		for(int i = 0; i < moveCount; i++) { //Jokainen aktiivinen siirto läpi
			// -->
			if(latestMoves[i] % size < size - 2) { //Ei mene oikeasta laidasta yli
					//  X
					//OXX
				if(latestMoves[i] > size) { //Ei mene ylälaidasta yli
					if(board[latestMoves[i] + 2 - size*1] == 0) {
						board[latestMoves[i] + 2 - size*1] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] + 2 - size*1;
						newMoveCount++;
					}
				}
					//OXX
					//  X
				if(latestMoves[i] < size*size-size) { //Ei mene alalaidasta ali
					if(board[latestMoves[i] + 2 + size*1] == 0) {
						board[latestMoves[i] + 2 + size*1] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] + 2 + size*1;
						newMoveCount++;
					}
				}
			}
			// <--
			if(latestMoves[i] % size >= 2) { //Ei mene vasemmasta laidasta yli
					//X
					//XXO
				if(latestMoves[i] > size) { //Ei mene ylälaidasta yli
					if(board[latestMoves[i] - 2 - size*1] == 0) {
						board[latestMoves[i] - 2 - size*1] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] - 2 - size*1;
						newMoveCount++;
					}
				}
					//XXO
					//X
				if(latestMoves[i] < size*size-size) { //Ei mene alalaidasta ali
					if(board[latestMoves[i] - 2 + size*1] == 0) {
						board[latestMoves[i] - 2 + size*1] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] - 2 + size*1;
						newMoveCount++;
					}
				}
			}
			// ^
			// |
			if(latestMoves[i] > size*2) { //Ei mene ylälaidasta yli
				//XX
				// X
				// O
				if(latestMoves[i] % size >= 1) { //Ei mene vasemmasta laidasta yli
					if(board[latestMoves[i] - 1 - size*2] == 0) {
						board[latestMoves[i] - 1 - size*2] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] - 1 - size*2;
						newMoveCount++;
					}
				}
				//XX
				//X
				//O
				if(latestMoves[i] % size < size - 1) { //Ei mene oikeasta laidasta yli
					if(board[latestMoves[i] + 1 - size*2] == 0) {
						board[latestMoves[i] + 1 - size*2] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] + 1 - size*2;
						newMoveCount++;
					}
				}
			}
			// |
			// V
			if(latestMoves[i] < size*size-size*2) { //Ei mene alalaidasta ali
				// O
				// X
				//XX
				if(latestMoves[i] % size >= 1) { //Ei mene vasemmasta laidasta yli
					if(board[latestMoves[i] - 1 + size*2] == 0) {
						board[latestMoves[i] - 1 + size*2] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] - 1 + size*2;
						newMoveCount++;
					}
				}
				//O
				//X
				//XX
				if(latestMoves[i] % size < size - 1) { //Ei mene oikeasta laidasta yli
					if(board[latestMoves[i] + 1 + size*2] == 0) {
						board[latestMoves[i] + 1 + size*2] = moveIndex;
						newMoves[newMoveCount] = latestMoves[i] + 1 + size*2;
						newMoveCount++;
					}
				}
			}
		}
		latestMoves = new int[newMoveCount];
		std::copy_n(newMoves, newMoveCount, latestMoves);
		moveCount = newMoveCount;
	}
 
 
	printBoard(board, size); //Lopuksi tulosta valmis lauta
}

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