Problem p03053 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
using ll = long long;

#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no)                                                   \
  { cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond &&mes)

constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;

template <typename T> T round_up(const T &a, const T &b) {
  return (a + (b - 1)) / b;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
  os << p.first << p.second;
  return os;
}

template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  REP(i, (int)v.size()) is >> v[i];
  return is;
}

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
  REP(i, (int)v.size()) os << v[i] << endl;
  return os;
}

template <typename T> T clamp(T &n, T a, T b) {
  if (n < a)
    n = a;
  if (n > b)
    n = b;
  return n;
}

template <typename T> static T GCD(T u, T v) {
  T r;
  while (v != 0) {
    r = u % v;
    u = v;
    v = r;
  }
  return u;
}

template <typename T> static T LCM(T u, T v) { return u / GCD(u, v) * v; }

std::vector<int> enum_div(int n) {
  std::vector<int> ret;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i != 1 && i * i != n) {
        ret.push_back(n / i);
      }
    }
  }
  return ret;
}

template <typename T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

struct ToUpper {
  char operator()(char c) { return toupper(c); }
};

struct ToLower {
  char operator()(char c) { return tolower(c); }
};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);

  int H, W;
  cin >> H >> W;
  vector<vector<int>> field(H, vector<int>(W, -1));
  queue<pair<int, int>> q;

  REP(h, H) {
    string S;
    cin >> S;
    REP(w, W) {
      if (S[w] == '#') {
        field[h][w] = 0;
        q.push({w, h});
      }
    }
  }

  auto solve = [&]() {
    int ans = 0;

    while (!q.empty()) {
      pair<int, int> p = q.front();
      q.pop();
      if (p.first - 1 >= 0 && field[p.second][p.first - 1] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second][p.first - 1] = n;
        chmax(ans, n);
        q.push({p.first - 1, p.second});
      }

      if (p.first + 1 < W && field[p.second][p.first + 1] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second][p.first + 1] = n;
        chmax(ans, n);
        q.push({p.first + 1, p.second});
      }

      if (p.second - 1 >= 0 && field[p.second - 1][p.first] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second - 1][p.first] = n;
        chmax(ans, n);
        q.push({p.first, p.second - 1});
      }

      if (p.second + 1 < W && field[p.second + 1][p.first] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second + 1][p.first] = n;
        chmax(ans, n);
        q.push({p.first, p.second + 1});
      }
    }
    return ans;
  };

  cout << solve() << endl;

  return 0;
}

Fixed submission:
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
using ll = long long;

#define REP(i, a) for (int i = 0; i < (a); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SIZE(obj) (int)(obj).sizeT()
#define YESNO(cond, yes, no)                                                   \
  { cout << ((cond) ? (yes) : (no)) << endl; }
#define SORT(list) sort(ALL((list)));
#define RSORT(list) sort((list).rbegin(), (list).rend())
#define ASSERT(cond, mes) assert(cond &&mes)

constexpr int MOD = 1'000'000'007;
constexpr int INF = 1'050'000'000;

template <typename T> T round_up(const T &a, const T &b) {
  return (a + (b - 1)) / b;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
  os << p.first << p.second;
  return os;
}

template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  REP(i, (int)v.size()) is >> v[i];
  return is;
}

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
  REP(i, (int)v.size()) os << v[i] << endl;
  return os;
}

template <typename T> T clamp(T &n, T a, T b) {
  if (n < a)
    n = a;
  if (n > b)
    n = b;
  return n;
}

template <typename T> static T GCD(T u, T v) {
  T r;
  while (v != 0) {
    r = u % v;
    u = v;
    v = r;
  }
  return u;
}

template <typename T> static T LCM(T u, T v) { return u / GCD(u, v) * v; }

std::vector<int> enum_div(int n) {
  std::vector<int> ret;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i != 1 && i * i != n) {
        ret.push_back(n / i);
      }
    }
  }
  return ret;
}

template <typename T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

struct ToUpper {
  char operator()(char c) { return toupper(c); }
};

struct ToLower {
  char operator()(char c) { return tolower(c); }
};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);

  int H, W;
  cin >> H >> W;
  vector<vector<int>> field(H, vector<int>(W, -1));
  queue<pair<int, int>> q;

  REP(h, H) {
    string S;
    cin >> S;
    REP(w, W) {
      if (S[w] == '#') {
        field[h][w] = 0;
        q.push({w, h});
      }
    }
  }

  auto solve = [&]() {
    int ans = 0;

    while (!q.empty()) {
      pair<int, int> p = q.front();
      q.pop();
      if (p.first - 1 >= 0 && field[p.second][p.first - 1] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second][p.first - 1] = n;
        chmax(ans, n);
        q.push({p.first - 1, p.second});
      }

      if (p.first + 1 < W && field[p.second][p.first + 1] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second][p.first + 1] = n;
        chmax(ans, n);
        q.push({p.first + 1, p.second});
      }

      if (p.second - 1 >= 0 && field[p.second - 1][p.first] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second - 1][p.first] = n;
        chmax(ans, n);
        q.push({p.first, p.second - 1});
      }

      if (p.second + 1 < H && field[p.second + 1][p.first] < 0) {
        int n = field[p.second][p.first] + 1;
        field[p.second + 1][p.first] = n;
        chmax(ans, n);
        q.push({p.first, p.second + 1});
      }
    }
    return ans;
  };

  cout << solve() << endl;

  return 0;
}