Submission #1714765

---

Source Code Expand

#include <bits/stdc++.h>
#define p pair<int, int>
using namespace std;

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

int main(){

  int r, c;
  int sy, sx;
  int gy, gx;
  int dist[55][55];
  string mp[55];

  cin >> r >> c;
  cin >> sy >> sx >> gy >> gx;
  sy--; sx--;
  gy--; gx--;
  for(int i = 0; i < r; i++) cin >> mp[i];
  for(int i = 0; i < 55; i++){
    for(int j = 0; j < 55; j++){
      dist[i][j] = -1;
    }
  }

  queue<p> que;
  que.push(p(sx, sy));
  dist[sx][sy] = 0;
  while(!que.empty()){
    p cur = que.front(); que.pop();
    for(int i = 0; i < 4; i++){
      int nx = cur.first + dx[i];
      int ny = cur.second + dy[i];
      if(mp[ny][nx] != '#' && dist[nx][ny] == -1){
        dist[nx][ny] = dist[cur.first][cur.second] + 1;
        que.push(p(nx, ny));
      }
    }
  }
  cout << dist[gx][gy] << endl;
  return 0;
}

Submission Info

Judge Result