Submission #1963764

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
using namespace std;
int main(){
    int r,c;
    cin>>r>>c;
    int sy,sx;
    cin>>sy>>sx;
    int gy,gx;
    cin>>gy>>gx;
    char s[60][60]={};
    for(int i = 0;i<r;i++){
        for(int j = 0;j<c;j++){
            cin>>s[i][j];
        }
    }
    int l[60][60]={-1};
    int nx=sx-1;
    int ny=sy-1;
    int vx[4]={0,1,0,-1};
    int vy[4]={1,0,-1,0};
    queue<int>xq;
    queue<int>yq;
    xq.push(nx);
    yq.push(ny);
    while((!xq.empty())&&(!yq.empty())){
        nx=xq.front();
        ny=yq.front();
        int nl=l[nx][ny];
        xq.pop();
        yq.pop();
        for(int j = 0;j<4;j++){
            if((s[nx+vx[j]][ny+vy[j]]=='.')&&(l[nx+vx[j]][ny+vy[j]]==-1)){
                xq.push(nx+vx[j]);
                yq.push(ny+vy[j]);
                l[nx+vx[j]][ny+vy[j]]=nl+1;
            }
        }
        
    }
    cout<<l[gx-1][gy-1]<<endl;
}

Submission Info

Judge Result