Submission #3689333

---

Source Code Expand

#include<iostream>
#include<queue>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
char cp[101][101];
int r,c,sy,sx,gy,gx;
int score[101][101];
bool use[101][101];
int dx[]={-1,1,0,0},dy[]={0,0,-1,1};
void bfs(int i,int j){
    queue<pair<int,int> >Q;
    score[i][j]=0;
    Q.push(make_pair(i,j));
    while(!Q.empty()){
        pair<int,int> q=Q.front();
        Q.pop();
        int x=q.first,y=q.second;
        rep(k,4){
            int a=x+dx[k];
            int b=y+dy[k];
            if(cp[a][b]=='#'||use[a][b])continue;
            score[a][b]=score[x][y]+1;
            use[a][b]=true;
            Q.push(make_pair(a,b));
        }
    }
}
int main(){
    cin>>r>>c>>sy>>sx>>gy>>gx;
    rep(i,r)rep(j,c)cin>>cp[i][j];
    bfs(sy-1,sx-1);
    cout<<score[gy-1][gx-1]<<endl;
    return 0;
}

Submission Info

Judge Result