bzoj 1565 植物大战僵尸【最大权闭合子图】

最大权闭合子图：
选得一个集合 V,满足 V 内的任意一个点的出边指向的点也在 V 中，且 V 的权值和最大

建图：

$$S \rightarrow x :w[x] \ \ (w[x] > 0) \\ x \rightarrow T : -w[x] \ \ (w[x] < 0) \\ v \rightarrow u : \infty$$

这道题里面若 u 能保护 v ,则连边 $v \rightarrow u$

这里如果成了环，那么整个环上的点，包括环上点所保护的点都不能走到，所以要先进行一次拓扑排序，把不能走到的点删掉。。。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#define INF 1000000000
#define N 605
#define M 736000
using namespace std;

int n,m,siz = 1,S,T,ans;
int d[N],r[N],p[N],w[N],v[N];
int first[N],next[M],to[M],len[M];

void inser(int x,int y,int w)
{
    next[++ siz] = first[x];
    first[x] = siz;
    to[siz] = y;
    len[siz] = w;
}

void add_edge(int x,int y,int w)
{
    inser(x,y,w),inser(y,x,0);r[x] ++;
}

void work()
{
    int head = 0,tail = 0;
    for (int i = 1;i <= T;i ++)
        if (!r[i]) p[++ tail] = i;
    while (head ^ tail)
    {
        int x = p[++ head];v[x] = 1;
        if (w[x] > 0) ans += w[x];
        for (int i = first[x];i;i = next[i])
            if ((i & 1) && !(--r[to[i]])) p[++ tail] = to[i];
    }
}

void init()
{
    scanf("%d%d",&n,&m),S = m*n + 1,T = S + 1;
    for (int i = 1,k,x,y;i <= n*m;i ++)
    {
        scanf("%d",&w[i]);
        if (w[i] > 0) add_edge(S,i,w[i]);
            else add_edge(i,T,-w[i]);
        scanf("%d",&k);
        for (int j = 1;j <= k;j ++)
            scanf("%d%d",&x,&y),add_edge(x*m+y+1,i,INF);
        if (i % m) add_edge(i,i + 1,INF);
    }
}

bool bfs()
{
    int head = 0,tail = 1;
    memset(d,0,sizeof(d));
    d[p[1] = S] = 1;
    while (head ^ tail)
    {
        int x = p[++ head];
        for (int i = first[x];i;i = next[i])
            if (v[to[i]] && !d[to[i]] && len[i]) d[p[++ tail] = to[i]] = d[x] + 1;
    }
    return d[T];
}

int dfs(int x,int flow)
{
    if (x == T) return flow;
    int ret = 0;
    for (int i = first[x];i && flow;i = next[i])
        if (d[to[i]] == d[x] + 1 && len[i])
        {
            int w = dfs(to[i],min(flow,len[i]));
            len[i] -= w,len[i ^ 1] += w;
            flow -= w,ret += w;
        }
    if (!ret) d[x] = 0;
    return ret;
}

int dinic()
{
    int ret = 0;
    while (bfs()) ret += dfs(S,INF);
    return ret;
}

int main()
{
    init();
    work();
    ans -= dinic();
    cout << ans << endl;

    return 0;
}