Submission #3972216

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

char maze[55][55];
int d[55][55];
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int INF = (1 << 10);

int main() {
  int R, C, sy, sx, gy, gx;
  cin >> R >> C >> sy >> sx >> gy >> gx;
  sy--; sx--; gy--; gx--;
  for (int r = 0; r < R; r++) {
    for (int c = 0; c < C; c++) {
      cin >> maze[r][c];
      d[r][c] = INF;
    }
  }
  queue<pair<int, int>> que;
  que.push(make_pair(sy, sx));
  d[sy][sx] = 0;

  while (que.size()) {
    auto p = que.front(); que.pop();
    if (p.first == gy && p.second == gx) break;
    for (int i = 0; i < 4; i++) {
      int ny = p.first + dy[i], nx = p.second + dx[i];
      if (0 <= ny && ny < R && 0 <= nx && nx < C && maze[ny][nx] != '#' && d[ny][nx] == INF) {
        que.push(make_pair(ny, nx));
        d[ny][nx] = d[p.first][p.second] + 1;
      }
    }
  }
  cout << d[gy][gx] << endl;
}

Submission Info

Judge Result