bzoj1565

很明显是最大权闭合子图，但要注意
互相保护的植物打不掉，被互相保护的植物所直接或间接保护的植物也打不掉
我们先拓扑排序然后dfs出能打掉的点，然后做最大权闭合子图

const inf=1000000007;
type node=record
       po,flow,next:longint;
     end;

var e,w:array[0..800010] of node;
    num:array[0..21,0..32] of longint;
    cur,pre,p,st,q,numh,s,h,d:array[0..700] of longint;
    can,v:array[0..700] of boolean;
    n,m,i,j,x,y,len,k,t,f:longint;

function min(a,b:longint):longint;
  begin
    if a>b then exit(b) else exit(a);
  end;

procedure add(x,y:longint);
  begin
    inc(len);
    w[len].po:=y;
    inc(d[y]);
    w[len].next:=q[x];
    q[x]:=len;
  end;

procedure ins(x,y,f:longint);
  begin
    inc(len);
    e[len].po:=y;
    e[len].flow:=f;
    e[len].next:=p[x];
    p[x]:=len;
  end;

procedure build(x,y,f:longint);
  begin
    ins(x,y,f);
    ins(y,x,0);
  end;

procedure dfs(x:longint);
  var i,y:longint;
  begin
    v[x]:=true;
    can[x]:=false;
    i:=q[x];
    while i<>0 do
    begin
      y:=w[i].po;
      if not v[y] then dfs(y);
      i:=w[i].next;
    end;
  end;

function sap:longint;
  var i,j,u,tmp,neck,q:longint;
  begin
    u:=0;
    sap:=0;
    for i:=0 to t do
      cur[i]:=p[i];
    numh[0]:=t+1;
    neck:=inf;
    while h[0]<t+1 do
    begin
      i:=cur[u];
      d[u]:=neck;
      while i<>-1 do
      begin
        j:=e[i].po;
        if (e[i].flow>0) and (h[u]=h[j]+1) then
        begin
          neck:=min(neck,e[i].flow);
          cur[u]:=i;
          pre[j]:=u;
          u:=j;
          if u=t then
          begin
            sap:=sap+neck;
            while u<>0 do
            begin
              u:=pre[u];
              j:=cur[u];
              dec(e[j].flow,neck);
              inc(e[j xor 1].flow,neck);
            end;
            neck:=inf;
          end;
          break;
        end;
        i:=e[i].next;
      end;
      if i=-1 then
      begin
        dec(numh[h[u]]);
        if numh[h[u]]=0 then exit;
        q:=-1;
        tmp:=t;
        i:=p[u];
        while i<>-1 do
        begin
          j:=e[i].po;
          if e[i].flow>0 then
            if h[j]<tmp then
            begin
              q:=i;
              tmp:=h[j];
            end;
          i:=e[i].next;
        end;
        h[u]:=tmp+1;
        inc(numh[h[u]]);
        cur[u]:=q;
        if u<>0 then
        begin
          u:=pre[u];
          neck:=d[u];
        end;
      end;
    end;
  end;

begin
  readln(n,m);
  for i:=0 to n-1 do
    for j:=0 to m-1 do
    begin
      inc(k);
      num[i,j]:=k;
    end;

  for i:=1 to n*m do
  begin
    read(s[i],k);
    for j:=1 to k do
    begin
      read(x,y);
      add(i,num[x,y]);
    end;
  end;
  for i:=0 to n do
    for j:=m-1 downto 1 do
      add(num[i,j],num[i,j-1]);

  f:=1; t:=0;
  for i:=1 to n*m do
    if d[i]=0 then
    begin
      inc(t);
      st[t]:=i;
    end;

  while f<=t do
  begin
    x:=st[f];
    can[x]:=true;
    i:=q[x];
    while i<>0 do
    begin
      y:=w[i].po;
      dec(d[y]);
      if d[y]=0 then
      begin
        inc(t);
        st[t]:=y;
      end;
      i:=w[i].next;
    end;
    inc(f);
  end;
  for i:=1 to n*m do
    if not can[i] then
    begin
      fillchar(v,sizeof(v),false);
      dfs(i);
    end;
  t:=n*m+1; k:=0; len:=-1;
  fillchar(p,sizeof(p),255);
  for i:=1 to n*m do
    if can[i] then
    begin
      if s[i]>0 then
      begin
        build(0,i,s[i]);
        k:=k+s[i];
      end
      else build(i,t,-s[i]);
      j:=q[i];
      while j<>0 do
      begin
        y:=w[j].po;
        if can[y] then build(y,i,inf);
        j:=w[j].next;
      end;
    end;
  writeln(k-sap);
end.