【模板】线性基求交——牛客多校第四场B

既然是模板，那么话不多说直接上代码

#include<bits/stdc++.h>
using namespace std;
#define u32 unsigned int
//#define u32 long long
const int maxn = 5e4 + 10;
u32 a[maxn][32];
//#define int long long
struct LinerBasis {
    u32 xo[32];
    u32& operator[](int cur) {
        return xo[cur];
    }
    LinerBasis& operator=(const LinerBasis& rhs) {
        for (int i = 0; i <= 31; ++i)
            xo[i] = rhs[i];
        return *this;
 
    }
    u32 operator[](int cur)const {
        return xo[cur];
    }
    LinerBasis() {
        memset(xo, 0, sizeof(xo));
    }
    LinerBasis(const LinerBasis& rhs) {
        for (int i = 0; i <= 31; ++i)
            xo[i] = rhs[i];
    }
    void insert(u32 cur) {
        if (cur == 0)return;
        for (int i = 31; i >= 0; --i) {
            if (cur & (1 << i))
                if (xo[i])cur ^= xo[i];
                else {
                    xo[i] = cur;
                    break;
                }
        }
    }
    int check(u32 cur) {
        for (int i = 31; i >= 0; --i) {
            if (cur & (1 << i))
                if (xo[i])cur ^= xo[i];
                else return 0;
        }
        return 1;
    }
 
};
 
//线性基求交
const LinerBasis Intersection(const LinerBasis& a, const LinerBasis& b) {
    LinerBasis c(a),d=a;
    LinerBasis ans;
    //a 1 2
    //b 0 3
    for (int i = 0; i <= 31; ++i) {
        u32 v = b[i], u = 0;
        int can = 1;
        if(b[i])
        for (int j = 31; j >= 0; --j) {
            if (v & (1 << j))
                if (c[j]) {
                    v ^= c[j];
                    // if(c[j]==a[j])
                    u ^= d[j];
                    //cerr<<u<<endl;
                }
                else {
                    //cerr << "else " << endl;
                    can = 0;
                    c[j]=v;
                    d[j]=u;
                    break;
                }
        }
        if (can)ans.insert(u);
    }
    return ans;
 
}
// LinerBasis intersection(const LinerBasis &a, const LinerBasis &b)
//     {
//         LinerBasis ans = {}, c = b, d = b;
//         for (int i = 0; i < 32; i++)
//         {
//             unsigned int x = a[i];
//             if (!x)continue;
//             int j = i;
//             unsigned int T = 0;
//             for (; j >= 0; --j)
//             {
//                 if ((x >> j) & 1)
//                     if (c[j]) { x ^= c[j]; T ^= d[j]; }
//                     else break;
//             }
//             if (!x)ans[i] = T;
//             else { c[j] = x;
//               //d[j] = T;
//             }
//         }
//         return ans;
//     }
struct node {
    int l, r;
    LinerBasis x;
}tr[maxn << 2];
int n, m, l, r;
u32 x;
void build(int root, int l, int r) {
    tr[root].l = l, tr[root].r = r;
    if (l == r) {
        for (int i = 1; i <= 32; ++i)
            tr[root].x.insert(a[l][i]);
        /*cerr << "debug start+++++++++++" << endl;
        for (int i = 0; i <= 3; ++i)
            cerr << i << " " << tr[root].x[i] << " " << endl;
        cerr << "debug end" << endl;*/
        return;
    }
    int mid = (l + r) >> 1;
    build(root << 1, l, mid);
    build(root << 1 | 1, mid + 1, r);
    tr[root].x = Intersection(tr[root << 1].x, tr[root << 1 | 1].x);
    /*cerr << "debug-------- "<<l<<" "<<r << endl;
    for (int i = 0; i <= 3; ++i)
        cerr <<i<<" "<< tr[root].x[i] << " " << endl;
    cerr << "debug end" << endl;*/
}
int quare(int root, int L, int R,u32 aim) {
    int l = tr[root].l, r = tr[root].r;
    if (l == L && r == R) {
        return tr[root].x.check(aim);
    }
    int mid = (l + r) >> 1;
    if (L > mid)return quare(root << 1 | 1, L, R, aim);
    else if (R <= mid)return quare(root << 1, L, R, aim);
    else return quare(root << 1, L, mid, aim) && quare(root << 1 | 1, mid + 1, R, aim);
}
/*
2 3
2 1 2
1 3
 
4 3
2 1 2
5 3 4 5 1  2
2 1 2
2 3 1
*/
signed main() {
    ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        int tmp;
        cin >> tmp;
        for (int j = 1; j <= tmp; ++j)cin >> a[i][j];
    }
    build(1, 1, n);
    while (m--) {
        cin >> l >> r >> x;
        cout << (quare(1, l, r, x) ? "YES" : "NO") << endl;
    }
    return 0;
}