[ICPC-Beijing 2006]狼抓兔子【对偶图优化网络流】

题目链接

---

  这里的点数很大，所以需要用对偶图来进行优化，因为这道题的图是很明显的对偶图，因为不存在三维的线（也就是空间平面上的线，真实不交，但是是在线的上下）。

  所以，我们对这张图旋转90度，然后然后开无向图来进行跑一个最短路，就是相当于原图的网络流的最小割了。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e6 + 7, maxM = 12e6 + 7;
int N, M, n, S, T, id[1005][1005][2], head[maxN], cnt;
struct Eddge
{
    int nex, to; ll val;
    Eddge(int a=0, int b=0, ll c=0):nex(a), to(b), val(c) {}
} edge[maxM];
inline void addEddge(int u, int v, ll w)
{
    edge[cnt] = Eddge(head[u], v, w);
    head[u] = cnt++;
}
void _add(int u, int v, ll w) { addEddge(u, v, w); addEddge(v, u, w); }
struct node
{
    int id; ll val;
    node(int a=0, ll b=0):id(a), val(b) {}
    friend bool operator < (node e1, node e2) { return e1.val > e2.val; }
} now;
priority_queue<node> Q;
ll dis[maxN];
inline ll Dijkstra()
{
    for(int i=1; i<=n; i++) dis[i] = INF;
    dis[S] = 0; Q.push(node(S, 0));
    while(!Q.empty())
    {
        now = Q.top(); Q.pop();
        int u = now.id;
        if(dis[u] < now.val) continue;
        for(int i=head[u], v; ~i; i=edge[i].nex)
        {
            v = edge[i].to;
            if(dis[v] > dis[u] + edge[i].val)
            {
                dis[v] = dis[u] + edge[i].val;
                Q.push(node(v, dis[v]));
            }
        }
    }
    return dis[T];
}
int main()
{
    scanf("%d%d", &N, &M);
    n = 0;
    for(int i=1; i<N; i++)
    {
        for(int j=1; j<M; j++)
        {
            id[i][j][0] = ++n;
            id[i][j][1] = ++n;
        }
    }
    S = ++n; T = ++n;
    for(int i=1; i<=n; i++) head[i] = -1;
    //N行的M-1横
    for(int i=1, w; i<M; i++)
    {
        scanf("%d", &w);
        _add(id[1][i][0], T, w);
    }
    for(int i=2, w; i<N; i++)
    {
        for(int j=1; j<M; j++)
        {
            scanf("%d", &w);
            _add(id[i][j][0], id[i - 1][j][1], w);
        }
    }
    for(int i=1, w; i<M; i++)
    {
        scanf("%d", &w);
        _add(S, id[N - 1][i][1], w);
    }
    //N-1行M横
    for(int i=1, w; i<N; i++)
    {
        scanf("%d", &w);
        _add(S, id[i][1][1], w);
        for(int j=2; j<M; j++)
        {
            scanf("%d", &w);
            _add(id[i][j - 1][0], id[i][j][1], w);
        }
        scanf("%d", &w);
        _add(id[i][M - 1][0], T, w);
    }
    //N-1行M-1列斜
    for(int i=1, w; i<N; i++)
    {
        for(int j=1; j<M; j++)
        {
            scanf("%d", &w);
            _add(id[i][j][1], id[i][j][0], w);
        }
    }
    printf("%lld\n", Dijkstra());
    return 0;
}