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

#pragma GCC optimize("Ofast")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./Lib/Timer.hpp"
#include "./Lib/debug.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
// #define int ll

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto &
/* macro func */
template <class T> inline void sort(T &t) { std::sort(ALL(t)); }
template <class T> inline void rsort(T &t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T> inline void unique(T &t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S> inline bool chmax(T &t, const S &s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmaxE(T &t, const S &s) {
  if (s >= t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmin(T &t, const S &s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline void BR() { std::cout << "\\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T> using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::tuple;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> {
public:
  size_t operator()(const std::pair<ll, ll> &x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
} // namespace std

/* input */
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = 2;

//=============================================================================================

signed main() {
  ll n;
  cin >> n;

  V<PAIR> v;
  v.reserve(n);
  REP(_, n) {
    string s;
    cin >> s;
    stack<char> stk;
    REPC(c, s) {
      if (stk.empty()) {
        stk.emplace(c);
        continue;
      }
      if (stk.top() == '(' && c == ')') {
        stk.pop();
        continue;
      }
      stk.emplace(c);
    }
    ll lft = 0, rgt = 0;
    while (!stk.empty()) {
      ++((stk.top() == '(') ? lft : rgt);
      stk.pop();
    }
    v.emplace_back(lft, rgt);
  }
  dump(v);

  ll lft = 0, rgt = 0;
  V<PAIR> t;
  t.reserve(n);
  for (const auto &[l, r] : v) {
    if (l == 0) {
      rgt += r;
      continue;
    }
    if (r == 0) {
      lft += l;
      continue;
    }
    t.emplace_back(l, r);
  }
  dump(lft, rgt);

  if (lft == 0 && rgt == 0 && t.size() == 0) {
    cout << "Yes" << endl;
  } else if (t.size() > 0 && (lft == 0 || rgt == 0)) {
    cout << "No" << endl;
  } else {
    V<PAIR> lt, rt;
    lt.reserve(n);
    rt.reserve(n);
    for (const auto &[l, r] : t) {
      if (l - r > 0) {
        lt.emplace_back(l, r);
        continue;
      }
      rt.emplace_back(l, r);
    }
    std::sort(ALL(lt), [](cauto a, cauto b) { return a.second < b.second; });
    std::sort(ALL(rt), [](cauto a, cauto b) { return a.second > b.second; });
    for (const auto &[l, r] : lt) {
      lft -= r;
      if (lft < 0) {
        cout << "No" << endl;
        return 0;
      }
      lft += l;
    }
    for (const auto &[l, r] : rt) {
      lft -= r;
      if (lft < 0) {
        cout << "No" << endl;
        return 0;
      }
      lft += l;
    }
    lft -= rgt;
    cout << ((lft == 0) ? "Yes" : "No") << endl;
    dump(lt, rt);
  }
}


Error: 0

Fixed submission:

#pragma GCC optimize("Ofast")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./Lib/Timer.hpp"
#include "./Lib/debug.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
// #define int ll

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto &
/* macro func */
template <class T> inline void sort(T &t) { std::sort(ALL(t)); }
template <class T> inline void rsort(T &t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T> inline void unique(T &t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S> inline bool chmax(T &t, const S &s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmaxE(T &t, const S &s) {
  if (s >= t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline bool chmin(T &t, const S &s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline void BR() { std::cout << "\\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T> using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::tuple;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> {
public:
  size_t operator()(const std::pair<ll, ll> &x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
} // namespace std

/* input */
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
// constexpr ll MOD = 2;

//=============================================================================================

signed main() {
  ll n;
  cin >> n;

  V<PAIR> v;
  v.reserve(n);
  REP(_, n) {
    string s;
    cin >> s;
    stack<char> stk;
    REPC(c, s) {
      if (stk.empty()) {
        stk.emplace(c);
        continue;
      }
      if (stk.top() == '(' && c == ')') {
        stk.pop();
        continue;
      }
      stk.emplace(c);
    }
    ll lft = 0, rgt = 0;
    while (!stk.empty()) {
      ++((stk.top() == '(') ? lft : rgt);
      stk.pop();
    }
    v.emplace_back(lft, rgt);
  }
  dump(v);
  ll lft = 0, rgt = 0;
  V<PAIR> t;
  t.reserve(n);
  for (const auto &[l, r] : v) {
    if (l == 0) {
      rgt += r;
      continue;
    }
    if (r == 0) {
      lft += l;
      continue;
    }
    t.emplace_back(l, r);
  }
  dump(lft, rgt, t);
  if (lft == 0 && rgt == 0 && t.size() == 0) {
    cout << "Yes" << endl;
  } else if (t.size() > 0 && (lft == 0 || rgt == 0)) {
    cout << "No" << endl;
  } else {
    std::sort(ALL(t), [](cauto a, cauto b) {
      ll lra = a.first - a.second;
      ll lrb = b.first - b.second;
      if (lra * lrb <= 0) {
        return (lra >= 0);
      }
      return a.second < b.second;
    });
    for (const auto &[l, r] : t) {
      lft -= r;
      if (lft < 0) {
        cout << "No" << endl;
        return 0;
      }
      lft += l;
    }
    lft -= rgt;
    cout << ((lft == 0) ? "Yes" : "No") << endl;
  }
}