gpt-3.5-turbo-0613· openai
Suzhen/CodeChat
#include <iostream> #include <vector> int maxOptimalCoupledCells(int M, int N,…
- User
#include #include
int maxOptimalCoupledCells(int M, int N, std::vector<std::vector>& board) { std::vector<std::vector> visited(M, std::vector(N, 0));
auto isValid = [&](int x, int y) { return 0 <= x && x < M && 0 <= y && y < N; }; auto isCoupled = [&](int x, int y) { return board[x][y] == 'O' && visited[x][y] == 0; }; auto dfs = [&](int x, int y) -> int { visited[x][y] = 1; int count = 1; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; for (int k = 0; k < 4; ++k) { int nx = x + dx[k]; int ny = y + dy[k]; if (isValid(nx, ny) && isCoupled(nx, ny)) { count += dfs(nx, ny); } } return count; }; int coupled_cells = 0; for (int i = 0; i < M; ++i) { for (int j = 0; j < N; ++j) { if (isCoupled(i, j)) { int count = dfs(i, j); coupled_cells += count / 2; } } } return M * N - 2 * coupled_cells;}
int main() { int M = 4; int N = 4; std::vector<std::vector> board = { {'O', 'X', 'O', 'O'}, {'O', 'O', 'O', 'X'}, {'X', 'X', 'X', 'O'}, {'X', 'O', 'O', 'X'} };
int result = maxOptimalCoupledCells(M, N, board); std::cout << "Number of remaining single cells: " << result << std::endl; return 0;} Correct the program
- Assistant
There is nothing visibly wrong with the code. However, there are a few improvements that can be made:
- The
isValidfunction can be simplified to:
auto isValid = [&](int x, int y) { return x >= 0 && x < M && y >= 0 && y < N; };- The
isCoupledfunction can be simplified to:
auto isCoupled = [&](int x, int y) { return board[x][y] == 'O' && visited[x][y] == 0; };- The
dfsfunction can be simplified to:
int dfs(int x, int y) { visited[x][y] = 1; int count = 1; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; for (int k = 0; k < 4; ++k) { int nx = x + dx[k]; int ny = y + dy[k]; if (isValid(nx, ny) && isCoupled(nx, ny)) { count += dfs(nx, ny); } } return count; }Here's the corrected code:
#include <iostream> #include <vector> int maxOptimalCoupledCells(int M, int N, std::vector<std::vector<char>>& board) { std::vector<std::vector<int>> visited(M, std::vector<int>(N, 0)); auto isValid = [&](int x, int y) { return x >= 0 && x < M && y >= 0 && y < N; }; auto isCoupled = [&](int x, int y) { return board[x][y] == 'O' && visited[x][y] == 0; }; int dfs(int x, int y) { visited[x][y] = 1; int count = 1; int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; for (int k = 0; k < 4; ++k) { int nx = x + dx[k]; int ny = y + dy[k]; if (isValid(nx, ny) && isCoupled(nx, ny)) { count += dfs(nx, ny); } } return count; } int coupled_cells = 0; for (int i = 0; i < M; ++i) { for (int j = 0; j < N; ++j) { if (isCoupled(i, j)) { int count = dfs(i, j); coupled_cells += count / 2; } } } return M * N - 2 * coupled_cells; } int main() { int M = 4; int N = 4; std::vector<std::vector<char>> board = { {'O', 'X', 'O', 'O'}, {'O', 'O', 'O', 'X'}, {'X', 'X', 'X', 'O'}, {'X', 'O', 'O', 'X'} }; int result = maxOptimalCoupledCells(M, N, board); std::cout << "Number of remaining single cells: " << result << std::endl; return 0; } - The
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.