题意:一个城镇由r×c的矩阵组成,然后给了n个银行,然后n个人要去抢银行,每个人都要选择与其他人不相同的路走到矩阵外,问是否能实现。
题解:多源点多汇点的题需要建立超级源点和超级汇点,矩阵上每个点都只能走一次,所以相当于每个点也有容量,容量为1,每个边当然容量也为1,所以要把每个点也拆成两个点,两个点之间有一条边。另外如果用邻接矩阵做会超时,所以要用邻接表。
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
const int N = 5005;
const int INF = 0x3f3f3f3f;
int t, row, col, n, m, head[N];
const int flagx[4] = {1, -1, 0, 0};
const int flagy[4] = {0, 0, -1, 1};
struct Edge {
int u, v;
int cap, flow, next;
}e[N * 10];
int a[N], p[N];
int ek(int st, int en) {
queue<int> q;
int f = 0;
while (1) {
memset(a, 0, sizeof(a));
memset(p, -1, sizeof(p));
a[st] = INF;
q.push(st);
while (!q.empty()) {
int u = q.front();
q.pop();
for (int i = head[u]; i != -1; i = e[i].next) {
if (!a[e[i].v] && e[i].cap > e[i].flow) {
p[e[i].v] = i;
a[e[i].v] = a[u] < e[i].cap - e[i].flow ? a[u] : e[i].cap - e[i].flow;
q.push(e[i].v);
}
}
}
if (a[en] == 0)
break;
for (int i = p[en]; i != -1; i = p[e[i].u]) {
e[i].flow += a[en];
e[i ^ 1].flow -= a[en];
}
f += a[en];
}
return f;
}
void addedge(int u, int v) {
e[m].u = u;
e[m].v = v;
e[m].cap = 1;
e[m].flow = 0;
e[m].next = head[u];
head[u] = m++;
e[m].u = v;
e[m].v = u;
e[m].cap = 0;
e[m].flow = 0;
e[m].next = head[v];
head[v] = m++;
}
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d%d%d", &row, &col, &n);
memset(head, -1, sizeof(head));
m = 0;
int sum = row * col;
for (int i = 1; i <= row; i++) {
for (int j = 1; j <= col; j++) {
int u = (i - 1) * col + j;
int v = u + sum;
addedge(u, v);
for (int k = 0; k < 4; k++) {
int dx = i + flagx[k];
int dy = j + flagy[k];
if (dx >= 1 && dx <= row && dy >= 1 && dy <= col) {
int h = (dx - 1) * col + dy;
addedge(v, h);
}
else
addedge(v, sum * 2 + 1);
}
}
}
int x, y;
for (int i = 0; i < n; i++) {
scanf("%d%d", &x, &y);
addedge(0, (x - 1) * col + y);
}
int res = ek(0, sum * 2 + 1);
if (res == n)
printf("possible\n");
else
printf("not possible\n");
}
return 0;
}