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

// #define _GLIBCXX_DEBUG

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

#define endl '\\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i, n, m) for (ll i = (n); i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = (ll)(m)-1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9 + 7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  } else
    return false;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  } else
    return false;
}
ll median(ll a, ll b, ll c) {
  return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
  if (x)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void ans2(bool x) {
  if (x)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
void ans3(bool x) {
  if (x)
    cout << "Yay!" << endl;
  else
    cout << ":(" << endl;
}
template <typename T1, typename T2> void ans(bool x, T1 y, T2 z) {
  if (x)
    cout << y << endl;
  else
    cout << z << endl;
}
template <typename T> void debug(vector<vector<T>> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    cout << v[i][0];
    for (ll j = 1; j < w; j++)
      cout spa v[i][j];
    cout << endl;
  }
};
void debug(vector<string> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    for (ll j = 0; j < w; j++)
      cout << v[i][j];
    cout << endl;
  }
};
template <typename T> void debug(vector<T> &v, ll n) {
  if (n != 0)
    cout << v[0];
  for (ll i = 1; i < n; i++)
    cout spa v[i];
  cout << endl;
};
template <typename T> vector<vector<T>> vec(ll x, ll y, T w) {
  vector<vector<T>> v(x, vector<T>(y, w));
  return v;
}
ll gcd(ll x, ll y) {
  ll r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
vector<ll> dx = {1, 0, -1, 0, 1, 1, -1, -1};
vector<ll> dy = {0, 1, 0, -1, 1, -1, 1, -1};
template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << " " << p.second;
}
int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res = 0, buf = 0;
  bool judge = true;
  const ll sz = 4;
  ll n;
  cin >> n;
  ll a, b, c;
  cin >> a >> b >> c;
  a = min(a, 2LL);
  b = min(b, 2LL);
  c = min(c, 2LL);
  auto t = make_v(n + 1, sz + 1, sz + 1, sz + 1, false);
  t[0][a][b][c] = true;
  // cout<<a spa b spa c<<endl;
  vector<string> str(n);
  rep(i, 0, n) {
    cin >> str[i];
    string s = str[i];
    rep(x, 0, sz + 1) rep(y, 0, sz + 1) rep(z, 0, sz + 1) {
      if (!t[i][x][y][z])
        continue;
      // cout<<i spa x spa y spa z<<endl;
      if (s == "AB") {
        if (x >= 1 && y <= sz - 1)
          t[i + 1][x - 1][y + 1][z] = true;
        if (y >= 1 && x <= sz - 1)
          t[i + 1][x + 1][y - 1][z] = true;
      }
      if (s == "BC") {
        if (z >= 1 && y <= sz - 1)
          t[i + 1][x][y + 1][z - 1] = true;
        if (y >= 1 && z <= sz - 1)
          t[i + 1][x][y - 1][z + 1] = true;
      }
      if (s == "AC") {
        if (x >= 1 && z <= sz - 1)
          t[i + 1][x - 1][y][z + 1] = true;
        if (z >= 1 & x <= sz - 1)
          t[i + 1][x + 1][y][z - 1] = true;
      }
    }
  }
  rep(x, 0, sz + 1) rep(y, 0, sz + 1) rep(z, 0, sz + 1) {
    if (!t[n][x][y][z])
      continue;
    // cout<<x spa y spa z<<endl;
    cout << "Yes" << endl;
    vector<string> ret(n);
    ll tx = x, ty = y, tz = z;
    rrep(i, 0, n) {
      string s = str[i];
      // cout<<s spa tx spa ty spa tz<<endl;
      // assert(tx>=0&&ty>=0&&tz>=0);
      if (tx < 0 || ty < 0 || tz < 0)
        break;
      if (s == "AB") {
        // if(tz<0||tz>sz)break;
        // assert(ty>=0);assert(tx<=sz);assert(tz>=0&&tz<=sz);
        if (tx >= 1 && ty <= sz - 1 && t[i][tx - 1][ty + 1][tz]) {
          tx--, ty++;
          ret[i] = "A";
        } else {
          tx++, ty--;
          ret[i] = 'B';
        }
      }
      if (s == "BC") {
        if (tz >= 1 && ty <= sz - 1 && t[i][tx][ty + 1][tz - 1]) {
          ty++, tz--;
          ret[i] = 'C';
        } else {
          ty--, tz++;
          ret[i] = 'B';
        }
      }
      if (s == "AC") {
        if (tx >= 1 && tz <= sz - 1 && t[i][tx - 1][ty][tz + 1]) {
          tx--, tz++;
          ret[i] = 'A';
        } else {
          // assert(tz!=0);
          tx++, tz--;
          ret[i] = 'C';
        }
      }
    }
    rep(i, 0, n) cout << ret[i] << endl;
    return 0;
  }
  cout << "No" << endl;
  return 0;
}

Error: 0

Fixed submission:

// #define _GLIBCXX_DEBUG

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

#define endl '\\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i, n, m) for (ll i = (n); i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = (ll)(m)-1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9 + 7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  } else
    return false;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  } else
    return false;
}
ll median(ll a, ll b, ll c) {
  return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
  if (x)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void ans2(bool x) {
  if (x)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
void ans3(bool x) {
  if (x)
    cout << "Yay!" << endl;
  else
    cout << ":(" << endl;
}
template <typename T1, typename T2> void ans(bool x, T1 y, T2 z) {
  if (x)
    cout << y << endl;
  else
    cout << z << endl;
}
template <typename T> void debug(vector<vector<T>> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    cout << v[i][0];
    for (ll j = 1; j < w; j++)
      cout spa v[i][j];
    cout << endl;
  }
};
void debug(vector<string> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    for (ll j = 0; j < w; j++)
      cout << v[i][j];
    cout << endl;
  }
};
template <typename T> void debug(vector<T> &v, ll n) {
  if (n != 0)
    cout << v[0];
  for (ll i = 1; i < n; i++)
    cout spa v[i];
  cout << endl;
};
template <typename T> vector<vector<T>> vec(ll x, ll y, T w) {
  vector<vector<T>> v(x, vector<T>(y, w));
  return v;
}
ll gcd(ll x, ll y) {
  ll r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
vector<ll> dx = {1, 0, -1, 0, 1, 1, -1, -1};
vector<ll> dy = {0, 1, 0, -1, 1, -1, 1, -1};
template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << " " << p.second;
}
int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res = 0, buf = 0;
  bool judge = true;
  ll sz = 5;
  ll n;
  cin >> n;
  ll a, b, c;
  cin >> a >> b >> c;
  a = min(a, 3LL);
  b = min(b, 3LL);
  c = min(c, 3LL);
  auto t = make_v(n + 1, sz + 1, sz + 1, sz + 1, false);
  t[0][a][b][c] = true;
  // cout<<a spa b spa c<<endl;
  vector<string> str(n);
  rep(i, 0, n) {
    cin >> str[i];
    string s = str[i];
    rep(x, 0, sz + 1) rep(y, 0, sz + 1) rep(z, 0, sz + 1) {
      if (!t[i][x][y][z])
        continue;
      // cout<<i spa x spa y spa z<<endl;
      if (s == "AB") {
        if (x >= 1 && y <= sz - 1)
          t[i + 1][x - 1][y + 1][z] = true;
        if (y >= 1 && x <= sz - 1)
          t[i + 1][x + 1][y - 1][z] = true;
      }
      if (s == "BC") {
        if (z >= 1 && y <= sz - 1)
          t[i + 1][x][y + 1][z - 1] = true;
        if (y >= 1 && z <= sz - 1)
          t[i + 1][x][y - 1][z + 1] = true;
      }
      if (s == "AC") {
        if (x >= 1 && z <= sz - 1)
          t[i + 1][x - 1][y][z + 1] = true;
        if (z >= 1 & x <= sz - 1)
          t[i + 1][x + 1][y][z - 1] = true;
      }
    }
  }
  rep(x, 0, sz + 1) rep(y, 0, sz + 1) rep(z, 0, sz + 1) {
    if (!t[n][x][y][z])
      continue;
    // cout<<x spa y spa z<<endl;
    cout << "Yes" << endl;
    vector<string> ret(n);
    ll tx = x, ty = y, tz = z;
    rrep(i, 0, n) {
      string s = str[i];
      // cout<<s spa tx spa ty spa tz<<endl;
      if (s == "AB") {
        // if(tz<0||tz>sz)break;
        // assert(ty>=0);assert(tx<=sz);assert(tz>=0&&tz<=sz);
        if (tx >= 1 && ty <= sz - 1 && t[i][tx - 1][ty + 1][tz]) {
          tx = tx--, ty++;
          ret[i] = "A";
        } else {
          tx++, ty--;
          ret[i] = 'B';
        }
      }
      if (s == "BC") {
        if (tz >= 1 && ty <= sz - 1 && t[i][tx][ty + 1][tz - 1]) {
          ty++, tz--;
          ret[i] = 'C';
        } else {
          ty--, tz++;
          ret[i] = 'B';
        }
      }
      if (s == "AC") {
        if (tx >= 1 && tz <= sz - 1 && t[i][tx - 1][ty][tz + 1]) {
          tx--, tz++;
          ret[i] = 'A';
        } else {
          // assert(tz!=0);
          tx++, tz--;
          ret[i] = 'C';
        }
      }
    }
    rep(i, 0, n) cout << ret[i] << endl;
    return 0;
  }
  cout << "No" << endl;
  return 0;
}