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

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;

template <typename T1, typename T2> inline void chmin(T1 &a, const T2 &b) {
  if (a > b)
    a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, const T2 &b) {
  if (a < b)
    a = b;
}

#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()

/* do your best */

string ch(int n) {
  if (n == 1)
    return "A";
  else if (n == 2) {
    return "B";
  } else {
    return "C";
  }
}

int dp[100002][3][3][3] = {};

int main() {

  int n;
  cin >> n;
  lint a, b, c;
  cin >> a >> b >> c;
  vector<string> s(n);

  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }

  if (a == 0 and b == 0 and c == 0) {
    cout << "No" << endl;
    return 0;
  }

  vector<string> ans(n);

  if (a + b + c == 2) {

    // A B C, 1 2 3

    dp[0][a][b][c] = 1;
    for (int i = 0; i < n; i++) {
      for (int aa = 0; aa < 3; aa++) {
        for (int bb = 0; bb < 3; bb++) {
          for (int cc = 0; cc < 3; cc++) {

            if (dp[i][aa][bb][cc] == 0)
              continue;

            if (s[i] == "AB") {
              // A を増やす
              if (bb - 1 >= 0) {
                dp[i + 1][aa + 1][bb - 1][cc] = 1;
              }

              // B を増やす
              if (aa - 1 >= 0) {
                dp[i + 1][aa - 1][bb + 1][cc] = 2;
              }
            }

            if (s[i] == "BC") {
              // C を増やす
              if (bb - 1 >= 0) {
                dp[i + 1][aa][bb - 1][cc + 1] = 3;
              }

              // B を増やす
              if (cc - 1 >= 0) {
                dp[i + 1][aa][bb + 1][cc - 1] = 2;
              }
            }

            if (s[i] == "AC") {
              // A を増やす
              if (cc - 1 >= 0) {
                dp[i + 1][aa + 1][bb][cc - 1] = 1;
              }

              // C を増やす
              if (aa - 1 >= 0) {
                dp[i + 1][aa - 1][bb][cc + 1] = 3;
              }
            }
          }
        }
      }
    }

    int aa = -1;
    int bb = -1;
    int cc = -1;
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < 3; k++) {
        for (int l = 0; l < 3; l++) {
          if (dp[n][j][k][l] != 0) {
            aa = j;
            bb = k;
            cc = l;
          }
        }
      }
    }

    if (aa == -1) {
      cout << "No" << endl;
      return 0;
    }

    for (int i = n; i >= 1; i--) {
      ans[i - 1] = ch(dp[i][aa][bb][cc]);
      // cerr << aa << " " << bb << " " << cc << endl;
      if (ans[i - 1] == "A") {
        if (s[i - 1] == "AB") {
          aa--;
          bb++;
        } else {
          assert(s[i - 1] == "AC");
          aa--;
          cc++;
        }
      } else if (ans[i - 1] == "B") {
        if (s[i - 1] == "AB") {
          bb--;
          aa++;
        } else {
          assert(s[i - 1] == "BC");
          bb--;
          cc++;
        }
      } else {
        if (s[i - 1] == "AC") {
          cc--;
          aa++;
        } else {
          assert(s[i - 1] == "BC");
          cc--;
          bb++;
        }
      }
    }

    cout << "Yes" << endl;
    for (auto c : ans) {
      cout << c << endl;
    }

    return 0;
  }

  for (int i = 0; i < n; i++) {
    if (s[i] == "AB") {
      if (a == 0 and b == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (a > b) {
        // cout << "B" << endl;
        ans[i] = "B";
        a--;
        b++;
      } else {
        // cout << "A" << endl;
        ans[i] = "A";
        a++;
        b--;
      }
    }
    if (s[i] == "BC") {
      if (b == 0 and c == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (b > c) {
        // cout << "C" << endl;
        ans[i] = "C";
        b--;
        c++;
      } else {
        // cout << "B" << endl;
        ans[i] = "B";
        b++;
        c--;
      }
    }
    if (s[i] == "AC") {
      if (a == 0 and c == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (a > c) {
        // cout << "C" << endl;
        ans[i] = "C";
        a--;
        c++;
      } else {
        // cout << "A" << endl;
        ans[i] = "A";
        a++;
        c--;
      }
    }
  }

  cout << "Yes" << endl;
  for (auto c : ans) {
    cout << c << endl;
  }
  return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;
using lint = long long int;
long long int INF = 1001001001001001LL;
int inf = 1000000007;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;

template <typename T1, typename T2> inline void chmin(T1 &a, const T2 &b) {
  if (a > b)
    a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, const T2 &b) {
  if (a < b)
    a = b;
}

#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()

/* do your best */

string ch(int n) {
  if (n == 1)
    return "A";
  else if (n == 2) {
    return "B";
  } else {
    return "C";
  }
}

int dp[100002][3][3][3] = {};

int main() {

  int n;
  cin >> n;
  lint a, b, c;
  cin >> a >> b >> c;
  vector<string> s(n);

  for (int i = 0; i < n; i++) {
    cin >> s[i];
  }

  if (a == 0 and b == 0 and c == 0) {
    cout << "No" << endl;
    return 0;
  }

  vector<string> ans(n);

  if (a + b + c == 2) {

    // A B C, 1 2 3

    dp[0][a][b][c] = 1;
    for (int i = 0; i < n; i++) {
      for (int aa = 0; aa < 3; aa++) {
        for (int bb = 0; bb < 3; bb++) {
          for (int cc = 0; cc < 3; cc++) {
            if (dp[i][aa][bb][cc] == 0)
              continue;

            if (s[i] == "AB") {
              // A を増やす
              if (bb - 1 >= 0) {
                dp[i + 1][aa + 1][bb - 1][cc] = 1;
              }

              // B を増やす
              if (aa - 1 >= 0) {
                dp[i + 1][aa - 1][bb + 1][cc] = 2;
              }
            }

            if (s[i] == "BC") {
              // C を増やす
              if (bb - 1 >= 0) {
                dp[i + 1][aa][bb - 1][cc + 1] = 3;
              }

              // B を増やす
              if (cc - 1 >= 0) {
                dp[i + 1][aa][bb + 1][cc - 1] = 2;
              }
            }

            if (s[i] == "AC") {
              // A を増やす
              if (cc - 1 >= 0) {
                dp[i + 1][aa + 1][bb][cc - 1] = 1;
              }

              // C を増やす
              if (aa - 1 >= 0) {
                dp[i + 1][aa - 1][bb][cc + 1] = 3;
              }
            }
          }
        }
      }
    }

    int aa = -1;
    int bb = -1;
    int cc = -1;
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < 3; k++) {
        for (int l = 0; l < 3; l++) {
          if (dp[n][j][k][l] != 0) {
            aa = j;
            bb = k;
            cc = l;
          }
        }
      }
    }

    if (aa == -1) {
      cout << "No" << endl;
      return 0;
    }

    for (int i = n; i >= 1; i--) {
      ans[i - 1] = ch(dp[i][aa][bb][cc]);
      if (ans[i - 1] == "A") {
        if (s[i - 1] == "AB") {
          a--;
          b++;
        } else {
          assert(s[i - 1] == "AC");
          a--;
          c++;
        }
      } else if (ans[i - 1] == "B") {
        if (s[i - 1] == "AB") {
          b--;
          a++;
        } else {
          assert(s[i - 1] == "BC");
          b--;
          c++;
        }
      } else {
        if (s[i - 1] == "AC") {
          c--;
          a++;
        } else {
          assert(s[i - 1] == "BC");
          c--;
          b++;
        }
      }
    }

    return 0;
  }

  for (int i = 0; i < n; i++) {
    if (s[i] == "AB") {
      if (a == 0 and b == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (a > b) {
        // cout << "B" << endl;
        ans[i] = "B";
        a--;
        b++;
      } else {
        // cout << "A" << endl;
        ans[i] = "A";
        a++;
        b--;
      }
    }
    if (s[i] == "BC") {
      if (b == 0 and c == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (b > c) {
        // cout << "C" << endl;
        ans[i] = "C";
        b--;
        c++;
      } else {
        // cout << "B" << endl;
        ans[i] = "B";
        b++;
        c--;
      }
    }
    if (s[i] == "AC") {
      if (a == 0 and c == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (a > c) {
        // cout << "C" << endl;
        ans[i] = "C";
        a--;
        c++;
      } else {
        // cout << "A" << endl;
        ans[i] = "A";
        a++;
        c--;
      }
    }
  }

  cout << "Yes" << endl;
  for (auto c : ans) {
    cout << c << endl;
  }
  return 0;
}