Submission #1814628

---

Source Code Expand

#include <iostream>
#include <queue>
#include <utility>
using namespace std;
int main(){
    queue<int> qx;
    queue<int> qy;
    int r,c;
    cin>>r>>c;
    int sy,sx,gy,gx;
    cin>>sy>>sx>>gy>>gx;
    
    char maze[60][60];
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            cin>>maze[i][j];
        }
    }
    
    int mazea[60][60]={};
    int mazeb[60][60]={};
    qx.push(sx-1);
    qy.push(sy-1);
    int i=1;
    while(!qx.empty()){
        int x,y;
        x=qx.front();
        y=qy.front();
        //cout<<y<<" "<<x<<endl;
        qx.pop();
        qy.pop();
        if(maze[y][x+1]=='.'&&mazeb[y][x+1]==0){
            qx.push(x+1);
            qy.push(y);
            mazea[y][x+1]=mazea[y][x]+1;
        }
        if(maze[y][x-1]=='.'&&mazeb[y][x-1]==0){
            qx.push(x-1);
            qy.push(y);
            mazea[y][x-1]=mazea[y][x]+1;
        }
        if(maze[y+1][x]=='.'&&mazeb[y+1][x]==0){
            qx.push(x);
            qy.push(y+1);
            mazea[y+1][x]=mazea[y][x]+1;
        }
        if(maze[y-1][x]=='.'&&mazeb[y-1][x]==0){
            qx.push(x);
            qy.push(y-1);
            mazea[y-1][x]=mazea[y][x]+1;
        }
        mazeb[y][x]=i;
        i++;
    }
    cout<<mazea[gy-1][gx-1]<<endl;
    return 0;
}

Submission Info

Judge Result