Submission #1511743

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define FOR(I,A,B) for(int i=A;i<B;i++)
#define INF 1000000

int r,c,sx,sy,gx,gy;
int dx[]={-1,0,1,0},dy[]={0,-1,0,1};
int d[1000][1000];
char maze[1000][1000];

int bfs(){
    FOR(i,1,r+1){
        for(int j=1;j<c+1;j++){
            d[i][j]=INF;
        }
    }
    queue<P> que;
    que.push(P(sx,sy));
    d[sx][sy]=0;
    while(que.size()){
        P p=que.front();que.pop();
        if(p.first==gx&&p.second==gy) break;
        FOR(i,0,4){
            int nx=p.first+dx[i];
            int ny=p.second+dy[i];
            if(0<=nx&&nx<r&&0<=ny&&ny<c&&maze[nx][ny]!='#'&&d[nx][ny]==INF){
                que.push(P(nx,ny));
                d[nx][ny]=d[p.first][p.second]+1;
            }
        }
    }
    return d[gx][gy];
}

int main(void){
    cin>>r>>c>>sx>>sy>>gx>>gy;
    FOR(i,1,r+1){
        for(int j=1;j<c+1;j++){
            cin>>maze[i][j];
        }
    }
    int res=bfs();
    cout<<res<<endl;
    return 0;
}

Submission Info

Judge Result