2016多校联合训练1 B题Chess (博弈论 SG函数)

var
  t,i,j,m,v,c,res,n,cl:longint;
  cnt:array[0..22]of longint;
  a:array[0..10000000]of longint;

procedure calc(x,c:longint);
begin
  dec(x,1<<(c-1));inc(c);
  while c<=20 do
  begin
    if x and (1<<(c-1))=0 then break;
    inc(c);
  end;
  if c>20 then exit;
  inc(x,1<<(c-1));
  cnt[a[x]]:=1;
end;

procedure init;
begin
  for i:=(1<<20)-1 downto 0 do
  begin
    fillchar(cnt,sizeof(cnt),0);
    for j:=1 to 20 do
    if i and (1<<(j-1))<>0 then calc(i,j);
    for j:=0 to 20 do
    if cnt[j]=0 then
    begin
      a[i]:=j;
      break;
    end;
  end;
end;

procedure solve;
begin
  readln(n);res:=0;c:=0;
  for i:=1 to n do
  begin
    read(m);
    for j:=1 to m do
    begin
      read(v);
      c:=c or(1<<(v-1));
    end;
    res:=res xor a[c];
  end;
  if res<>0 then writeln(‘YES‘)
  else writeln(‘NO‘);
end;

begin
  init;
  readln(t);
  while t>0 do
  begin
    dec(t);
    solve;
  end;
end.