Submission #2693384

---

Source Code Expand

#include <iostream>
#include <array>
#include <queue>
#include <vector>
#include <utility>
using namespace std;

int main() {
  int R, C;
  cin >> R >> C;

  int sy, sx;
  cin >> sy >> sx;

  int gy, gx;
  cin >> gy >> gx;

  array<array<char, 51>, 51> maze = {};
  for (int i = 0; i < 51; ++i) {
    for (int j = 0; j < 51; ++j) {
      maze[i][j] = '#';
    }
  }

  for (int i = 1; i <= R; ++i) {
    for (int j = 1; j <= C; ++j) {
      cin >> maze[i][j];
    }
  }


  vector<pair<int, int>> moves;
  moves.emplace_back(0, 1);
  moves.emplace_back(0, -1);
  moves.emplace_back(1, 0);
  moves.emplace_back(-1, 0);

  array<array<int, 51>, 51> walks;
  for(int i = 0; i < 51; ++i) {
    for (int j = 0; j < 51; ++j) {
      walks[i][j] = -1;
    }
  }

  queue<pair<int, int>> que;
  que.emplace(sy, sx);
  walks[sy][sx] = 0;

  while(!que.empty()) {
    int y = que.front().first;
    int x = que.front().second;
    que.pop();

    if (y == gy && x == gx) {
      cout << walks[y][x] << endl;
      return 0;
    }

    for (auto move : moves) {
      int my = y + move.first;
      int mx = x + move.second;
      if (0 <= my && my <= R && 0 <= mx && mx <= C && maze[my][mx] == '.' && walks[my][mx] == -1) {
        que.emplace(my, mx);
        walks[my][mx] = walks[y][x] + 1;
      }
    }
  }
}

Submission Info

Judge Result