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

#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

// #define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop                                                                   \\
  char nyaa;                                                                   \\
  cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(int &a, int b) { a = min(a, b); }
void chmax(int &a, int b) { a = max(a, b); }
ll mod_pow(ll a, ll n, ll m = mod) {
  a %= m;
  ll res = 1;
  while (n) {
    if (n & 1)
      res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}

struct modint {
  ll n;
  modint() : n(0) { ; }
  modint(ll m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
  a.n += b.n;
  if (a.n >= mod)
    a.n -= mod;
  return a;
}
modint operator-=(modint &a, modint b) {
  a.n -= b.n;
  if (a.n < 0)
    a.n += mod;
  return a;
}
modint operator*=(modint &a, modint b) {
  a.n = ((ll)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
  if (n == 0)
    return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2)
    res = res * a;
  return res;
}

ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b)
    return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

typedef vector<int> vec;
typedef vector<vec> mat;
// bit.ver
// rankを返す
int Gaussian_elimination(mat &A) {
  if (A.empty())
    return 0;
  int n = A.size();
  int m = A[0].size();
  int le = 0;
  rep(j, m) {
    Rep(i, le, n) {
      if (A[i][j]) {
        swap(A[le], A[i]);
        Rep(i2, le + 1, n) {
          if (A[i2][j]) {
            rep(k, m) { A[i2][k] ^= A[le][k]; }
          }
        }
        le++;
        break;
      }
    }
  }
  return le;
}

bool can(mat &A, vector<int> s) {
  rep(j, 60) {
    if (s[j] == 0)
      continue;
    per(i, (int)A.size()) {
      if (A[i][j]) {
        rep(k, 60) { s[k] ^= A[i][k]; }
        break;
      }
    }
  }
  rep(i, 60) if (s[i]) return false;
  return true;
}

void solve() {
  int n;
  cin >> n;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  string s;
  cin >> s;
  mat A;
  per(i, n) {
    vector<int> cur;
    rep(j, 60) {
      if (a[i] & (1LL << j))
        cur.push_back(1);
      else
        cur.push_back(0);
    }
    if (s[i] == '0') {
      A.push_back(cur);
    } else {
      Gaussian_elimination(A);
      if (!can(A, cur)) {
        cout << 1 << "\\n";
        return;
      }
    }
  }
  cout << 0 << "\\n";
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  // cout << fixed << setprecision(7);
  // init_f();
  // init();
  int t;
  cin >> t;
  rep(i, t) { solve(); }
  stop return 0;
}


Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;

// #define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop                                                                   \\
  char nyaa;                                                                   \\
  cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
#define all(v) (v).begin(), (v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(int &a, int b) { a = min(a, b); }
void chmax(int &a, int b) { a = max(a, b); }
ll mod_pow(ll a, ll n, ll m = mod) {
  a %= m;
  ll res = 1;
  while (n) {
    if (n & 1)
      res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}

struct modint {
  ll n;
  modint() : n(0) { ; }
  modint(ll m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
  a.n += b.n;
  if (a.n >= mod)
    a.n -= mod;
  return a;
}
modint operator-=(modint &a, modint b) {
  a.n -= b.n;
  if (a.n < 0)
    a.n += mod;
  return a;
}
modint operator*=(modint &a, modint b) {
  a.n = ((ll)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
  if (n == 0)
    return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2)
    res = res * a;
  return res;
}

ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); }
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b)
    return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

typedef vector<int> vec;
typedef vector<vec> mat;
// bit.ver
// rankを返す
int Gaussian_elimination(mat &A) {
  int n = A.size();
  int m = A[0].size();
  int le = 0;
  rep(j, m) {
    Rep(i, le, n) {
      if (A[i][j]) {
        swap(A[le], A[i]);
        Rep(i2, le + 1, n) {
          if (A[i2][j]) {
            rep(k, m) { A[i2][k] ^= A[le][k]; }
          }
        }
        le++;
        break;
      }
    }
  }
  return le;
}

bool can(mat &A, vector<int> s) {
  int le = 0;
  rep(j, 60) {
    if (s[j] == 0)
      continue;
    if (le < A.size() && A[le][j]) {
      Rep(k, j, 60) { s[k] ^= A[le][k]; }
      le++;
    }
  }
  rep(i, 60) if (s[i]) return false;
  return true;
}

void solve() {
  int n;
  cin >> n;
  vector<ll> a(n);
  rep(i, n) cin >> a[i];
  string s;
  cin >> s;
  mat A;
  per(i, n) {
    vector<int> cur;
    rep(j, 60) {
      if (a[i] & (1LL << j))
        cur.push_back(1);
      else
        cur.push_back(0);
    }
    if (s[i] == '0') {
      A.push_back(cur);
    } else {
      Gaussian_elimination(A);
      if (!can(A, cur)) {
        cout << 1 << "\\n";
        return;
      }
    }
  }
  cout << 0 << "\\n";
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  // cout << fixed << setprecision(7);
  // init_f();
  // init();
  int t;
  cin >> t;
  rep(i, t) { solve(); }
  stop return 0;
}