Shortest path around

    1 
    2#include <bits/stdc++.h>
    3 
    4using namespace std;
    5 
    6const vector<vector<int>> DIR = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}, {-1, -1}, {1, 1}, {1,  -1}, {-1, 1}};
    7int main(){
    8    ios::sync_with_stdio(0);
    9    cin.tie(0);
    10    int t = 5;
    11    while(t-- > 0){
    12    vector<vector<char>> grid(10, vector<char>(10));
    13    int r, c;
    14    for(int i = 0; i < 10; i++){
    15        for(int j = 0; j < 10; j++){
    16                char g;
    17                cin >> g;
    18                grid[i][j] = g;
    19                if(g == 'X'){
    20                    r = i; c = j;
    21                }
    22            }
    23        }
    24        queue<pair<int, int>> q;
    25        vector<vector<bool>> visited(10, vector<bool>(10));
    26        vector<vector<int>> dist(10, vector<int>(10));
    27        for(int i = 0; i < 10; i++){
    28            for(int j = 0; j < 10; j++){
    29                dist[i][j] = 0;
    30            }
    31        }
    32        visited[r][c] = true;
    33        q.push({r, c});
    34        bool end = false;
    35        while(!q.empty()){
    36            auto[cr, cc] = q.front(); q.pop();
    37            for(auto d : DIR){
    38                int nr, nc;
    39                nr = cr + d[0]; 
    40                nc = cc + d[1];
    41                if(nr >= 0 && nr < 10 && nc >= 0 && nc < 10 && !visited[nr][nc] && grid[nr][nc] != '#'){
    42                    visited[nr][nc] = true;
    43                    q.push({nr, nc});
    44                    dist[nr][nc] = dist[cr][cc] + 1;
    45                    if(grid[nr][nc] == 'X'){
    46                        cout << dist[nr][nc] << '\n';
    47                        end = true;
    48                    }
    49                    if(end) break;
    50                }
    51            }
    52            if(end) break;
    53        }
    54        cin.ignore();
    55        string dash;
    56        getline(cin, dash);
    57    }
    58    return 0;
    59}