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

#include <algorithm>
#include <bitset>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits.h>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (ll i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \\
  sort(A, A + N,                                                               \\
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
#define endl '\\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

ll N;
string S;
ll A, B, C, D, E, F, G, H;
ll Lsum, Rsum;

ll MVL, MVR;
vector<pair<ll, ll>> LV, RV;

int main() {
  cin >> N;
  rep(i, N) {
    S.clear();
    cin >> S;
    ll L = 0, R = 0, cnt = 0;
    bool X = 0, Y = 0;
    ll NL = 0, NR = 0;
    rep(i, S.size()) {
      if (S[i] == '(') {
        L++;
        cnt++;
      } else {
        R++;
        cnt--;
      }
      if (cnt < 0) {
        X = 1;
      }
      NL = max(NL, -cnt);
    }
    Lsum += L;
    Rsum += R;
    cnt = 0;
    rrep(i, S.size()) {
      if (S[i] == '(') {
        cnt--;
      } else {
        cnt++;
      }
      if (cnt < 0) {
        Y = 1;
      }
      NR = max(NR, -cnt);
    }
    if (L == R) {
      MVL = max(MVL, NL);
      MVR = max(MVR, NR);
      if (!X && !Y)
        H++;
    }
    if (L > R) {
      LV.pb(mp(NL, L - R));
      A++;
    }
    if (R > L) {
      RV.pb(mp(NR, R - L));
      C++;
    }
  }
  // rep(i,LV.size()){
  //   cout << LV[i].fr << " " << LV[i].sc << endl;
  // }
  // cout << endl;
  // rep(i,RV.size()){
  //   cout << RV[i].fr << " " << RV[i].sc << endl;
  // }
  cout << endl;
  if (Lsum != Rsum) {
    cNo;
    return 0;
  }
  if (A == 0 && C == 0) {
    if (N == H)
      cYes;
    else
      cNo;
    return 0;
  } else {
    sort(ALL(LV));
    sort(ALL(RV));
    ll sum = 0;
    rep(i, LV.size()) {
      sum -= LV[i].fr;
      if (sum < 0) {
        cNo;
        return 0;
      }
      sum += LV[i].sc + LV[i].fr;
      // cout << sum <<endl;
    }
    if (sum < MVL) {
      cNo;
      return 0;
    }
    sum = 0;
    rep(i, RV.size()) {
      sum -= RV[i].fr;
      if (sum < 0) {
        cNo;
        return 0;
      }
      sum += RV[i].sc + RV[i].fr;
    }
    if (sum < MVR) {
      cNo;
      return 0;
    }
    cYes;
  }
}

Error: -11

Fixed submission:

#include <algorithm>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (ll i = b - 1; i >= a; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \\
  sort(A, A + N,                                                               \\
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
#define endl '\\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
// constexpr ll MOD=1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

const int MAX = 4000003;

long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

// 二項係数計算
long long COM(int n, int k) {
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

ll cme;

ll modpow(ll b, ll e, ll m) { // bのe乗のmod m を返す
  if (e == 0)
    return 1;
  cme = modpow(b, e / 2, m);
  cme = (cme * cme) % m;
  if (e % 2 == 1)
    cme = (cme * b) % m;
  return cme;
}

ll N, Z, M;
ll A, B, C, E, F, G;
vector<string> S;
ll L[1000007], R[1000007], hL[1000007], hR[1000007];
vector<pair<ll, pair<ll, ll>>> P;

int main() {
  cin >> N;
  rep(i, N) {
    string T;
    cin >> T;
    S.pb(T);
    ll x = 0;
    rep(j, T.size()) {
      if (T[j] == ')') {
        x++;
        hR[i]++;
      } else {
        x--;
        hL[i]++;
      }
      L[i] = max(L[i], x);
    }
    x = 0;
    rrep(j, T.size()) {
      if (T[j] == '(') {
        x++;
      } else {
        x--;
      }
      R[i] = max(R[i], x);
    }

    if (N == 1) {
      if ((L[i] == 0 && R[i] == 0) && hL[i] - hR[i] == 0) {
        cYes;
      } else {
        cNo;
      }
      return 0;
    }

    if (Z == 0 && R[i] == 0) {
      A = L[i];
      B = R[i];
      C = hL[i] - hR[i];
      Z++;
      continue;
    } else if ((Z == 1 && R[i] == 0) && hL[i] - hR[i] < G) {
      ll D, X, Y;
      D = L[i];
      A = D;
      L[i] = A;
      Y = R[i];
      B = Y;
      R[i] = B;
      X = C;
      C = hL[i] - hR[i];
      hL[i] = X;
      hR[i] = 0;
    } else if (M == 0 && L[i] == 0) {
      E = L[i];
      F = R[i];
      G = hL[i] - hR[i];
      M++;
      continue;
    } else if ((M == 1 && L[i] == 0) && hL[i] - hR[i] > G) {
      ll D, X, Y;
      D = L[i];
      A = D;
      L[i] = A;
      Y = R[i];
      B = Y;
      R[i] = B;
      X = G;
      G = hL[i] - hR[i];
      hL[i] = X;
      hR[i] = 0;
    } else {
      P.pb(mp(L[i], mp(R[i], hL[i] - hR[i])));
    }
  }
  if (Z == 0 || M == 0) {
    cNo;
    return 0;
  }
  sort(ALL(P),
       [](const pair<ll, pair<ll, ll>> &a, const pair<ll, pair<ll, ll>> &b) {
         return a.fr != b.fr ? a.fr < b.fr : a.sc.sc > b.sc.sc;
       });
  ll nl = F, nr = 0;
  rep(i, N - 2) {
    if (nl < P[i].first) {
      cNo;
      return 0;
    }
    nl += P[i].sc.sc;
  }
  if (nl + C == 0) {
    cYes;
  } else {
    cNo;
  }
}