UVA 563 - Crimewave

      这道题酝酿了好长时间，也让我头疼了好长时间。这道题要拆点，把一个点拆成一条边，这条边的入点连接出点，出点连接邻接的边的入点，都是双向的。由于拆点后，节点数最大为5000多个，用矩阵超时，所以用邻接表。用邻接表的巧妙之处在于最后处理流的时候，假设e为一条边的序号，e^1就是它的反向边的序号，这样很容易更新流。

      这道题应该有两个难点吧，一是如何拆点构造图，二是如何用邻接表来更新流。

程序代码：

#include<iostream> #include<cstring> #include<cstdio> #include<queue> using namespace std; #define MAXN 5010 #define INF 10000000 int Head[MAXN], a[MAXN], p[MAXN]; int nRow, nColum, n, s, t, e; typedef struct { int u, v, next, c; }Edge; Edge nEdge[MAXN * 10]; int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}; void AddEdge(int u, int v, int c) { nEdge[e].u = u; nEdge[e].v = v; nEdge[e].c = c; nEdge[e].next = Head[u]; Head[u] = e++; nEdge[e].u = v; nEdge[e].v = u; nEdge[e].c = 0; nEdge[e].next = Head[v]; Head[v] = e++; } int Judge(int x, int y) { if(x >= 1 && x <= nRow && y >= 1 && y <= nColum) return 1; return 0; } int Flow() { int k, cMin; queue<int> q; int res = 0; while(true){ memset(a, 0, sizeof(a)); a[s] = 1; q.push(s); cMin = INF; while(!q.empty()){ int u = q.front(); q.pop(); for(int v = Head[u]; v != -1; v = nEdge[v].next){ if(!a[k = nEdge[v].v] && nEdge[v].c){ a[k] = 1; p[k] = v; q.push(k); if(cMin > nEdge[v].c) cMin = nEdge[v].c; } } } if(!a[t]) break; for(int u = t; u != s; u = nEdge[p[u]].u){ nEdge[p[u]].c -= cMin; nEdge[p[u] ^ 1].c += cMin; } res += cMin; } if(res == n) return 1; else return 0; } int main() { int nCase, f, x, y, z, flag, m, cnt; //freopen("input.txt", "r", stdin); scanf("%d", &nCase); while(nCase--) { scanf("%d %d %d", &nRow, &nColum, &n); s = e = 0; cnt = nRow * nColum; t = 2 * cnt + 1; memset(Head, -1, sizeof(Head)); for(int i = 1; i <= n; i++) { scanf("%d %d", &x, &y); AddEdge(s, (x - 1) * nColum + y, 1); } for(int i = 1; i <= nColum; i++){ AddEdge(i + cnt, t, 1); AddEdge(i + cnt + (nRow - 1) * nColum, t, 1); } for(int i = 2; i < nRow; i++){ AddEdge((i - 1) * nColum + 1 + cnt, t, 1); AddEdge(i * nColum + cnt, t, 1); } for(int i = 1; i <= nRow; i++){ for(int j = 1; j <= nColum; j++){ z = (i - 1) * nColum + cnt + j; AddEdge(z - cnt, z, 1); for(int k = 0; k < 4; k++){ x = i + dx[k]; y = j + dy[k]; if(Judge(x, y)) AddEdge(z, (x - 1) * nColum + y, 1); } } } Flow() ? printf("possible/n") : printf("not possible/n"); } return 0; }