공주님을 구해라!

*칼을 가지고 지나가는 경우와 아닌 경우를 나눠서 판단 

#include <iostream>
#include <vector>
#include <queue>
 
using namespace std;
int n, m, t, ans;
int map[101][101];
bool visited[101][101][2];
int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};
typedef pair<int, int> pp;
typedef pair<pp, pp> pppp;
 
void bfs(int x, int y)
{
    queue<pppp> q;
    q.push(pppp(pp(0, 0), pp(x, y)));
    visited[x][y][0] = true;
 
    while (!q.empty())
    {
        int size = q.size();
        while (size--)
        {
            int x = q.front().second.first;
            int y = q.front().second.second;
            int cnt = q.front().first.first;
            int knife = q.front().first.second;
            q.pop();
 
            if (x == n - 1 && y == m - 1)
            {
                ans = min(ans, cnt);
                continue;
            }
 
            for (int i = 0; i < 4; i++)
            {
                int nx = x + dx[i];
                int ny = y + dy[i];
 
                if (nx < 0 || nx >= n || ny < 0 || ny >= m || visited[nx][ny][knife])
                    continue;
 
                if (map[nx][ny] == 1)
                {
                    if (knife)
                    {
                        //칼을 가지고 있다면
                        visited[nx][ny][knife] = true;
                        q.push(pppp(pp(cnt+1, knife), pp(nx, ny)));
                    }
                    else {
                        continue;
                    }
                }
                else if (map[nx][ny] == 2) {
                    //칼 발견 
                    visited[nx][ny][1] = true;
                    q.push(pppp(pp(cnt+1, 1), pp(nx, ny)));
                }
                else {
                    visited[nx][ny][knife] = true;
                    q.push(pppp(pp(cnt+1, knife), pp(nx, ny)));
                }
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    cin >> n >> m >> t;
 
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            cin >> map[i][j];
        }
    }
 
    ans = t+1;
    bfs(0, 0);
    if (ans == t+1) cout << "Fail" << '\n';
    else cout << ans << '\n';
    return 0;
}