[S1953] - [모의 SW 역량테스트] 탈주범검거

삼성모의테스트 탈주범검거입니다.

https://www.swexpertacademy.com/main/learn/course/lectureProblemViewer.do

#include <iostream>
#include <queue>
using namespace std;
int dx[] = { 0,0,-1,1 };
int dy[] = { -1,1,0,0 };
bool pos(int dir,int a, int b)
{
    
    if (dir == 2)//위로
    {
        if (a == 1 && ((b == 1) || (b == 2) || (b == 5) || (b == 6)))
            return true;
        else if (a == 2 && ((b == 1) || (b == 2) || (b == 5) || (b == 6)))
            return true;
        else if (a == 4 && ((b == 1) || (b == 2) || (b == 5) || (b == 6)))
            return true;
        else if (a == 7 && ((b == 1) || (b == 2) || (b == 5) || (b == 6)))
            return true;
        else
            return false;
    }
    else if (dir == 3)//아래로
    {
        if (a == 1 && ((b == 1) || (b == 2) || (b == 4) || (b == 7)))
            return true;
        else if (a == 2 && ((b == 1) || (b == 2) || (b == 4) || (b == 7)))
            return true;
        else if (a == 5 && ((b == 1) || (b == 2) || (b == 4) || (b == 7)))
            return true;
        else if (a == 6 && ((b == 1) || (b == 2) || (b == 4) || (b == 7)))
            return true;
        else
            return false;
    }
    else if (dir == 0)//왼쪽
    {
        if (a == 1 && ((b == 1) || (b == 3) || (b == 4) || (b == 5)))
            return true;
        else if (a == 3 && ((b == 1) || (b == 3) || (b == 4) || (b == 5)))
            return true;
        else if (a == 6 && ((b == 1) || (b == 3) || (b == 4) || (b == 5)))
            return true;
        else if (a == 7 && ((b == 1) || (b == 3) || (b == 4) || (b == 5)))
            return true;
        else
            return false;
    }
    else if (dir == 1)//오른쪽
    {
        if (a == 1 && ((b == 1) || (b == 3) || (b == 6) || (b == 7)))
            return true;
        else if (a == 3 && ((b == 1) || (b == 3) || (b == 6) || (b == 7)))
            return true;
        else if (a == 4 && ((b == 1) || (b == 3) || (b == 6) || (b == 7)))
            return true;
        else if (a == 5 && ((b == 1) || (b == 3) || (b == 6) || (b == 7)))
            return true;
        else
            return false;
    }
}
int main()
{
    int T;
    cin >> T;
    for (int test_case = 1; test_case <= T; test_case++)
    {
        int n, m, r, c, l;
        cin >> n >> m >> r >> c >> l;//세로 가로 맨홀세로 맨홀가로 탈출후시간
        int a[51][51] = { 0, };
        int check[51][51] = { 0, };
        int ans = 0;
        bool timeoff = false;
        queue<pair<int, int>>q;
        
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cin >> a[i][j];
 
                //1 상하좌우 2 상하 3 좌우 4 상우 5 하우 6하좌 7 상좌
            }
        }
        q.push({ r,c });
        check[r][c] = 1;
        while (!q.empty())
        {
            int x = q.front().first;
            int y = q.front().second;
            q.pop();
            for (int dir = 0; dir < 4; dir++)
            {
                int nx = x + dx[dir];
                int ny = y + dy[dir];
                if (nx >= 0 && nx < n&&ny >= 0 && ny < m&&a[nx][ny]!=0&&pos(dir,a[x][y],a[nx][ny]))
                {
 
                    if (check[nx][ny]==0)
                    {
                        check[nx][ny] = check[x][y] + 1;
                        if (check[nx][ny] > l)
                        {
                            check[nx][ny] = 0;
                            timeoff = true;
                            break;
                        }
                        q.push({ nx,ny });
                    }
                }
            }
            if (timeoff)
                break;
        }
    
        cout << '\n';
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++)
            {
                if (check[i][j])
                    ans++;
                cout << check[i][j] << ' ';
            }
            cout << '\n';
        }
    
        cout << '#' << test_case << ' ' << ans << '\n';
        
    }
}