Submission #4626859

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define push_pair(a,b) push(make_pair((a),(b)))
#define pp(a,b) push_pair(a,b)
#define ff front().first
#define fs front().second
#define rep(i,n) for(int i=0;i<n;++i)

int main(){
  int h,w,sx,sy,gx,gy;
  cin>>h>>w>>sy>>sx>>gy>>gx;
  sx--,sy--,gx--,gy--;
  string board[h];
  rep(i,h)cin>>board[i];
  queue<pair<int,int>> pos;
  bool visited[h][w]={false};
  int score[h][w];
  int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
  pos.pp(sy,sx);
  visited[sy][sx]=true;
  rep(i,h)rep(j,w)score[i][j]=1e9+7;
  score[sy][sx]=0;
  while(true){
    rep(i,4){
      int py=pos.ff+dy[i],px=pos.fs+dx[i];
      if( board[py][px]=='#' )continue;
      if( visited[py][px] )continue;
      pos.pp(py,px);
      score[py][px]=min( score[py][px],score[py-dy[i]][px-dx[i]]+1 );
      visited[py][px]=true;
      if(py==gy&&px==gx){
        cout<<score[py][px]<<endl;
        return 0;
      }
    }
    pos.pop();
  }

  return 0;
}

Submission Info

Judge Result