Submission #691221

---

Source Code Expand

#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()

using namespace std;

string str[64];
int dist[64][64];

const int dy[4] = {0, 1, 0, -1};
const int dx[4] = {1, 0, -1, 0};

int main() {
  int H, W;
  cin >> H >> W;
  int sy, sx, gy, gx;
  cin >> sy >> sx >> gy >> gx;
  REP(i,H) cin >> str[i];
  memset(dist, -1, sizeof(dist));
  queue<pair<int,int>> que;
  que.push(make_pair(sy-1, sx-1));
  dist[sy-1][sx-1] = 0;
  while (!que.empty()) {
    int y, x;
    tie(y, x) = que.front();
    que.pop();
    if (str[y][x] == '#') continue;
    REP(i,4) {
      int ny = y + dy[i];
      int nx = x + dx[i];
      if (dist[ny][nx] != -1) continue;
      dist[ny][nx] = dist[y][x] + 1;
      que.push(make_pair(ny, nx));
    }
  }
  cout << dist[gy-1][gx-1] << endl;
  return 0;
}

Submission Info

Judge Result