Submission #1727692

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main(void) {
  int r,c;
  int sy,sx,gy,gx;
  cin >> r >> c >> sy >> sx >> gy >> gx;
  sy--;sx--;gy--;gx--;
  vector<string> gd(r);
  for (int i=0;i<r;i++) cin >> gd[i];

  queue<pair<int,int>> q;
  q.emplace(sy,sx);
  int dx[] = {0, 1, 0 ,-1}, dy[] = {1, 0, -1, 0};
  int dist[51][51];
  memset(dist, -1, sizeof(dist));
  dist[sy][sx] = 0;
  while(!q.empty()) {
    int x,y;
    tie(y, x) = q.front();q.pop();
    for (int i=0;i<4;i++) {
      int nx = x + dx[i];
      int ny = y + dy[i];
      if (dist[ny][nx] != -1) continue;
      if (gd[ny][nx] == '.') {
        dist[ny][nx] = dist[y][x] + 1;
        q.emplace(ny, nx);
      }
    }
  }
  cout << dist[gy][gx] << endl;
  return 0;
}

Submission Info

Judge Result