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

/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll conbinationMemo[100][100];

void cmemoInit() {
  rep(i, 100) {
    rep(j, 100) { conbinationMemo[i][j] = -1; }
  }
}

ll nCr(ll n, ll r) {
  if (conbinationMemo[n][r] != -1)
    return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}
//-----------------------ここから-----------

int main(void) {
  ll n;
  cin >> n;
  vector<pair<pair<ll, ll>, string>> vec1;
  vector<pair<pair<ll, ll>, string>> vec2;

  rep(i, n) {
    string s;
    cin >> s;
    ll cnt = 0;
    ll mi = 0;
    rep(j, s.size()) {
      if (s[j] == '(') {
        cnt++;
      } else {
        cnt--;
      }
      mi = min(mi, cnt);
    }

    ll revcnt = 0;
    ll revmin = 0;
    for (int j = s.size(); j >= 0; j--) {
      if (s[j] == ')') {
        revcnt++;
      } else {
        revcnt--;
      }
      revmin = min(revmin, revcnt);
    }
    if (cnt > 0) {
      vec1.push_back({{mi, cnt}, s});
    } else {
      vec2.push_back({{revmin, revcnt}, s});
    }
  }

  sort(all(vec1), greater<pair<pair<ll, ll>, string>>());
  sort(all(vec2));

  string str = "";
  rep(i, vec1.size()) { str += vec1[i].second; }
  rep(i, vec2.size()) { str += vec2[i].second; }
  ll ans = 0;

  rep(i, str.size()) {
    if (str[i] == '(') {
      ans++;
    } else {
      ans--;
    }
    if (ans < 0) {
      cout << "No" << endl;
      return 0;
    }
  }

  if (ans == 0) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}


Error: -11

Fixed submission:

/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll conbinationMemo[100][100];

void cmemoInit() {
  rep(i, 100) {
    rep(j, 100) { conbinationMemo[i][j] = -1; }
  }
}

ll nCr(ll n, ll r) {
  if (conbinationMemo[n][r] != -1)
    return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}
//-----------------------ここから-----------
int main(void) {
  ll n;
  cin >> n;
  vector<string> s;
  map<pair<ll, ll>, ll> mp;
  rep(i, n) {
    cin >> s[i];
    ll left = 0;
    ll right = 0;
    rep(j, s[i].size()) {
      if (s[i][j] == '(') {
        left++;
      } else {
        right++;
      }
    }
    mp[{left, right}]++;
  }

  ll totall = 0;
  ll totalr = 0;
  for (auto &i : mp) {
    totall = i.first.first * i.second;
    totalr = i.first.second * i.second;
    ;
  }

  if (totall != totalr) {
    cout << "No" << endl;
    return 0;
  }

  cout << "Yes" << endl;
}