状压DP20分不过 求调

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1000009;
ll T,a[409],f[(1<<20)+9],cnt=0;
ll LSB(ll x){return x&(-x);}
ll mex(){
	sort(a+1,a+cnt+1);
	bool ok=0;
	ll ans=0;
	if(!cnt) return 0;
	for(ll i=1;i<=cnt;++i){
		if(a[i]==ans) ++ans,ok=1;
		if(ans<a[i]) return ans; 
	}
	return ans;
}
ll change(ll x,ll i){//第i列往右边走
	for(ll k=i+1;k<20;++k)
		if(!(x&(1<<k))){
//			cout<<x<<":"<<(x^(1<<i)^(1<<k))<<"\n";
			return x^(1<<i)^(1<<k);
		}
	return 0;
}
int main(){//11111111111111111111
	for(ll i=(1<<20)-1;i>=1;--i){
//ll i=(1<<20)-1;
//		cout<<i<<" ";
		if(LSB(i+1)==i+1) f[i]=0;
		else{
			cnt=0;
			for(ll j=0;j<20;++j)//移动j位 
				if(i&(1<<j)){//单调队列
					ll x=change(i,j);
					if(x) a[++cnt]=f[x];
				}
			f[i]=mex();
		}
	}
//	for(ll i=(1<<20)-1;i>=1;--i) cout<<f[i]<<" ";
	cin>>T;
	while(T--){
		ll n,sum=0;
		cin>>n;
		for(ll i=1;i<=n;++i){
			ll m,z=0;
			cin>>m;
			for(ll j=1;j<=m;++j){
				ll x;
				cin>>x;
				z|=(1<<(x-1));
			}
			sum^=f[z];
		}
		cout<<(sum?"YES\n":"NO\n");
	}
	
	return 0;
}