完全看不懂 線性基求交。。。只能抄別人板子
學習鏈接:https://blog.csdn.net/demon_rieman/article/details/88830846
我怎麼感覺他說的每個字我都認識但組在一起我就不認識了
#include<bits/stdc++.h>
#define maxl 50010
using namespace std;
int n,m,q;
int sz[maxl];
unsigned int a[maxl][33];
struct LB
{
int cnt;bool flag;
unsigned int p[32],f[32];
inline void init()
{
cnt=0;flag=false;
memset(f,0,sizeof(f));
memset(p,0,sizeof(p));
}
inline bool insert(unsigned int x)
{
for(int i=31;i>=0;i--)
if(x&(1ll<<i))
{
if(!p[i])
{
p[i]=x;
break;
}
x^=p[i];
}
return x>0;
}
inline void insert2(unsigned int x)
{
unsigned int tmp=x;
for(int i=31;i>=0;i--)
if(x>>i)
{
if(!p[i])
{
f[i]=tmp;p[i]=x;
return;
}
x^=p[i];tmp^=f[i];
}
}
inline bool find(unsigned int x)
{
for(int i=31;i>=0;i--)
if(x>>i)
{
if(!p[i]) return 0;
x^=p[i];
}
return x==0;
}
unsigned int calc(unsigned int x)
{
unsigned int ret=0;
for(int i=31;i>=0;i--)
if(x>>i)
{
ret^=f[i];
x^=p[i];
}
return ret;
}
};
struct node
{
int l,r;
LB xxj;
}tree[maxl*4];
inline void pushup(int k)
{
LB tmp=tree[k<<1].xxj;
LB ans;
ans.init();
for(int i=31;i>=0;i--)
{
unsigned int x=tree[k<<1|1].xxj.p[i];
if(tmp.find(x))
ans.insert(x^tmp.calc(x));
else
tmp.insert2(x);
}
tree[k].xxj=ans;
}
inline void build(int k,int l,int r)
{
tree[k].l=l;tree[k].r=r;tree[k].xxj.init();
if(l==r)
{
for(int i=1;i<=sz[l];i++)
tree[k].xxj.insert(a[l][i]);
return;
}
int mid=(l+r)>>1;
build(k<<1,l,mid);
build(k<<1|1,mid+1,r);
pushup(k);
}
inline void prework()
{
for(int i=1;i<=n;i++)
{
scanf("%d",&sz[i]);
for(int j=1;j<=sz[i];j++)
scanf("%u",&a[i][j]);
}
build(1,1,n);
}
inline bool query(int k,int l,int r,unsigned int x)
{
if(tree[k].l==l && tree[k].r==r)
return tree[k].xxj.find(x);
int mid=(tree[k].l+tree[k].r)>>1;
if(r<=mid)
return query(k<<1,l,r,x);
else if(l>mid)
return query(k<<1|1,l,r,x);
else
return query(k<<1,l,mid,x) && query(k<<1|1,mid+1,r,x);
}
inline void mainwork()
{
int l,r;unsigned int x;
for(int i=1;i<=q;i++)
{
scanf("%d%d%u",&l,&r,&x);
if(query(1,l,r,x))
puts("YES");
else
puts("NO");
}
}
int main()
{
while(~scanf("%d%d",&n,&q))
{
prework();
mainwork();
// print();
}
return 0;
}