UVa 563 - Crimewave 最大流

题目链接：UVa 563 - Crimewave

题目大意：给你s * a 的矩阵，每个点只能经过一次，再给你b个人，问能否让这b个人成功走出矩阵。

题目分析：矩阵的每个点拆成两个点 u、u'，建边（u，u'，1），对每个人 i 建边（s，i，1），对每个边缘点 v 建边（v'，t，1），跑一次最大流，如果flow == b 则有解，否则无解。

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define REP(I, X) for(int I = 0; I < X; ++I)
#define FF(I, A, B) for(int I = A; I <= B; ++I)
#define clear(A, B) memset(A, B, sizeof A)
#define copy(A, B) memcpy(A, B, sizeof A)
#define min(A, B) ((A) < (B) ? (A) : (B))
#define max(A, B) ((A) > (B) ? (A) : (B))
using namespace std;
typedef long long ll;
typedef long long LL;
const int oo = 0x3f3f3f3f;
const int maxE = 200000;
const int maxN = 5005;
const int maxQ = 10000;
struct Edge{
    int v, c, n;
};
Edge edge[maxE];
int adj[maxN], cntE;
int Q[maxE], head, tail, inq[maxN];
int d[maxN], num[maxN], cur[maxN], pre[maxN];
int s, t, nv;
int n, m, nm;
int path[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
void addedge(int u, int v, int c){
    edge[cntE].v = v; edge[cntE].c = c; edge[cntE].n = adj[u]; adj[u] = cntE++;
    edge[cntE].v = u; edge[cntE].c = 0; edge[cntE].n = adj[v]; adj[v] = cntE++;
}
void REV_BFS(){
    clear(d, -1);
    clear(num, 0);
    head = tail = 0;
    d[t] = 0;
    num[0] = 1;
    Q[tail++] = t;
    while(head != tail){
        int u = Q[head++];
        for(int i = adj[u]; ~i; i = edge[i].n){
            int v = edge[i].v;
            if(~d[v]) continue;
            d[v] = d[u] + 1;
            num[d[v]]++;
            Q[tail++] = v;
        }
    }
}
int ISAP(){
    copy(cur, adj);
    REV_BFS();
    int flow = 0, u = pre[s] = s, i;
    while(d[s] < nv){
        if(u == t){
            int f = oo, neck;
            for(i = s; i != t; i = edge[cur[i]].v){
                if(f > edge[cur[i]].c){
                    f = edge[cur[i]].c;
                    neck = i;
                }
            }
            for(i = s; i != t; i = edge[cur[i]].v){
                edge[cur[i]].c -= f;
                edge[cur[i] ^ 1].c += f;
            }
            flow += f;
            u = neck;
        }
        for(i = cur[u]; ~i; i = edge[i].n) if(edge[i].c && d[u] == d[edge[i].v] + 1) break;
        if(~i){
            cur[u] = i;
            pre[edge[i].v] = u;
            u = edge[i].v;
        }
        else{
            if(0 == (--num[d[u]])) break;
            int mind = nv;
            for(i = adj[u]; ~i; i = edge[i].n){
                if(edge[i].c && mind > d[edge[i].v]){
                    mind = d[edge[i].v];
                    cur[u] = i;
                }
            }
            d[u] = mind + 1;
            num[d[u]]++;
            u = pre[u];
        }
    }
    return flow;
}
void work(){
    int x, y, b;
    clear(adj, -1);
    cntE = 0;
    scanf("%d%d%d", &n, &m, &b);
    nm = n * m;
    s = nm * 2; t = s + 1; nv = t + 1;
    REP(x, n) REP(y, m){
        int xy = x * m + y;
        addedge(xy, xy + nm, 1);
        if(x == 0 || y == 0 || x == n - 1|| y == m - 1) addedge(nm + xy, t, 1);
        else REP(k, 4){
            int nx = x + path[k][0];
            int ny = y + path[k][1];
            addedge(xy + nm, nx * m + ny, 1);
        }
    }
    REP(i, b){
        scanf("%d%d", &x, &y);
        --x; --y;
        addedge(s, x * m + y, 1);
    }
    printf(b == ISAP() ? "possible\n" : "not possible\n");
}
int main(){
    int T;
    for(scanf("%d", &T); T; --T) work();
    return 0;
}