C++. solution : For each cell update : start from the cell and check along the row that passes through this cell, once toward the right, then toward the left start from the cell and check along the column that passes through this cell, once toward down, then toward up start from the cell and check along the main diagonal that passes through this cell, once toward down-right, then toward up-left start from the cell and check along the anti diagonal that passes through this cell, once toward down-left, then toward up-right ``` #include using namespace std; class Solution { vector> board; vector> dirs{ {0,1}, // row rightward {1,0}, // col downward {1,1}, // main diag downward {1,-1} // anti diag downward }; int process_move(int row, int col, int m, int n, int k, int player) { board[row][col] = player; vector counter(4, 1); // row, col, main diag, anti diag, 1 count for the newly edited cell for(int i = 0; i < 4; ++i) { int r = row + dirs[i][0]; int c = col + dirs[i][1]; while(r >= 0 && r < m && c >= 0 && c < n && board[r][c] == player) { counter[i]++; if (counter[i] == k) return player; r += dirs[i][0]; c += dirs[i][1]; } } for(int i = 0; i < 4; ++i) { int r = row - dirs[i][0]; int c = col - dirs[i][1]; while(r >= 0 && r < m && c >= 0 && c < n && board[r][c] == player) { counter[i]++; if (counter[i] == k) return player; r -= dirs[i][0]; c -= dirs[i][1]; } } return 0; } void buildBoard(int m, int n) { board.resize(m, vector(n, 0)); } public: std::vector generalized_tic_tac_toe(int m, int n, int k, const std::vector>& moves) { if(moves.size() == 0) return {}; buildBoard(m, n); vector result; for(auto& mv:moves){ result.push_back(process_move(mv[0], mv[1], m, n, k, mv[2])); } return result; } }; ```

Quick Overview

Implement Generalized Tic-Tac-Toe