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

#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define REP(i, n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define all(v) ALL(v)
#define sz(x) (int)(x).size()
#define debug(x) cerr << #x << ":" << x << endl
#define debug2(x, y) cerr << #x << "," << #y ":" << x << "," << y << endl
// struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double {
  double d;
  explicit Double(double x) : d(x) {}
};
ostream &operator<<(ostream &os, const Double x) {
  os << fixed << setprecision(20) << x.d;
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "[";
  for (const auto &v : vec) {
    os << v << ",";
  }
  os << "]";
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
constexpr double eps = 1e-14;
constexpr ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
/*}}}*/

int N;
constexpr int n = 26;

void solve() {
  vector<int> c(N);
  rep(i, N) {
    char cc;
    cin >> cc;
    c[i] = cc - 'A';
  }

  vi cnt(n, 0);
  rep(i, N) {
    cnt[c[i]]++;
    vi t(cnt);
    sort(all(t));
    reverse(all(t));
    int mx1 = t[0];
    int mx2 = t[1];
    int rem = N - 1 - i;
    if (mx1 - mx2 > rem) {
      rep(j, n) if (cnt[j] == mx1) {
        cout << (char)('A' + j) << " " << (i + 1) << endl;
        return;
      }
    }
  }
  cout << "TIE" << endl;
}

int main() {
  while (cin >> N) {
    if (N == 0)
      break;
    solve();
  }
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define REP(i, n) for (int i = 0; i < n; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define MP make_pair
#define PB push_back
#define pb push_back
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define all(v) ALL(v)
#define sz(x) (int)(x).size()
#define debug(x) cerr << #x << ":" << x << endl
#define debug2(x, y) cerr << #x << "," << #y ":" << x << "," << y << endl
// struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double {
  double d;
  explicit Double(double x) : d(x) {}
};
ostream &operator<<(ostream &os, const Double x) {
  os << fixed << setprecision(20) << x.d;
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "[";
  for (const auto &v : vec) {
    os << v << ",";
  }
  os << "]";
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << "(" << p.first << "," << p.second << ")";
  return os;
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
constexpr double eps = 1e-14;
constexpr ll mod = 1e9 + 7;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
/*}}}*/

int N;
constexpr int n = 26;

void solve() {
  vector<int> c(n);
  rep(i, N) {
    char cc;
    cin >> cc;
    if (cc - 'A' < 0 or cc - 'A' >= n) {
      while (1) {
      }
    }
    c[i] = cc - 'A';
  }

  vi cnt(n, 0);
  rep(i, N) {
    cnt[c[i]]++;
    vi t(cnt);
    sort(all(t));
    reverse(all(t));
    int mx1 = t[0];
    int mx2 = t[1];
    int rem = N - 1 - i;
    if (mx1 - mx2 > rem) {
      rep(j, n) if (cnt[j] == mx1) {
        cout << (char)('A' + j) << " " << (i + 1) << endl;
        return;
      }
    }
  }
  cout << "TIE" << endl;
}

int main() {
  while (cin >> N) {
    if (N == 0)
      break;
    solve();
  }
}