Problem p00535 (C++) — buggy submission, verdict: Memory Limit Exceeded

/* {{{ Shinobu kawaii */
/*
  ______   __        _                  __
.' ____ \\ [  |      (_)                [  |
| (___ \\_| | |--.   __   _ .--.   .--.  | |.--.   __   _
 _.____`.  | .-. | [  | [ `.-. |/ .'`\\ \\| '/'`\\ \\[  | | |
| \\____) | | | | |  | |  | | | || \\__. ||  \\__/ | | \\_/ |,
 \\______.'[___]|__][___][___||__]'.__.'[__;.__.'  '.__.'_/

*/
// clang-format off
/* }}} */

#include <bits/stdc++.h>
using namespace std;

// #define int long long
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* cpp template {{{ */

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
template <typename T> inline void print(const T& x) {cout << x << '\\n';}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << '\\n';}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {
  REP(i, v.size()) print(v[i]);
}
template <typename T> inline void print(const vector<T>& v, string s = " ") {
  REP(i, v.size()) {
    if (i != 0) cout << s;
    cout << v[i];
  }
  cout << '\\n';
}
// clang-format on
/* }}} */

char field[1010][1010];
int cnt[1010][1010];

signed main() {
  int h = in(), w = in();
  REP(i, h) cin >> field[i];
  queue<pii> q;

  REP(i, h) REP(j, w) {
    if (field[i][j] == '.')
      continue;
    REP(k, 8) {
      int ny = i + dy[k], nx = j + dx[k];
      if (!inside(ny, nx, h, w))
        continue;
      if (field[ny][nx] != '.')
        continue;
      cnt[i][j]++;
    }
    if (cnt[i][j] >= field[i][j] - '0') {
      q.emplace(i, j);
    }
  }
  if (q.empty()) {
    print(0);
    return 0;
  }
  int ans = 1;
  while (q.size()) {
    // debug(q.size());
    queue<pii> qq;
    while (q.size()) {
      pii t = q.front();
      q.pop();
      REP(i, 8) {
        int ny = t.first + dy[i], nx = t.second + dx[i];
        if (!inside(ny, nx, h, w))
          continue;
        if (field[ny][nx] == '.')
          continue;
        cnt[ny][nx]++;
        if (cnt[ny][nx] == field[ny][nx] - '0') {
          qq.emplace(ny, nx);
        }
      }
    }
    if (qq.size())
      ans++;
    q = qq;
  }
  print(ans);

  return 0;
}

Error: MLE

Fixed submission:

/* {{{ Shinobu kawaii */
/*
  ______   __        _                  __
.' ____ \\ [  |      (_)                [  |
| (___ \\_| | |--.   __   _ .--.   .--.  | |.--.   __   _
 _.____`.  | .-. | [  | [ `.-. |/ .'`\\ \\| '/'`\\ \\[  | | |
| \\____) | | | | |  | |  | | | || \\__. ||  \\__/ | | \\_/ |,
 \\______.'[___]|__][___][___||__]'.__.'[__;.__.'  '.__.'_/

*/
// clang-format off
/* }}} */

#include <bits/stdc++.h>
using namespace std;

// #define int long long
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* cpp template {{{ */

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) (v).begin(), (v).end()
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
template <typename T> inline void print(const T& x) {cout << x << '\\n';}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << '\\n';}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {
  REP(i, v.size()) print(v[i]);
}
template <typename T> inline void print(const vector<T>& v, string s = " ") {
  REP(i, v.size()) {
    if (i != 0) cout << s;
    cout << v[i];
  }
  cout << '\\n';
}
// clang-format on
/* }}} */

char field[1010][1010];

signed main() {
  int h = in(), w = in();
  REP(i, h) cin >> field[i];
  bool flg = false;
  queue<pii> q;
  REP(i, h) REP(j, w) {
    int cnt = 0;
    if (field[i][j] == '.')
      continue;
    REP(k, 8)
    if (inside(dy[k] + i, dx[k] + j, h, w) &&
        field[dy[k] + i][dx[k] + j] == '.')++ cnt;
    if (cnt >= field[i][j] - '0') {
      q.emplace(i, j);
      flg = true;
    }
  }
  // debug("shinobu");
  if (!flg) {
    print(0);
    return 0;
  }
  // debug(q.size());
  int ans = 1;
  while (flg) {
    flg = false;
    queue<pii> qq;
    while (q.size()) {
      pii t = q.front();
      q.pop();
      field[t.first][t.second] = '.';
      REP(i, 8) {
        int ny = dy[i] + t.first, nx = dx[i] + t.second;
        if (!inside(ny, nx, h, w))
          continue;
        // debug(field[ny][nx]);
        qq.emplace(ny, nx);
      }
    }
    while (qq.size()) {
      pii t = qq.front();
      qq.pop();
      int cnt = 0;
      if (field[t.first][t.second] == '.')
        continue;
      REP(i, 8) {
        int ny = dy[i] + t.first, nx = dx[i] + t.second;
        if (field[ny][nx] == '.')
          ++cnt;
      }
      if (cnt >= field[t.first][t.second] - '0') {
        q.push(t);
        flg = true;
      }
    }
    if (flg)
      ++ans;
  }
  print(ans);

  return 0;
}