Submission #6938496

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>

using namespace std;

struct pos{int x,y,t;};
vector<vector<char>> Maze;
queue<pos> Que;

int main(void){
    int R, C, sx, sy, gx, gy;
    char m;
    cin >> R >> C >> sx >> sy >> gx >> gy;
    Maze.assign(R+2, vector<char>(C+2));
    
    for(int r=0; r<R+2; r++){
        Maze[r][0] = '#';
        Maze[r][C+1] = '#';
    }
    for(int c=0; c<C+2; c++){
        Maze[0][c] = '#';
        Maze[R+1][c] = '#';
    }
    for(int r=1; r<=R; r++){
        for(int c=1; c<=C; c++){
            cin >>Maze[r][c]; 
        }
    }
    
    Que.push(pos{sx, sy, 0});
    while(!Que.empty()){
        pos p = Que.front();
        Que.pop();
        if(Maze[p.x][p.y] == '.'){
            if(p.x==gx && p.y==gy){
                cout << p.t << endl;
                return 0;           
            }
            Maze[p.x][p.y] = '*';
            Que.push(pos{p.x+1, p.y, p.t+1});
            Que.push(pos{p.x-1, p.y, p.t+1});
            Que.push(pos{p.x, p.y+1, p.t+1});
            Que.push(pos{p.x, p.y-1, p.t+1});
        }
    }
    return 0;
}

Submission Info

Judge Result