Submission #4306503

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef pair<int,int> P;
int main(){
    int r,c,sy,sx,gy,gx,i,j,x,y,inf=1<<9;
    cin >> r >> c >> sy >> sx >> gy >> gx;
    sy--;sx--;gy--;gx--;
    char maze[r][c];
    int dis[r][c];
    int dx[4]={-1,1,0,0};
    int dy[4]={0,0,1,-1};
    for(i=0;i<r;i++){
        for(j=0;j<c;j++){
            cin >> maze[i][j];
            dis[i][j]=inf;
        }
    } 

    queue<pair<int,int> > q;
    q.push(P(sy,sx));
    dis[sy][sx]=0;

    while(!q.empty()){
        P p=q.front();
        q.pop();
        if(p.first==gy && p.second==gx) break;
        for(i=0;i<4;i++){
            y=p.first+dy[i];
            x=p.second+dx[i];
            if(y>=0&&y<r&&x>=0&&x<c&&maze[y][x]=='.'&&dis[y][x]==inf){
                q.push(P(y,x));
                dis[y][x]=dis[p.first][p.second]+1;
            }
        }
    }
    cout << dis[gy][gx] << endl;
    return 0;
}

Submission Info

Judge Result