Submission #1690248

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
int mz[52][52];
int dp[52][52];
int r,c,sx,sy,gx,gy,nx,ny,ans=0;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
queue<int> qx,qy;
string s;
int main(){
  cin>>r>>c;
  cin>>sy>>sx;
  cin>>gy>>gx;
  for(int i=0;i<r;i++){
    cin>>s;
    for(int j=0;j<c;j++){
      if(s[j]=='.')mz[i][j]=0;
      else mz[i][j]=1;
    }
  }
  qx.push(sx-1);qy.push(sy-1);
  while(!qx.empty()){
    nx=qx.front();qx.pop();
    ny=qy.front();qy.pop();
    for(int i=0;i<4;i++){
      int qqx=nx+dx[i];
      int qqy=ny+dy[i];
      if(qqx>=0 && qqy>=0 && qqx<c && qqy<r && mz[qqy][qqx]==0 && dp[qqy][qqx]==0){
	dp[qqy][qqx]=dp[ny][nx]+1;
	qx.push(qqx);qy.push(qqy);
      }
    }
  }
 
  cout<<dp[gy-1][gx-1]<<endl;
  return 0;
}

Submission Info

Judge Result