#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <unordered_map>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(1e9+7)
#define pb push_back
#define eps 1e-7
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int y,n,m,x,z;
struct as{
int l,r;
int p[33];
void add(ll x)
{
FOL(j,32,0)
{
if(!(x&(1<<j))) continue;
if(!p[j]) p[j]=x;
x^=p[j];
}
}
bool gans(int t)
{
FOL(i,32,0)
if(t&(1<<i)) t^=p[i];
return t==0;
}
void init() {REW(p,0);}
as merge(as A) //合并
{
as t;
t.init();t.l=l,t.r=A.r;
FOL(i,32,0) t.p[i]=p[i];
FOL(i,32,0)
{
if(A.p[i])
{
ll x=A.p[i];
FOL(j,i,0)
{
if(x>>j&1)
{
if(!t.p[j]) {t.p[j]=x;break;}
x^=t.p[j];
}
if(x==0) break;
}
}
}
return t;
}
as Merge(as A) //求交
{
as t,z,d;
t.init();z.init();d.init();
t.l=l,t.r=A.r;
FOL(i,32,0) z.p[i]=p[i],d.p[i]=(1<<i);
FOL(i,32,0)
{
if(A.p[i])
{
int x=A.p[i],qw=0;
bool flag=1;
FOL(j,i,0)
{
if(x>>j&1)
{
if(z.p[j]) {x^=z.p[j],qw^=d.p[j];continue;}
flag=0,z.p[j]=x,d.p[j]=qw;break;
}
}
if(flag)
{
int x=0;
FOL(j,32,0)
if(qw&(1<<j)) x^=p[j];
t.add(x);
}
}
}
return t;
}
}tr[50008<<2],qw;
inline int read()
{
int X=0,w=0; char ch=0;
while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
return w?-X:X;
}
void push(int d){tr[d]=tr[lc].Merge(tr[rc]);}
void build(int d,int l,int r)
{
tr[d].l=l,tr[d].r=r;
if(l==r)
{
x=read();
while(x--) y=read(),tr[d].add(y);
return;
}
int mid=(l+r)>>1;
build(lc,l,mid);
build(rc,mid+1,r);
push(d);
}
bool query(int d,int l,int r,int y)
{
if(tr[d].l==l&&tr[d].r==r) {return tr[d].gans(y);}
int mid=(tr[d].l+tr[d].r)>>1;
if(mid>=r) return query(lc,l,r,y);
else if(l>mid) return query(rc,l,r,y);
else return (query(lc,l,mid,y)&(query(rc,mid+1,r,y)));
}
int main()
{
cin.tie(0);
cout.tie(0);
cin>>n>>m;
build(1,1,n);
while(m--)
{
si(x),si(y),si(z);
if(query(1,x,y,z)) puts("YES");
else puts("NO");
}
return 0;
}
线性基求交合并模板
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.