bzoj3875

悲伤地回忆，当初写了一个作死的算法爆零了
为什么不好好写暴力呢……
显然设w[i]表示彻底干掉这个怪物的代价
注意发现这里的转移具有后效性，但是干掉每个怪物的最优值是一定的
我们用spfa来转移，详见那篇spfa的论文

type node=record
       po,next:longint;
     end;

var e,ee:array[0..1000010] of node;
    p,pp,d:array[0..200010] of longint;
    q:array[0..10000010] of longint;
    w:array[0..200010] of int64;
    v:array[0..200010] of boolean;
    len,t,i,n,s,j,x:longint;

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

procedure addp(x,y:longint);
  begin
    ee[len].po:=y;
    ee[len].next:=pp[x];
    pp[x]:=len;
  end;

procedure spfa;
  var x,y,f,r,i:longint;
      s:int64;
  begin
    f:=1;
    r:=n;
    for i:=1 to n do
    begin
      q[i]:=i;
      v[i]:=true;
    end;
    while f<=r do
    begin
      x:=q[f];
      v[x]:=false;
      i:=pp[x];
      s:=d[x];
      while i<>0 do  //转移
      begin
        s:=s+w[ee[i].po];
        i:=ee[i].next;
        if s>=w[x] then break;
      end;
      if s<w[x] then
      begin
        w[x]:=s;
        i:=p[x];
        while i<>0 do  //能用普通攻击变出这个怪物的怪物的最小代价可能发生变化
        begin
          y:=e[i].po;
          if not v[y] then
          begin
            inc(r);
            q[r]:=y;
            v[y]:=true;
          end;
          i:=e[i].next;
        end;
      end;
      inc(f);
    end;
  end;

begin
  readln(n);
  for i:=1 to n do
  begin
    read(d[i],w[i],s);
    for j:=1 to s do
    begin
      inc(len);
      read(x);
      addp(i,x);
      add(x,i);
    end;
    readln;
  end;
  spfa;
  writeln(w[1]);
end.