Submission #11591187

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) b.rbegin(),v.rend()
typedef long long ll;
typedef pair<int,int> pint;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};

//isPrime
//modpow modinv
//getDigit
int main() {
  cout << fixed << setprecision(10);
  int r,c;
  cin >> r >> c;
  int sy,sx,gy,gx;
  cin >> sy >> sx >> gy >> gx;
  sy--; sx--; gy--; gx--;
  vector<string> mp(r);
  rep(i,r) cin >> mp.at(i);

  vector<vector<int>> dist(r,vector<int>(c,-1));
  dist.at(sy).at(sx)=0;
  queue<pint> que;
  que.push(make_pair(sy,sx));
  while(!que.empty()){
    pint cur = que.front(); que.pop();
    int y = cur.first;
    int x = cur.second;
    for(int dir = 0; dir<4; dir++){
      int ny = y+dy[dir];
      int nx = x+dx[dir];
      if(ny<0||nx<0||ny>=r||nx>=c) continue;
      if(mp.at(ny).at(nx)=='#') continue;
      if(dist.at(ny).at(nx)!=-1) continue;
      dist.at(ny).at(nx)=dist.at(y).at(x)+1;
      que.push(make_pair(ny,nx));
    }
  }
  cout << dist[gy][gx] << endl;;
}

Submission Info

Judge Result