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

#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
#define M_PI 3.141592653589793238
using namespace std;
long long p9 = 998244353;
long long p1 = 1000000007;
#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()
#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()
#define int long long
#define ll long long
#define vel vector<ll>
#define vvel vector<vel>
#define rep(i, n) for (int i = 0; i < n; i++)
#define sor(v) sort(v.begin(), v.end())
#define mmax(a, b) a = max(a, b)
#define mmin(a, b) a = min(a, b)
#define mkp(a, b) make_pair(a, b)
#define pin pair<ll, ll>
#define qin pair<pin, int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define fcout cout << fixed << setprecision(15)
#define rev(s) reverse(s.begin(), s.end())
#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())
#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())
#define vveb V<veb>
#define omajinai                                                               \\
  cin.tie(0);                                                                  \\
  ios::sync_with_stdio(false);
#define endl "\\n"
#define pb push_back
vel kai;
vel inv_kai;
vel inv;
int root(int x, vel &pa) {
  if (pa[x] == -1) {
    return x;
  }
  int ans = root(pa[x], pa);
  pa[x] = ans;
  return ans;
}
bool mar(int x, int y, vel &pa) {
  x = root(x, pa);
  y = root(y, pa);
  if (x != y) {
    pa[x] = y;
  }
  return (x != y);
}
int gcd(int x, int y) {
  if (x < y) {
    return gcd(y, x);
  }
  if (y == 0) {
    return x;
  }
  return gcd(y, x % y);
}
int lcm(ll x, ll y) {
  x = abs(x);
  y = abs(y);
  return x * (y / gcd(x, y));
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0)
    u += m;
  return u;
}
void make_inv(int max_inv, int p) {
  inv = vel(max_inv + 1, 1);
  for (int i = 2; i <= max_inv; i++) {
    inv[i] = p - ((p / i) * inv[p % i]) % p;
  }
}
void make_kai(int max_kai, int p) {
  kai = vel(max_kai + 1, 1);
  inv_kai = kai;
  make_inv(max_kai, p);
  rep(i, max_kai) {
    kai[i + 1] = kai[i] * (i + 1);
    kai[i + 1] %= p;
    inv_kai[i + 1] = inv_kai[i] * inv[i + 1];
    inv_kai[i + 1] %= p;
  }
}
int com(int n, int r, int p) {
  if ((n < 0) || (r < 0) || (r > n)) {
    return 0;
  }
  int ans = (kai[n] * inv_kai[r]) % p;
  return (ans * inv_kai[n - r]) % p;
}
int per(int n, int r, int p) {
  if ((n < 0) || (r < 0) || (r > n)) {
    return 0;
  }
  return (kai[n] * inv_kai[n - r]) % p;
}
vel uni(vel x) {
  if (x.size() == 0) {
    return x;
  }
  sor(x);
  int n = x.size();
  vel ans(1, x[0]);
  for (int j = 1; j < n; j++) {
    if (x[j - 1] != x[j]) {
      ans.push_back(x[j]);
    }
  }
  x = ans;
  return x;
}
vel dijk(V<V<pin>> &way, int st, int inf) {
  int n = way.size();
  vel dist(n, inf);
  dist[st] = 0;
  priority_queue<pin, vector<pin>, greater<pin>> pq;
  pq.push(mkp(0, st));
  veb is_checked(n, false);
  while (!pq.empty()) {
    pin x = pq.top();
    pq.pop();
    int pot = x.second;
    if (!is_checked[pot]) {
      is_checked[pot] = true;
      for (auto y : way[pot]) {
        int nex_dist = x.first + y.second;
        int nex_pot = y.first;
        if (dist[nex_pot] > nex_dist) {
          dist[nex_pot] = nex_dist;
          pq.push(mkp(nex_dist, y.first));
        }
      }
    }
  }
  return dist;
}
void make_tree(vvel &chi, vel &par, int n) {
  V<V<pin>> way(n);
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    way[a].push_back(mkp(b, 1));
    way[b].push_back(mkp(a, 1));
  }
  vel dist = dijk(way, 0, n + 1);
  par = vel(n, -1);
  chi = vvel(n);
  rep(i, n) {
    for (auto nex : way[i]) {
      int pot = nex.first;
      if (dist[pot] > dist[i]) {
        chi[i].push_back(pot);
      } else {
        par[i] = pot;
      }
    }
  }
}
void pri(vel &v) {
  if (v.size() == 0) {
    return;
  }
  cout << v[0];
  rep(i, v.size() - 1) { cout << " " << v[i + 1]; }
  cout << endl;
  return;
}
int modpow(int a, int n, int p) {
  if (n == 0) {
    return 1;
  }
  int m = n / 2;
  int x = modpow(a, n / 2, p);
  x *= x;
  x %= p;
  if (n % 2 == 1) {
    x *= a;
    x %= p;
  }
  return x;
}
vel dx = {0, 0, -1, 1};
vel dy = {1, -1, 0, 0};
#include <unordered_map>
#define ui long long
int po(int a) { return a * a * a * a * a; }
signed main() {
  int n;
  cin >> n;
  vel li;
  vel a(3);
  rep(i, 3) { cin >> a[i]; }
  V<string> s(n);
  rep(i, n) { cin >> s[i]; }
  vel qc0(n), qc1(n);
  rep(i, n) {
    if (s[i] == "AB") {
      qc0[i] = 0;
      qc1[i] = 1;
    } else if (s[i] == "AC") {
      qc0[i] = 0;
      qc1[i] = 2;
    } else {
      qc0[i] = 1;
      qc1[i] = 2;
    }
  }
  rep(i, n) {
    int c0 = qc0[i];
    int c1 = qc1[i];
    if (a[c0] + a[c1] == 0) {
      cout << "No" << endl;
      return 0;
    }
    if (a[c0] < a[c1]) {
      a[c0]++;
      a[c1]--;
      li.push_back(c0);
    } else if (a[c0] > a[c1]) {
      a[c0]--;
      a[c1]++;
      li.push_back(c1);
    } else {
      int d0 = c0;
      int d1 = c1;
      if (i != n - 1) {
        d0 = qc0[i + 1];
        d1 = qc1[i + 1];
      }
      if (d0 == c0 || d1 == c0) {
        a[c0]++;
        a[c1]--;
        li.push_back(c0);
      } else {
        a[c1]++;
        a[c0]--;
        li.push_back(c1);
      }
    }
  }
  cout << "Yes" << endl;
  rep(i, n) {
    string t = "ABC";
    cout << t[li[i]] << endl;
  }
  return 0;
}


Error: -6
terminate called after throwing an instance of 'std::out_of_range'
  what():  vector::_M_range_check: __n (which is 4) >= this->size() (which is 3)


Fixed submission:

#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
#define M_PI 3.141592653589793238
using namespace std;
long long p9 = 998244353;
long long p1 = 1000000007;
#define upperbound(v, val) upper_bound(v.begin(), v.end(), val) - v.begin()
#define lowerbound(v, val) lower_bound(v.begin(), v.end(), val) - v.begin()
#define int long long
#define ll long long
#define vel vector<ll>
#define vvel vector<vel>
#define rep(i, n) for (int i = 0; i < n; i++)
#define sor(v) sort(v.begin(), v.end())
#define mmax(a, b) a = max(a, b)
#define mmin(a, b) a = min(a, b)
#define mkp(a, b) make_pair(a, b)
#define pin pair<ll, ll>
#define qin pair<pin, int>
#define V vector
#define Endl endl
#define veb vector<bool>
#define fcout cout << fixed << setprecision(15)
#define rev(s) reverse(s.begin(), s.end())
#define lower(h, val) (lower_bound(h.begin(), h.end(), val) - h.begin())
#define upper(h, val) (upper_bound(h.begin(), h.end(), val) - h.begin())
#define vveb V<veb>
#define omajinai                                                               \\
  cin.tie(0);                                                                  \\
  ios::sync_with_stdio(false);
#define endl "\\n"
#define pb push_back
vel kai;
vel inv_kai;
vel inv;
int root(int x, vel &pa) {
  if (pa[x] == -1) {
    return x;
  }
  int ans = root(pa[x], pa);
  pa[x] = ans;
  return ans;
}
bool mar(int x, int y, vel &pa) {
  x = root(x, pa);
  y = root(y, pa);
  if (x != y) {
    pa[x] = y;
  }
  return (x != y);
}
int gcd(int x, int y) {
  if (x < y) {
    return gcd(y, x);
  }
  if (y == 0) {
    return x;
  }
  return gcd(y, x % y);
}
int lcm(ll x, ll y) {
  x = abs(x);
  y = abs(y);
  return x * (y / gcd(x, y));
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0)
    u += m;
  return u;
}
void make_inv(int max_inv, int p) {
  inv = vel(max_inv + 1, 1);
  for (int i = 2; i <= max_inv; i++) {
    inv[i] = p - ((p / i) * inv[p % i]) % p;
  }
}
void make_kai(int max_kai, int p) {
  kai = vel(max_kai + 1, 1);
  inv_kai = kai;
  make_inv(max_kai, p);
  rep(i, max_kai) {
    kai[i + 1] = kai[i] * (i + 1);
    kai[i + 1] %= p;
    inv_kai[i + 1] = inv_kai[i] * inv[i + 1];
    inv_kai[i + 1] %= p;
  }
}
int com(int n, int r, int p) {
  if ((n < 0) || (r < 0) || (r > n)) {
    return 0;
  }
  int ans = (kai[n] * inv_kai[r]) % p;
  return (ans * inv_kai[n - r]) % p;
}
int per(int n, int r, int p) {
  if ((n < 0) || (r < 0) || (r > n)) {
    return 0;
  }
  return (kai[n] * inv_kai[n - r]) % p;
}
vel uni(vel x) {
  if (x.size() == 0) {
    return x;
  }
  sor(x);
  int n = x.size();
  vel ans(1, x[0]);
  for (int j = 1; j < n; j++) {
    if (x[j - 1] != x[j]) {
      ans.push_back(x[j]);
    }
  }
  x = ans;
  return x;
}
vel dijk(V<V<pin>> &way, int st, int inf) {
  int n = way.size();
  vel dist(n, inf);
  dist[st] = 0;
  priority_queue<pin, vector<pin>, greater<pin>> pq;
  pq.push(mkp(0, st));
  veb is_checked(n, false);
  while (!pq.empty()) {
    pin x = pq.top();
    pq.pop();
    int pot = x.second;
    if (!is_checked[pot]) {
      is_checked[pot] = true;
      for (auto y : way[pot]) {
        int nex_dist = x.first + y.second;
        int nex_pot = y.first;
        if (dist[nex_pot] > nex_dist) {
          dist[nex_pot] = nex_dist;
          pq.push(mkp(nex_dist, y.first));
        }
      }
    }
  }
  return dist;
}
void make_tree(vvel &chi, vel &par, int n) {
  V<V<pin>> way(n);
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    way[a].push_back(mkp(b, 1));
    way[b].push_back(mkp(a, 1));
  }
  vel dist = dijk(way, 0, n + 1);
  par = vel(n, -1);
  chi = vvel(n);
  rep(i, n) {
    for (auto nex : way[i]) {
      int pot = nex.first;
      if (dist[pot] > dist[i]) {
        chi[i].push_back(pot);
      } else {
        par[i] = pot;
      }
    }
  }
}
void pri(vel &v) {
  if (v.size() == 0) {
    return;
  }
  cout << v[0];
  rep(i, v.size() - 1) { cout << " " << v[i + 1]; }
  cout << endl;
  return;
}
int modpow(int a, int n, int p) {
  if (n == 0) {
    return 1;
  }
  int m = n / 2;
  int x = modpow(a, n / 2, p);
  x *= x;
  x %= p;
  if (n % 2 == 1) {
    x *= a;
    x %= p;
  }
  return x;
}
vel dx = {0, 0, -1, 1};
vel dy = {1, -1, 0, 0};
#include <unordered_map>
#define ui long long
int po(int a) { return a * a * a * a * a; }
signed main() {
  int n;
  cin >> n;
  vel li;
  vel a(3);
  rep(i, 3) { cin >> a[i]; }
  V<string> s(n);
  rep(i, n) { cin >> s[i]; }
  vel qc0(n), qc1(n);
  rep(i, n) {
    if (s[i] == "AB") {
      qc0[i] = 0;
      qc1[i] = 1;
    } else if (s[i] == "AC") {
      qc0[i] = 0;
      qc1[i] = 2;
    } else {
      qc0[i] = 1;
      qc1[i] = 2;
    }
  }
  rep(i, n) {
    int c0 = qc0[i];
    int c1 = qc1[i];
    if (a[c0] + a[c1] == 0) {
      cout << "No" << endl;
      return 0;
    }
    if (a[c0] < a[c1]) {
      a[c0]++;
      a[c1]--;
      li.push_back(c0);
    } else if (a[c0] > a[c1]) {
      a[c0]--;
      a[c1]++;
      li.push_back(c1);
    } else {
      int d0 = c0;
      int d1 = c1;
      if (i != n - 1) {
        d0 = qc0[i + 1];
        d1 = qc1[i + 1];
      }
      if (d0 == c0) {
        a[c0]++;
        a[c1]--;
        li.push_back(c0);
      }
      if (d1 == c1) {
        a[c1]++;
        a[c0]--;
        li.push_back(c1);
      }
    }
  }
  vel v(3, 0);
  v.at(4);
  return -1;
  cout << "Yes" << endl;
  rep(i, n) {
    string t = "ABC";
    cout << t[li[i]] << endl;
  }
  return 0;
}