Submission #3417398

---

Source Code Expand

#include <iostream>
#include <queue>
using namespace std;

struct position{
  int cx;
  int cy;
};

queue <struct position> q;

void initialize(int sx, int sy){
  struct position current;
  current.cx = sx;
  current.cy = sy;
  q.push(current);
}

void nextcheck(char maze[52][52], int ans[52][52], int *x){
  if(q.empty() == 1){
    *x = 1;
    return;
  }
  struct position current = q.front();
  struct position next;

  if(maze[current.cx +1][current.cy] == '.'){
    next.cx = current.cx + 1; next.cy = current.cy;
    ans[next.cx][next.cy] = ans[current.cx][current.cy] + 1;
    q.push(next);
  }
  if(maze[current.cx][current.cy+1] == '.'){
    next.cx = current.cx; next.cy = current.cy + 1;
    ans[next.cx][next.cy] = ans[current.cx][current.cy] + 1;
    q.push(next);
  }
  if(maze[current.cx-1][current.cy] == '.'){
    next.cx = current.cx - 1; next.cy = current.cy;
    ans[next.cx][next.cy] = ans[current.cx][current.cy] + 1;
    q.push(next);
  }
  if(maze[current.cx][current.cy-1] == '.'){
    next.cx = current.cx; next.cy = current.cy - 1;
    ans[next.cx][next.cy] = ans[current.cx][current.cy] + 1;
    q.push(next);
  }
  maze[current.cx][current.cy] = '#';
  q.pop();
}

int main(void){
  int R, C, sy, sx, gy, gx, flag=0, i, j;
  cin >> R >> C;
  cin >> sy >> sx;
  cin >> gy >> gx;
  char maze[52][52];
  int ans[52][52];
  for(i=1; i<=R; i++){
    for(j=1; j<=C; j++){
      cin >> maze[i][j];
      ans[i][j] = 0;
    }
  }
  initialize(sx, sy);
  while(1){
    nextcheck(maze, ans, &flag);
    if(flag == 1) break;
  }
  cout << ans[gy][gx] << "\n";
  return 0;
}

Submission Info

Judge Result