Submission #3772609

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int R,C;
int S[2],G[2];
char Map[50][50];
int Num[50][50] = {{}};
typedef pair<int,int> P;
P p;

int d[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};

int solve(int i,int j){
    queue<P> que;
    que.push(P(i,j));
    while(que.size()!=0){
        p = que.front();
        if(p.first==G[0] && p.second==G[1]) return Num[p.first][p.second];
        que.pop();
        for(int i=0;i<4;i++){
            int x = p.first +  d[i][0];
            int y = p.second + d[i][1];
            if(x>=0 && x<R && y>=0 && y<C && Num[x][y]==0){
                if(Map[x][y] == '.'){
                    que.push(P(x,y));
                    Num[x][y] = Num[p.first][p.second] + 1;
                }
            }
        }
    }
}

int main(){
    cin >> R >> C;
    cin >> S[0] >> S[1] >> G[0] >> G[1];
    for(int i=0;i<R;i++){
        for(int j=0;j<C;j++) cin >> Map[i][j];
    }
    cout << solve(S[0],S[1]) << endl;
    return 0;
}

Submission Info

Judge Result