BZOJ 3875 Ahoi2014 骑士游戏

#include    <iostream>
#include    <cstdio>
#include    <cstdlib>
#include    <algorithm>
#include    <vector>
#include    <cstring>
#include    <queue>
#include    <complex>
#include    <stack>
#define LL long long int
#define dob double
using namespace std;
 
const int N = 200010;
const int M = 1000010;
struct Node{int to,next;}E[M];
int head[N],tot,n,In[N],R[N];
LL S[N],f[N],K[N];
vector<int>G[N];
 
int gi()
{
  int x=0,res=1;char ch=getchar();
  while(ch>‘9‘||ch<‘0‘){if(ch==‘-‘)res*=-1;ch=getchar();}
  while(ch<=‘9‘&&ch>=‘0‘)x=x*10+ch-48,ch=getchar();
  return x*res;
}
 
LL gL()
{
  LL x=0,res=1;char ch=getchar();
  while(ch>‘9‘||ch<‘0‘){if(ch==‘-‘)res*=-1;ch=getchar();}
  while(ch<=‘9‘&&ch>=‘0‘)x=x*10+ch-48,ch=getchar();
  return x*res;
}
 
inline void link(int u,int v){
  E[++tot]=(Node){v,head[u]};
  head[u]=tot;
}
 
inline void SPFA()
{
  queue<int>Q;for(int i=1;i<=n;++i)Q.push(In[i]=i);
  while(!Q.empty()){
    int x=Q.front();Q.pop();In[x]=0;LL sum=S[x];
    for(int i=0;i<R[x];++i)sum+=f[G[x][i]];
    if(sum>=f[x])continue;f[x]=sum;
    for(int e=head[x];e;e=E[e].next)
      if(!In[E[e].to])Q.push(E[e].to),In[E[e].to]=1;
  }
}
 
int main()
{
  n=gi();
  for(int i=1;i<=n;++i){
    S[i]=gL();K[i]=gL();R[i]=gi();
    for(int j=1;j<=R[i];++j){
      int r=gi();
      link(r,i);G[i].push_back(r);
    }
    f[i]=K[i];
  }
  SPFA();
  printf("%lld\n",f[1]);
  return 0;
}