Problem p02651 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double, ll> Ps;

const ll INF = 2e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue<ll> pql;
priority_queue<P> pqp;
priority_queue<P> bag;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
// ↓,→,↑,←

#define endl "\\n"
#ifdef ENJAPMA
#undef endl
#endif
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {
  ll x = 1;
  while (b) {
    while (!(b & 1)) {
      (a *= a) %= mod;
      b >>= 1;
    }
    (x *= a) %= mod;
    b--;
  }
  return x;
}
void YES(bool cond) {
  if (cond) {
    p("YES");
  } else {
    p("NO");
  }
  return;
}
void Yes(bool cond) {
  if (cond) {
    p("Yes");
  } else {
    p("No");
  }
  return;
}

/*
ll fact[fact_table + 5],rfact[fact_table + 5];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

bool multicase = true;

ll n, m, num, a, b, c, d, e, h, q;
ll w, k, ans;

ll x[500005], y[500005], z[500005];
string s;

const int MAX_ROW = 65;  // to be set appropriately
const int MAX_COL = 205; // to be set appropriately
struct BitMatrix {
  int H, W;
  bitset<MAX_COL> val[MAX_ROW];
  BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
  inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};

ostream &operator<<(ostream &s, BitMatrix A) {
  s << endl;
  for (int i = 0; i < A.H; ++i) {
    for (int j = 0; j < A.W; ++j) {
      s << A[i][j] << ", ";
    }
    s << endl;
  }
  return s;
}

int GaussJordan(BitMatrix &A, bool is_extended = false) {
  int rank = 0;
  for (int col = 0; col < A.W; ++col) {
    if (is_extended && col == A.W - 1)
      break;
    int pivot = -1;
    for (int row = rank; row < A.H; ++row) {
      if (A[row][col]) {
        pivot = row;
        break;
      }
    }
    if (pivot == -1)
      continue;
    swap(A[pivot], A[rank]);
    for (int row = 0; row < A.H; ++row) {
      if (row != rank && A[row][col])
        A[row] ^= A[rank];
    }
    ++rank;
  }
  return rank;
}

int linear_equation(BitMatrix A, vector<int> b) {
  int m = A.H, n = A.W;
  BitMatrix M(m, n + 1);
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j < n; ++j)
      M[i][j] = A[i][j];
    M[i][n] = b[i];
  }
  int rank = GaussJordan(M, true);

  // check if it has no solution
  for (int row = rank; row < m; ++row)
    if (M[row][n])
      return -1;

  // answer
  return rank;
}

vector<int> v;

void solve() {
  cin >> n;
  for (ll i = 0; i < n; i++) {
    cin >> x[i];
    assert(x[i] != 0);
  }
  cin >> s;
  ll ones = 0;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '1')
      ones++;
  }
  const int DIGIT = 61;
  BitMatrix A(DIGIT, n);
  ll cnt = 0;
  bool dame = false;
  for (ll i = n - 1; i >= 0; i--) {
    if (s[i] == '0') {
      // 列に追加する
      for (ll j = 0; j < 60; j++) {
        if (x[i] & 1)
          A[j][cnt] = 1;
        x[i] >>= 1;
      }
      cnt++;
    } else {
      v.clear();
      for (ll j = 0; j < 60; j++) {
        if (x[i] & 1) {
          v.pb(1);
        } else {
          v.pb(0);
        }
        x[i] >>= 1;
      }
      int ans = linear_equation(A, v);
      if (ans == -1) {
        dame = true;
        break;
      } else if (ans >= 60) {
        break;
      }
      ones--;
      if (ones == 0)
        break;
    }
  }
  if (dame) {
    p(1);
  } else {
    p(0);
  }

  return;
}

int main() {
  // init();
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q, testcase = 1;
  if (multicase) {
    cin >> q;
  } else {
    q = 1;
  }
  while (q--) {
    // pu("Case ");pu("#");pu(testcase);pu(": ");
    solve();
    testcase++;
  }
  // solve();
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double, ll> Ps;

const ll INF = 2e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue<ll> pql;
priority_queue<P> pqp;
priority_queue<P> bag;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
// ↓,→,↑,←

#define endl "\\n"
#ifdef ENJAPMA
#undef endl
#endif
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {
  ll x = 1;
  while (b) {
    while (!(b & 1)) {
      (a *= a) %= mod;
      b >>= 1;
    }
    (x *= a) %= mod;
    b--;
  }
  return x;
}
void YES(bool cond) {
  if (cond) {
    p("YES");
  } else {
    p("NO");
  }
  return;
}
void Yes(bool cond) {
  if (cond) {
    p("Yes");
  } else {
    p("No");
  }
  return;
}

/*
ll fact[fact_table + 5],rfact[fact_table + 5];

void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

bool multicase = true;

ll n, m, num, a, b, c, d, e, h, q;
ll w, k, ans;

ll x[500005], y[500005], z[500005];
string s;

const int MAX_ROW = 65;     // to be set appropriately
const int MAX_COL = 110000; // to be set appropriately
struct BitMatrix {
  int H, W;
  bitset<MAX_COL> val[MAX_ROW];
  BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
  inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};

ostream &operator<<(ostream &s, BitMatrix A) {
  s << endl;
  for (int i = 0; i < A.H; ++i) {
    for (int j = 0; j < A.W; ++j) {
      s << A[i][j] << ", ";
    }
    s << endl;
  }
  return s;
}

int GaussJordan(BitMatrix &A, bool is_extended = false) {
  int rank = 0;
  for (int col = 0; col < A.W; ++col) {
    if (is_extended && col == A.W - 1)
      break;
    int pivot = -1;
    for (int row = rank; row < A.H; ++row) {
      if (A[row][col]) {
        pivot = row;
        break;
      }
    }
    if (pivot == -1)
      continue;
    swap(A[pivot], A[rank]);
    for (int row = 0; row < A.H; ++row) {
      if (row != rank && A[row][col])
        A[row] ^= A[rank];
    }
    ++rank;
  }
  return rank;
}

int linear_equation(BitMatrix A, vector<int> b) {
  int m = A.H, n = A.W;
  BitMatrix M(m, n + 1);
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j < n; ++j)
      M[i][j] = A[i][j];
    M[i][n] = b[i];
  }
  int rank = GaussJordan(M, true);

  // check if it has no solution
  for (int row = rank; row < m; ++row)
    if (M[row][n])
      return -1;

  // answer
  return rank;
}

vector<int> v;

void solve() {
  cin >> n;
  for (ll i = 0; i < n; i++) {
    cin >> x[i];
    assert(x[i] != 0);
  }
  cin >> s;
  ll ones = 0;
  for (ll i = 0; i < n; i++) {
    if (s[i] == '1')
      ones++;
  }
  const int DIGIT = 61;
  BitMatrix A(DIGIT, n);
  ll cnt = 0;
  bool dame = false;
  for (ll i = n - 1; i >= 0; i--) {
    if (s[i] == '0') {
      // 列に追加する
      for (ll j = 0; j < 60; j++) {
        if (x[i] & 1)
          A[j][cnt] = 1;
        x[i] >>= 1;
      }
      cnt++;
    } else {
      v.clear();
      for (ll j = 0; j < 60; j++) {
        if (x[i] & 1) {
          v.pb(1);
        } else {
          v.pb(0);
        }
        x[i] >>= 1;
      }
      int ans = linear_equation(A, v);
      if (ans == -1) {
        dame = true;
        break;
      } else if (ans >= 60) {
        break;
      }
      ones--;
      if (ones == 0)
        break;
    }
  }
  if (dame) {
    p(1);
  } else {
    p(0);
  }

  return;
}

int main() {
  // init();
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q, testcase = 1;
  if (multicase) {
    cin >> q;
  } else {
    q = 1;
  }
  while (q--) {
    // pu("Case ");pu("#");pu(testcase);pu(": ");
    solve();
    testcase++;
  }
  // solve();
  return 0;
}