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

const int isDebugMode = 0;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
  long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e)                                                      \\
  (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e)                                                      \\
  (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
void pt() {
  cout << endl;
  return;
}
template <class Head> void pt(Head &&head) {
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void pt(Head &&head, Tail &&...tail) {
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
void dpt() {
  if (!isDebugMode)
    return;
  cout << endl;
  return;
}
template <class Head> void dpt(Head &&head) {
  if (!isDebugMode)
    return;
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void dpt(Head &&head, Tail &&...tail) {
  if (!isDebugMode)
    return;
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
template <class T> void debug(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) cout << v[i] << " ";
  cout << endl;
}
template <class T> void debug2(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) {
    rep(j, v[i].size()) cout << v[i][j] << " ";
    cout << endl;
  }
}
template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> long long gcd(T1 a, T2 b) {
  return a % b ? gcd(b, a % b) : b;
}
template <class T1, class T2> void reduce(T1 &a, T2 &b) {
  ll g = gcd(a, b);
  a /= g;
  b /= g;
  return;
}
bool valid(long long H, long long W, long long h, long long w) {
  return 0 <= h && h < H && 0 <= w && w < W;
}

void solve() {
  ll N;
  cin >> N;
  vector<ll> a(N);
  rep(i, N) cin >> a[i];
  string S;
  cin >> S;
  vector<ll> one;
  vector<ll> zero;
  ll stand;
  bool ok = false;
  for (ll q = N - 1; 0 <= q; q--) {
    if (S[q] == '0') {
      zero.push_back(a[q]);
    } else {
      one.push_back(a[q]);
    }

    if (S[q] == '1') {
      rep(i, zero.size()) {
        sort((zero.begin() + i), zero.end());
        reverse((zero.begin() + i), zero.end());
        for (stand = 63; 0 <= stand; stand--) {
          if ((zero[i] >> stand) & 1 == 1)
            break;
        }
        for (ll j = i + 1; j < zero.size(); j++) {
          if ((zero[j] >> stand) & 1 == 1)
            zero[j] = zero[j] ^ zero[i];
        }
      }
      debug(zero);
      ll num = *(one.end() - 1);
      rep(j, zero.size()) {
        for (stand = 63; 0 <= stand; stand--) {
          if ((zero[j] >> stand) & 1 != 0)
            break;
        }
        if (stand < 0)
          continue;
        if ((num >> stand) & 1 == 1)
          num = num ^ zero[j];
        dpt(" ", stand, num);
      }
      if (num != 0)
        ok = true;
    }
  }
  pt(ok);
}

int main() {
  ll T;
  cin >> T;
  rep(_, T) { solve(); }
  return 0;
}

Error: 0

Fixed submission:

const int isDebugMode = 0;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
  long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e)                                                      \\
  (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e)                                                      \\
  (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
void pt() {
  cout << endl;
  return;
}
template <class Head> void pt(Head &&head) {
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void pt(Head &&head, Tail &&...tail) {
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
void dpt() {
  if (!isDebugMode)
    return;
  cout << endl;
  return;
}
template <class Head> void dpt(Head &&head) {
  if (!isDebugMode)
    return;
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void dpt(Head &&head, Tail &&...tail) {
  if (!isDebugMode)
    return;
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
template <class T> void debug(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) cout << v[i] << " ";
  cout << endl;
}
template <class T> void debug2(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) {
    rep(j, v[i].size()) cout << v[i][j] << " ";
    cout << endl;
  }
}
template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> long long gcd(T1 a, T2 b) {
  return a % b ? gcd(b, a % b) : b;
}
template <class T1, class T2> void reduce(T1 &a, T2 &b) {
  ll g = gcd(a, b);
  a /= g;
  b /= g;
  return;
}
bool valid(long long H, long long W, long long h, long long w) {
  return 0 <= h && h < H && 0 <= w && w < W;
}

int solve() {
  ll N;
  cin >> N;
  vector<ll> a(N);
  rep(i, N) cin >> a[i];
  string S;
  cin >> S;
  vector<ll> one;
  vector<ll> zero;
  rep(i, N) {
    if (S[i] == '0') {
      zero.push_back(a[i]);
    } else {
      one.push_back(a[i]);
    }
  }
  ll stand;
  rep(i, zero.size()) {
    sort((zero.begin() + i), zero.end());
    reverse((zero.begin() + i), zero.end());
    for (stand = 62; 0 <= stand; stand--) {
      if (zero[i] >> stand & 1)
        break;
    }
    for (ll j = i + 1; j < zero.size(); j++) {
      if (zero[j] >> stand & 1)
        zero[j] = zero[j] ^ zero[i];
    }
    debug(zero);
  }
  bool ok = true;
  rep(i, one.size()) {
    ll num = one[i];
    dpt(num);
    rep(j, zero.size()) {
      for (stand = 62; 0 <= stand; stand--) {
        if (zero[j] >> stand & 1)
          break;
      }
      dpt(" ", stand, num, zero[j]);
      if (num >> stand & 1)
        num = num ^ zero[j];
    }
    dpt(num, one[i]);
    if (num)
      ok = false;
  }
  pt(ok ? 0 : 1);
}

int main() {
  ll T;
  cin >> T;
  rep(_, T) { solve(); }
  return 0;
}