Submission #1401960

---

Source Code Expand

#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define int long long
using namespace std;
const int INF=1000000007;
typedef pair<int,int> P;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
char mp[100][100];

signed main(){
  int r,c,sy,sx,gy,gx;
  cin>>r>>c>>sy>>sx>>gy>>gx;
  sy--;sx--;gy--;gx--;
  rep(i,r)rep(j,c)cin>>mp[i][j];
  int d[r][c];
  rep(i,r)rep(j,c)d[i][j]=INF;
  queue<P> que;
  que.push((P(sy,sx)));
  d[sy][sx]=0;
  int ans;
  while(que.size()){
    P p=que.front();
    que.pop();
    int y=p.first,x=p.second;
    if(y==gy&&x==gx){
      ans=d[y][x];
      break;
    }
    rep(i,4){
      int ny=y+dy[i],nx=x+dx[i];
      if(0<=ny&&ny<r&&0<=nx&&nx<c&&d[ny][nx]==INF&&mp[ny][nx]!='#'){
	d[ny][nx]=d[y][x]+1;
	que.push(P(ny,nx));
      }
    }
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result