[Algorithm] Baekjoon 7562번 : 나이트의 이동

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

7562번: 나이트의 이동

struct Node
{
    int y;
    int x;
    int count;
};
 
bool visited[301][301];
int dir[8][2] = { {-1,-2}, {-2,-1},{-2,1}, {-1,2},{1,2},{2,1},{2,-1},{1,-2} }; 
 
int BFS(int sy, int sx, int dy, int dx, int size)
{
    memset(visited, false, sizeof(visited));
 
    queue<Node> q;
    q.push({ sy,sx,0 });
    visited[sy][sx] = true;
 
    while (!q.empty())
    {
        int curY = q.front().y;
        int curX = q.front().x;
        int curCount = q.front().count;
        q.pop();
 
        if (curY == dy && curX == dx)
        {
            return curCount;
        }
 
        for (int i = 0; i < 8; ++i)
        {
            int nextY = curY + dir[i][0];
            int nextX = curX + dir[i][1];
 
            if (nextY < 0 || nextY >= size) continue;
            if (nextX < 0 || nextX >= size) continue;
            if (visited[nextY][nextX]) continue;
 
            visited[nextY][nextX] = true;
            q.push({ nextY,nextX,curCount + 1 });
        }
    }
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
 
    int t, n, sy, sx, dy, dx;
    vector<int> results;
 
    cin >> t;
 
    for (int i = 0; i < t; ++i)
    { 
        cin >> n;
        cin >> sy >> sx >> dy >> dx;
        results.push_back(BFS(sy, sx, dy, dx, n));
    }
 
    for (auto& temp : results)
    {
        cout << temp << endl;
    }
}

따로 맵을 선언할필요 없이 방문체크만으로도 해결할 수 있는 BFS문제이다.