Problem

A mobile gaming platform runs real-time Tic-Tac-Toe tournaments with millions of daily users. To keep latency low, the backend needs to evaluate each move in constant time without scanning the whole board.

You are given an n x n Tic-Tac-Toe board (initially empty) and a list of moves. Each move is a triple (row, col, player) where player is 1 or 2.

After each move, return:

• 0 if nobody has won yet
• 1 if player 1 wins on that move
• 2 if player 2 wins on that move

If a move is invalid, you must raise ValueError:

1. The move is out of bounds (row or col not in [0, n-1])
2. The cell is already occupied
3. player is not 1 or 2

Function to implement

Implement the function:

• tictactoe_move_results(n: int, moves: list[list[int]]) -> list[int | str]

Return a list of results aligned with the moves. If a move raises ValueError, place the string "ValueError" at that position and stop processing further moves (this matches the platform’s “reject the request” behavior).

Examples

Example 1

• Input: n = 3, moves = [[0,0,1],[0,2,2],[2,2,1],[1,1,2],[2,0,1],[1,0,2],[2,1,1]]
• Output: [0, 0, 0, 0, 0, 0, 1]
• Explanation: Only the last move completes a full line: player 1 fills row 2.

Example 2

• Input: n = 2, moves = [[0,0,2],[1,1,2]]
• Output: [0, 2]
• Explanation: Player 2 occupies the main diagonal; that diagonal reaches size n.

Notes

• A win occurs when a player fills any row, column, main diagonal, or anti-diagonal.
• You should achieve O(1) work per move.

Constraints

• 1 <= n <= 10^5
• 0 <= moves.length <= n^2
• Each move is [row, col, player] with integers