bzoj 1391

 建图跑最小割，加当前弧优化。

  

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#define N 3000
#define inf 0x3f3f3f3f
#define M 4000005
using namespace std;
int n,m;
int tot;
int head[N],nxt[M],ver[M],f[M];
void add(int a,int b,int c)
{
    tot++;nxt[tot]=head[a];head[a]=tot;ver[tot]=b;f[tot]=c;
    tot++;nxt[tot]=head[b];head[b]=tot;ver[tot]=a;f[tot]=0;
}
int S,T;
int ch[N];int cur[N];
int zeng(int a,int b)
{
    if(a==T)return b;
    int r=0;
    for(int i=cur[a];i&&b>r;i=nxt[i])
    {
        if(ch[ver[i]]==ch[a]+1&&f[i])
        {
            int t=zeng(ver[i],min(b-r,f[i]));
            r+=t;f[i]-=t;f[i^1]+=t;
            if(f[i]>0)cur[a]=i;
        }
    }
    if(!r)ch[a]=-1;
    return r;
}
bool tell()
{
    memset(ch,-1,sizeof(ch));
    ch[S]=0;
    queue<int>q;
    q.push(S);
    while(!q.empty())
    {
        int tmp=q.front();q.pop();
        for(int i=head[tmp];i;i=nxt[i])
        {
            if(f[i]&&ch[ver[i]]==-1)
            {
                ch[ver[i]]=ch[tmp]+1;
                q.push(ver[i]);
            }
        }
    }
    return ch[T]!=-1;
}
int dinic()
{
    int r=0,t;
    while(tell())
    {
        for(int i=0;i<=T;i++)cur[i]=head[i];
       while(t=zeng(S,inf))r+=t;    
    }
    return r;
}
int v[N];
int ans;
int main()
{
    tot=1;
    scanf("%d%d",&n,&m);int t1,t2;
    S=0;T=n+m+1;
    for(int i=1;i<=n;i++)
    {
        int tmp;
        scanf("%d%d",&v[i],&tmp);ans+=v[i];
        add(i+m,T,v[i]);
        for(int j=1;j<=tmp;j++)
        {
            scanf("%d%d",&t1,&t2);
            add(t1,i+m,t2);
        }
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d",&t1);
        add(S,i,t1);
    }
    printf("%d\n",ans-dinic());
    return 0;
}