hud-2732 最大流 拆点 dinic

题意：给你一个网格,网格上的一些位置上有一只蜥蜴,所有蜥蜴的最大跳跃距离是d,如果一只蜥蜴能跳出网格边缘,那么它就安全了.且每个网格有一个最大跳出次数x,即最多有x只蜥蜴从这个网格跳出,这个网格就再也不能有蜥蜴进来了.问你最少有多少只蜥蜴跳不出网格.

建图：每个点分成i，i + m * n

        i有蜥蜴(sp, i, 1)

        i能跳出x次(i, i +m * n, x)

        i能跳出网格(i + m * n, tp, inf)

        i不能跳出网格能跳到j(i到j的曼哈顿距离<= d)(i + m * n, j, inf)

链接：hdu 2732

 

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define INF 0x3f3f3f3f
//#define ll long long
#define MAXN 5005

using namespace std;

const int inf = 0x3f3f3f3f;
const int maxn = 500005;

int n, m;//点数、边数
int sp, tp;//原点、汇点
struct node  {
    int v, next;
    int cap;
}mp[maxn];

int pre[MAXN], dis[MAXN], cur[MAXN];//cur为当前弧优化，dis存储分层图中每个点的层数（即到原点的最短距离），pre建邻接表
int cnt = 0;

void init() {  //不要忘记初始化
    cnt = 0;
    memset(pre, -1, sizeof(pre));
}

void add(int u, int v, int w) { //加边
    mp[cnt].v = v;
    mp[cnt].cap = w;
    mp[cnt].next = pre[u];
    pre[u] = cnt++;
    mp[cnt].v = u;
    mp[cnt].cap = 0;
    mp[cnt].next = pre[v];
    pre[v] = cnt++;
}

bool bfs() {  //建分层图
    memset(dis, -1, sizeof(dis));
    queue<int>q;
    while(!q.empty())
        q.pop();
    q.push(sp);
    dis[sp] = 0;
    int u, v;
    while(!q.empty()) {
        u = q.front();
        q.pop();
        for(int i = pre[u]; i != -1; i = mp[i].next) {
            v = mp[i].v;
            if(dis[v] == -1 && mp[i].cap>0) {
                dis[v] = dis[u] + 1;
                q.push(v);
                if(v == tp)
                    break;
            }
        }
    }
    return dis[tp] != -1;
}

int dfs(int u,int cap) {//寻找增广路
    if(u == tp || cap == 0)
    return cap;
    int res = 0, f;
    for(int &i = cur[u]; i != -1; i = mp[i].next) {//
        int v = mp[i].v;
        if(dis[v] == dis[u] + 1 && (f = dfs(v, min(cap - res, mp[i].cap))) > 0) {
            mp[i].cap -= f;
            mp[i ^ 1].cap += f;
            res += f;
            if(res == cap)
                return cap;
        }
    }
    if(!res)
        dis[u] = -1;
    return res;
}

int dinic() {
    int ans = 0;
    while(bfs()) {
        for(int i = sp; i <= tp; i++)
            cur[i] = pre[i];
        ans += dfs(sp, inf);
    }
    return ans;
}

char gn[30][30];
char gp[30][30];

int main()
{
    int t, kcase = 0;
    cin >> t;
    while(t--) {
        init();
        int d;
        m = 0;
        scanf("%d %d", &n, &d);
        for(int i = 0; i < n; i++) {
            scanf("%s", gn[i]);
        }
        m = strlen(gn[0]);
        for(int i = 0; i < n; i++) {
            scanf("%s", gp[i]);
        }
        sp = 0, tp = n * m * 2 + 1;
        int sum = 0;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                int id = i * m + j + 1;
                if(gn[i][j] - '0' > 0) {
                    add(id, id + n * m, gn[i][j] - '0');
                    if(i < d || j < d || n - i <= d || m - j <= d) { //能跳出
                        add(id + n * m, tp, inf);
                    }
                    else { // 不能跳出
                        for(int k = 0; k < n; k++) {
                            for(int h = 0; h < m; h++) {
                                if(id == k * m + h + 1) {
                                    continue;
                                }
                                if(abs(i - k) + abs(j - h) <= d) {
                                    add(id + n * m, k * m + h + 1, inf);
                                }
                            }
                        }
                    }
                }
                if(gp[i][j] == 'L') {
                    sum++;
                    add(sp, id, 1);
                }
            }
        }
        int ans = sum - dinic();
        printf("Case #%d: ", ++kcase);
        if(!ans) {
            puts("no lizard was left behind.");
        }
        else if (ans == 1) {
            puts("1 lizard was left behind.");
        }
        else {
            printf("%d lizards were left behind.\n", ans);
        }
    }
    return 0;
}