프로그래머스 리코쳇 로봇 C++

#include <string>
#include <vector>
#include <queue>
#include <iostream>

using namespace std;

int visited[101][101];
int stx, sty;
int row_length, col_length;
int dx[4]= {-1, 1, 0, 0};
int dy[4]={0, 0, -1, 1};

int bfs(vector<string> board){
    queue<pair<int, int>> q;
    visited[sty][stx]=0;
    q.push({stx, sty});
    while (!q.empty()){
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        if (board[y][x]=='G'){
            return visited[y][x];
        }
        for (int i=0;i<4;i++){
            int nx = x, ny = y;
            while (nx+dx[i]>=0 &&nx+dx[i]<row_length&& ny+dy[i]>=0 &&ny+dy[i]<col_length&&board[ny+dy[i]][nx+dx[i]]!='D'){
                nx = nx+dx[i];
                ny = ny+dy[i];
            }
            if (visited[ny][nx]==-1){
                visited[ny][nx]=visited[y][x]+1;
                q.push({nx, ny});
            }
        }
        
    }
    return -1;
}

int solution(vector<string> board) {
    int answer = 0;
    col_length = board.size();
    row_length = board[0].size();
    for (int i=0;i<col_length;i++){
        for (int j=0;j<row_length;j++){
            if (board[i][j]=='R'){
                stx = j, sty = i;
            }
        }
    }
    for (int i=0;i<101;i++){
        for (int j=0;j<101;j++){
            visited[i][j]=-1;
        }
    }
    answer = bfs(board);
    return answer;
}

간단한 bfs 문제이다!