Submission #921043

---

Source Code Expand

#include<iostream>
#include<string.h>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> P;

int main()
{
  int r,c;
  int i,j,k;
  int sx,sy;
  int gx,gy;
  int reached[60][60]={};
  char a[60][60];
  int dx[4]={0,1,0,-1};
  int dy[4]={1,0,-1,0};

  cin>>r>>c;
  cin>>sy>>sx;
  cin>>gy>>gx;
  sx--;
  sy--;
  gx--;
  gy--;

  rep(i,r)rep(j,c)
    cin>>a[i][j];

  queue<P> q1;
  queue<P> q2;

  q1.push(P(sx,sy));

  rep(k,300){
    while(q1.size()){
      int x=q1.front().first;
      int y=q1.front().second;
      rep(i,4){
	if(x+dx[i]<0 || x+dx[i]>=c || y+dy[i]<0 || y+dy[i]>=r)continue;
	if(a[y+dy[i]][x+dx[i]]=='.' && reached[y+dy[i]][x+dx[i]]==0){
	  q2.push(P(x+dx[i],y+dy[i]));
	  reached[y+dy[i]][x+dx[i]]=k;
	}
      }
      q1.pop();
    }
    if(reached[gy][gx])break;
    while(q2.size()){
      q1.push(P(q2.front().first,q2.front().second));
      q2.pop();
    }
  }
  cout<<reached[gy][gx]+1<<endl;
}

Submission Info

Judge Result