Problem p02579 (C++) — buggy submission, verdict: Runtime Error

/*** Template Begin ***/

#pragma region template

#define USING_NAMESPACE

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

typedef int64_t i64;
typedef uint64_t u64;

auto init_ = [] {
  std::ios_base::sync_with_stdio(false);
  std::cout << std::fixed;
  return 0;
}();

template <typename T> inline void in(T &x) { std::cin >> x; }

template <typename T, typename... Ts> inline void in(T &t, Ts &...ts) {
  std::cin >> t;
  in(ts...);
}

template <typename T, typename U = std::vector<T>> inline U vin(int n) {
  U v(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> v[i];
  }
  return v;
}

template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
  V vv(h, U(w));
  for (int i = 0; i < h; ++i) {
    for (int j = 0; j < w; ++j) {
      std::cin >> vv[i][j];
    }
  }
  return vv;
}

template <typename T> inline void out(const T &x) {
  std::cout << x << std::endl;
}

template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &...ts) {
  std::cout << t << delimiter;
  out(ts...);
}

template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
  for (int i = 0; i < n; ++i) {
    if (i)
      std::cout << delimiter;
    std::cout << v[i];
  }
  std::cout << std::endl;
}

template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
  for (int i = 0; i < h; ++i) {
    for (int j = 0; j < w; ++j) {
      if (j)
        std::cout << delimiter;
      std::cout << v[i][j];
    }
    std::cout << std::endl;
  }
}

template <typename T, size_t D> struct multi_vector_type {
  using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};

template <typename T> struct multi_vector_type<T, 1> {
  using type = std::vector<T>;
};

template <typename T> struct multi_vector_type<T, 0> {
  using type = T;
};

template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;

template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
  return val;
}

template <typename T, size_t D = 1, typename... Ts,
          class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&...args) {
  return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}

namespace detail {

template <typename F> struct Debug {
  const char *delim_ = "\\n";
  F fun;

  Debug(F f) : fun(f) {}

  ~Debug() { fun(delim_); }

  Debug &delim(const char *d) {
    delim_ = d;
    return *this;
  }
};

std::deque<std::string> split(const std::string &s, char c) {
  std::deque<std::string> v;
  std::stringstream ss(s);
  std::string x;
  while (std::getline(ss, x, c))
    v.emplace_back(x);
  return v;
}

template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
  std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a << '\\n';
  std::cerr << std::flush;
}

template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
  std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
            << delim;
  v.pop_front();
  deb(delim, std::move(v), args...);
}

template <typename... Args> auto wrap(std::deque<std::string> v, Args... args) {
  auto f = [=](const char *delim = "\\n") { deb(delim, v, args...); };

  return Debug<decltype(f)>(f);
}
} // namespace detail

#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)

#ifdef USING_BOOST

#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>

inline auto rep(int begin, int end) {
  if (begin > end) {
    return boost::irange(0, 0);
  } else {
    return boost::irange(begin, end);
  }
}

inline auto rep(int begin, int end, int step) {
  if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
    return boost::irange(0, 0, step);
  } else {
    return boost::irange(begin, end, step);
  }
}

#endif

#ifdef USING_NAMESPACE
using namespace std;

#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif

#pragma endregion

/*** Template End ***/

int main() {
  int h, w;
  in(h, w);

  int ch, cw;
  int dh, dw;

  in(ch, cw);
  in(dh, dw);

  ch--;
  cw--;
  dh--;
  dw--;

  auto in_maze = [&](int y, int x) {
    return 0 <= x && x < w && 0 <= y && y < h;
  };

  auto s = vin<string>(h);

  const int inf = 100000000;

  auto cost = make_vector<int, 2>(h, w, inf);

  deque<pair<int, int>> que; // (y, x)

  que.emplace_back(ch, cw);
  cost[ch][cw] = 0;

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

  while (!que.empty()) {
    auto p = que.front();
    que.pop_front();

    if (p.first == dh && p.second == dw) {
      break;
    }

    int c = cost[p.first][p.second];

    for (int k = 0; k < 4; k++) {
      int nx = p.second + dx[k];
      int ny = p.first + dy[k];
      if (in_maze(ny, nx) && s[ny][nx] == '.' && cost[ny][nx] > c) {
        que.emplace_front(ny, nx);
        cost[ny][nx] = c;
      }
    }

    for (int dx = -2; dx <= 2; dx++) {
      for (int dy = -2; dy <= 2; dy++) {
        int nx = p.second + dx;
        int ny = p.first + dy;

        if (in_maze(ny, nx) && s[ny][nx] == '.' && cost[ny][nx] > c) {
          que.emplace_back(ny, nx);
          cost[ny][nx] = c + 1;
        }
      }
    }
  }

  if (cost[dh][dw] != inf) {
    out(cost[dh][dw]);
  } else {
    out(-1);
  }
}

Error: -11

Fixed submission:

/*** Template Begin ***/

#pragma region template

#define USING_NAMESPACE

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

typedef int64_t i64;
typedef uint64_t u64;

auto init_ = [] {
  std::ios_base::sync_with_stdio(false);
  std::cout << std::fixed;
  return 0;
}();

template <typename T> inline void in(T &x) { std::cin >> x; }

template <typename T, typename... Ts> inline void in(T &t, Ts &...ts) {
  std::cin >> t;
  in(ts...);
}

template <typename T, typename U = std::vector<T>> inline U vin(int n) {
  U v(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> v[i];
  }
  return v;
}

template <typename T, typename U = std::vector<T>, typename V = std::vector<U>>
inline V vin(int h, int w) {
  V vv(h, U(w));
  for (int i = 0; i < h; ++i) {
    for (int j = 0; j < w; ++j) {
      std::cin >> vv[i][j];
    }
  }
  return vv;
}

template <typename T> inline void out(const T &x) {
  std::cout << x << std::endl;
}

template <char delimiter = ' ', typename T, typename... Ts>
inline void out(const T &t, const Ts &...ts) {
  std::cout << t << delimiter;
  out(ts...);
}

template <char delimiter = ' ', typename T>
inline void vout(const T &v, int n) {
  for (int i = 0; i < n; ++i) {
    if (i)
      std::cout << delimiter;
    std::cout << v[i];
  }
  std::cout << std::endl;
}

template <char delimiter = ' ', typename T>
inline void vout(const T &v, int h, int w) {
  for (int i = 0; i < h; ++i) {
    for (int j = 0; j < w; ++j) {
      if (j)
        std::cout << delimiter;
      std::cout << v[i][j];
    }
    std::cout << std::endl;
  }
}

template <typename T, size_t D> struct multi_vector_type {
  using type = std::vector<typename multi_vector_type<T, D - 1>::type>;
};

template <typename T> struct multi_vector_type<T, 1> {
  using type = std::vector<T>;
};

template <typename T> struct multi_vector_type<T, 0> {
  using type = T;
};

template <typename T, size_t D>
using multi_vector = typename multi_vector_type<T, D>::type;

template <typename T, size_t D, class = typename std::enable_if<D == 0>::type>
T make_vector(const T &val = T()) {
  return val;
}

template <typename T, size_t D = 1, typename... Ts,
          class = typename std::enable_if<D != 0>::type>
multi_vector<T, D> make_vector(size_t n, Ts &&...args) {
  return multi_vector<T, D>(n, make_vector<T, D - 1>(args...));
}

namespace detail {

template <typename F> struct Debug {
  const char *delim_ = "\\n";
  F fun;

  Debug(F f) : fun(f) {}

  ~Debug() { fun(delim_); }

  Debug &delim(const char *d) {
    delim_ = d;
    return *this;
  }
};

std::deque<std::string> split(const std::string &s, char c) {
  std::deque<std::string> v;
  std::stringstream ss(s);
  std::string x;
  while (std::getline(ss, x, c))
    v.emplace_back(x);
  return v;
}

template <typename T>
void deb(const char *delim, std::deque<std::string> v, T a) {
  std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a << '\\n';
  std::cerr << std::flush;
}

template <typename T, typename... Args>
void deb(const char *delim, std::deque<std::string> v, T a, Args... args) {
  std::cerr << v[0].substr(v[0][0] == ' ', v[0].length()) << " = " << a
            << delim;
  v.pop_front();
  deb(delim, std::move(v), args...);
}

template <typename... Args> auto wrap(std::deque<std::string> v, Args... args) {
  auto f = [=](const char *delim = "\\n") { deb(delim, v, args...); };

  return Debug<decltype(f)>(f);
}
} // namespace detail

#define debug(args...) ::detail::wrap(::detail::split(#args, ','), args)

#ifdef USING_BOOST

#include <boost/math/common_factor.hpp>
#include <boost/range.hpp>
#include <boost/range/adaptors.hpp>
#include <boost/range/algorithm.hpp>
#include <boost/range/algorithm_ext.hpp>
#include <boost/range/irange.hpp>
#include <boost/range/numeric.hpp>

inline auto rep(int begin, int end) {
  if (begin > end) {
    return boost::irange(0, 0);
  } else {
    return boost::irange(begin, end);
  }
}

inline auto rep(int begin, int end, int step) {
  if ((step > 0 && begin > end) || (step < 0 && begin < end)) {
    return boost::irange(0, 0, step);
  } else {
    return boost::irange(begin, end, step);
  }
}

#endif

#ifdef USING_NAMESPACE
using namespace std;

#ifdef USING_BOOST
using namespace boost;
using namespace boost::adaptors;
#endif
#endif

#pragma endregion

/*** Template End ***/

int main() {
  int h, w;
  in(h, w);

  int ch, cw;
  int dh, dw;

  in(ch, cw);
  in(dh, dw);

  ch--;
  cw--;
  dh--;
  dw--;

  auto in_maze = [&](int y, int x) { return 0 <= x < w && 0 <= y < h; };

  auto s = vin<string>(h);

  const int inf = 100000000;

  auto cost = make_vector<int, 2>(h, w, inf);

  deque<pair<int, int>> que; // (y, x)

  que.emplace_back(ch, cw);
  cost[ch][cw] = 0;

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

  while (!que.empty()) {
    auto p = que.front();
    que.pop_front();

    if (p.first == dh && p.second == dw) {
      break;
    }

    int c = cost[p.first][p.second];

    for (int k = 0; k < 4; k++) {
      int nx = p.second + dx[k];
      int ny = p.first + dy[k];

      if (in_maze(ny, nx) && s[ny][nx] == '.' && cost[ny][nx] > c) {
        que.emplace_front(ny, nx);
        cost[ny][nx] = c;
      }
    }

    for (int dx = -2; dx <= 2; dx++) {
      for (int dy = -2; dy <= 2; dy++) {
        int nx = p.second + dx;
        int ny = p.first + dy;

        if (in_maze(ny, nx) && s[ny][nx] == '.' && cost[ny][nx] > c) {
          que.emplace_back(ny, nx);
          cost[ny][nx] = c + 1;
        }
      }
    }
  }

  if (cost[dh][dw] != inf) {
    out(cost[dh][dw]);
  } else {
    out(-1);
  }
}