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

#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
#define int long long
const int INF = 1e18;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
  if ((a) > (b))
    (a) = (b);
}

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \\
  sort(all(x));                                                                \\
  x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
void check_input() {
  assert(cin.eof() == 0);
  int tmp;
  cin >> tmp;
  assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"

signed main() {
  // input
  int n;
  cin >> n;
  dump(n);
  int a, b, c;
  cin >> a >> b >> c;
  dump(a, b, c);
  int sum = a + b + c;

  // solve
  vector<string> s(n);
  string ans = "";
  vector<int> as(n, INF), bs(n, INF), cs(n, INF);
  int lasta = -1;
  int lastb = -1;
  int lastc = -1;
  rep(i, n) {
    cin >> s[i];
    if (s[i] == "AB") {
      if (lasta != -1)
        as[lasta] = i;
      if (lastb != -1)
        bs[lastb] = i;
      lasta = i;
      lastb = i;
    }
    if (s[i] == "AC") {
      if (lasta != -1)
        as[lasta] = i;
      if (lastc != -1)
        cs[lastc] = i;
      lasta = i;
      lastc = i;
    }
    if (s[i] == "BC") {
      if (lastb != -1)
        bs[lastb] = i;
      if (lastc != -1)
        cs[lastc] = i;
      lastb = i;
      lastc = i;
    }
  }
  dump(as);
  dump(bs);
  dump(cs);

  rep(i, n) {
    cerrendl;
    dump(s[i]);
    if (s[i] == "AB") {
      if (a == 0 && b == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (a == b) {
        int ja = as[i];
        int jb = bs[i];
        if (ja < jb) {
          ans += 'A';
          a++;
          b--;
        } else {
          ans += 'B';
          a--;
          b++;
        }
      } else if (a < b) {
        ans += 'A';
        a++;
        b--;
      } else {
        ans += 'B';
        a--;
        b++;
      }
    } else if (s[i] == "AC") {
      if (a == 0 && c == 0) {
        cout << "No" << endl;
        return 0;
      }
      if (a == c) {
        int ja = as[i];
        int jc = cs[i];
        if (ja < jc) {
          ans += 'A';
          a++;
          c--;
        } else {
          ans += 'C';
          a--;
          c++;
        }
      } else if (a < c) {
        ans += 'A';
        a++;
        c--;
      } else {
        ans += 'C';
        a--;
        c++;
      }
    } else if (s[i] == "BC") {
      if (b == 0 && c == 0) {
        cout << "No" << endl;
        return 0;
      }
      if (b == c) {
        int jb = bs[i];
        int jc = cs[i];
        if (jb < jc) {
          ans += 'B';
          b++;
          c--;
        } else {
          ans += 'C';
          b--;
          c++;
        }
      } else if (b < c) {
        ans += 'B';
        b++;
        c--;
      } else {
        ans += 'C';
        b--;
        c++;
      }
    }
    dump(a, b, c);
  }
  cout << "Yes" << endl;
  rep(i, sz(ans)) { cout << ans[i] << endl; }
  assert(sum == a + b + c);

  return 0;
}


Error: -6
0f14bd9e-ef26-49ff-9ee5-23230bd20509.out: solve.cpp:127: int main(): Assertion `false' failed.


Fixed submission:

#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
#define int long long
const int INF = 1e18;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (int i = (int)((b)-1); i >= (int)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
  if ((a) > (b))
    (a) = (b);
}

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \\
  sort(all(x));                                                                \\
  x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int, int> pii;
typedef tuple<int, int, int> iii;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
void check_input() {
  assert(cin.eof() == 0);
  int tmp;
  cin >> tmp;
  assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"

signed main() {
  // input
  int n;
  cin >> n;
  dump(n);
  int a, b, c;
  cin >> a >> b >> c;
  dump(a, b, c);
  int sum = a + b + c;

  // solve
  vector<string> s(n);
  string ans = "";
  vector<int> as(n, INF), bs(n, INF), cs(n, INF);
  int lasta = -1;
  int lastb = -1;
  int lastc = -1;
  rep(i, n) {
    cin >> s[i];
    if (s[i] == "AB") {
      if (lasta != -1)
        as[lasta] = i;
      if (lastb != -1)
        bs[lastb] = i;
      lasta = i;
      lastb = i;
    }
    if (s[i] == "AC") {
      if (lasta != -1)
        as[lasta] = i;
      if (lastc != -1)
        bs[lastc] = i;
      lasta = i;
      lastc = i;
    }
    if (s[i] == "BC") {
      if (lastb != -1)
        as[lastb] = i;
      if (lastc != -1)
        bs[lastc] = i;
      lastb = i;
      lastc = i;
    }
  }
  dump(as);
  dump(bs);
  dump(cs);

  rep(i, n) {
    cerrendl;
    dump(s[i]);
    if (s[i] == "AB") {
      if (a == 0 && b == 0) {
        cout << "No" << endl;
        return 0;
      }

      if (a == b) {
        int ja = as[i];
        int jb = bs[i];
        if (ja < jb) {
          ans += 'A';
          a++;
          b--;
        } else {
          ans += 'B';
          a--;
          b++;
        }
      } else if (a < b) {
        ans += 'A';
        a++;
        b--;
      } else {
        ans += 'B';
        a--;
        b++;
      }
    }
    if (s[i] == "AC") {
      if (a == 0 && c == 0) {
        cout << "No" << endl;
        return 0;
      }
      if (a == c) {
        int ja = as[i];
        int jc = cs[i];
        if (ja < jc) {
          ans += 'A';
          a++;
          c--;
        } else {
          ans += 'C';
          a--;
          c++;
        }
      } else if (a < c) {
        ans += 'A';
        a++;
        c--;
      } else {
        ans += 'C';
        a--;
        c++;
      }
    }
    if (s[i] == "BC") {
      if (b == 0 && c == 0) {
        cout << "No" << endl;
        return 0;
      }
      if (b == c) {
        int jb = bs[i];
        int jc = cs[i];
        if (jb < jc) {
          ans += 'B';
          b++;
          c--;
        } else {
          ans += 'C';
          b--;
          c++;
        }
      } else if (b < c) {
        ans += 'B';
        b++;
        c--;
      } else {
        ans += 'C';
        b--;
        c++;
      }
    }
    dump(a, b, c);
  }
  assert(false);
  cout << "Yes" << endl;
  rep(i, sz(ans)) { cout << ans[i] << endl; }

  return 0;
}