[Algorithm] Baekjoon 5014번 : 스타트링크

https://www.acmicpc.net/problem/5014

5014번: 스타트링크

struct Node
{
    int curStair;
    int curCount;
};
 
bool visited[1000001];
 
int BFS(int start, int target, int upNum, int downNum, int maxStairNum)
{
    queue<Node> q;
    q.push({ start,0 });
    visited[start] = true;
 
    while (!q.empty())
    {
        int curStair = q.front().curStair;
        int curCount = q.front().curCount;
        q.pop();
 
        if (curStair == target)
        {
            return curCount;
        }
 
        if (curStair + upNum <= maxStairNum && !visited[curStair + upNum])
        {
            q.push({ curStair + upNum, curCount + 1 });
            visited[curStair + upNum] = true;
        }
 
        if (curStair - downNum >= 1 && !visited[curStair - downNum])
        {
            q.push({ curStair - downNum, curCount + 1 });
            visited[curStair - downNum] = true;
        }
    }
 
    return -1;
}