그랬었습니다

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859#include #include using namespace std; int bfs(int** arr, int** visited, int size, int x, int y) { queue order; order.push({ x, y }); int num = 0; visited[x][y] = 1; while (!order.empty()) { pair now = order.front(); order.pop(); num++; if (now.first + 1 = 0 && arr[now.first - 1][now.seco..