51nod 1577 异或凑数 （线性基）

https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1577

构造出一个最大无关组
然后对询问检查这个k是否可以由最大无关组表达出来
即是否能异或出0
一边插入一边解决询问

#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <queue>
#include <cstdio>
#include <map>
#include <set>
#include <utility>
#include <stack>
#include <cstring>
#include <cmath>
#include <vector>
#include <ctime>
#include <bitset>
using namespace std;
#define pb push_back
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define ss(str) scanf("%s",str)
#define ansn() printf("%d\n",ans)
#define lansn() printf("%lld\n",ans)
#define r0(i,n) for(int i=0;i<(n);++i)
#define r1(i,e) for(int i=1;i<=e;++i)
#define rn(i,e) for(int i=e;i>=1;--i)
#define mst(abc,bca) memset(abc,bca,sizeof abc)
#define lowbit(a) (a&(-a))
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pll pair<long long,long long>
#define mp(aa,bb) make_pair(aa,bb)
#define lrt rt<<1
#define rrt rt<<1|1
#define X first
#define Y second
#define PI (acos(-1.0))
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007 ;
const double eps=1e-9;
const int inf=0x3f3f3f3f;
//const ll infl = 100000000000000000;//1e17
const int maxn=  5e5+20;
const int maxm = 2e5+20;
//muv[i]=(p-(p/i))*muv[p%i]%p;
int in(int &ret) {
    char c;
    int sgn ;
    if(c=getchar(),c==EOF)return -1;
    while(c!='-'&&(c<'0'||c>'9'))c=getchar();
    sgn = (c=='-')?-1:1;
    ret = (c=='-')?0:(c-'0');
    while(c=getchar(),c>='0'&&c<='9')ret = ret*10+(c-'0');
    ret *=sgn;
    return 1;
}

int a[maxn];
int f[33];
int p[33];
bool b[maxn];
struct node {
    int r,x,id;
    node() {}
    node(int a,int b,int c) {
        r = a,x = b,id = c;
    }
};
vector<node>v[maxn];
int main() {
#ifdef LOCAL
    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
#endif // LOCAL

    int n;
    in(n);
    int m;
    r1(i,n)in(a[i]);
    in(m);
    r1(i,m) {
        int l,r,x;
        in(l),in(r),in(x);
        v[l].pb(node(r,x,i));
    }
    rn(i,n) {
        int x = a[i];
        int y = i;
        for(int j=29; ~j; --j) {
            if(1&(x>>j)) {
                if(!f[j]) {
                    f[j] = x;
                    p[j] = y;
                    break;
                }
                if(y<p[j]) {
                    swap(x,f[j]);
                    swap(y,p[j]);
                }
                x^=f[j];
            }
        }
        int sz = v[i].size();
        r0(e,sz) {
            int id = v[i][e].id;
            int r = v[i][e].r;
            int q = v[i][e].x;
            bool ok = 1;
            for(int j=29; ~j&&ok; --j) {
                if(1&(q>>j)) {
                    if(f[j]&&r>=p[j])q^=f[j];
                    else ok  = 0;
                }
            }
            b[id] = ok;
        }
    }
    r1(i,m)if(b[i])puts("YES");
    else puts("NO");
    return 0;
}