Submission #1678322

---

Source Code Expand

#include <iostream>
#include <deque>
#include <vector>
#include <string>

int main(int argc, char const *argv[]) {

  int R, C;
  int sy, sx;
  int gy, gx;
  std::vector< std::vector<int> > field = *new std::vector<std::vector<int> >();

  std::cin >> R >> C;
  std::cin >> sy >> sx;
  std::cin >> gy >> gx;

  for(int r = 0; r < R; r++){
    std::vector<int> row = *new std::vector<int>();
    for(int c = 0; c < C; c++){
      char inp;
      std::cin >> inp;
      if(sy - 1 == r && sx - 1 == c){
        row.push_back(0);
      } else if(inp == '#'){
        row.push_back(-2);
      }else{
        row.push_back(-1);
      }
    }
    field.push_back(row);
  }

  std::deque<int> index_queue = *new std::deque<int>();
  index_queue.push_back((sy - 1) * C + (sx - 1));

  while(index_queue.size() > 0){
    int index = index_queue.front();
    index_queue.pop_front();

    int val = field[index / C][index % C];
    if(index / C == gy - 1 && index % C == gx - 1){
      std::cout << val << '\n';
      return 0;
    }

    if(index % C != 0){ //Not Most Left
      int left = index - 1;
      if(field[left / C][left % C] == -1){
        field[left / C][left % C] = val + 1;
        index_queue.push_back(left);
      }
    }

    if(index % C != C - 1){ //Not Most right
      int right = index + 1;
      if(field[right / C][right % C] == -1){
        field[right / C][right % C] = val + 1;
        index_queue.push_back(right);
      }
    }

    if(index >= C){ //Not Most Upper
      int upper = index - C;
      if(field[upper / C][upper % C] == -1){
        field[upper / C][upper % C] = val + 1;
        index_queue.push_back(upper);
      }
    }

    if(index < C * (R - 1)){ //Not Most lower
      int lower = index + C;
      if(field[lower / C][lower % C] == -1){
        field[lower / C][lower % C] = val + 1;
        index_queue.push_back(lower);
      }
    }
    //return 0;
  }

  return 0;
}

Submission Info

Judge Result