BZOJ 1001 狼抓兔子
Reference:成都电子科技大学——网络流教学讲堂(一个非常好的教学视频)
一道非常裸的网络流问题,但是需要一定的优化。
这个题的正解应该是SPFA+对偶图,但网络流也Ok。
- 当前弧优化(注释了,没用到,比较弱的优化)
- 多路增广(相比于朴素Dinic而言,是一个非常强的优化)
- 炸点(将无法增广的点,深度标记为不存在,比较强的优化)
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<string>
#include<map>
#include<queue>
#include<vector>
using namespace std;
#define ll long long int
#define LL ll
#define INF 0x3f3f3f3f
const int maxn = 3010 * 1010;
const int maxe = 3010 * 3010;
struct edge {
int to, nx, w;
}e[maxe];
int sz;
int head[maxn];
int dep[maxn], flow[maxn];
int ans, n, m, S, T;
void init() {
sz = 0;
memset(head, -1, sizeof head);
}
void add(int u, int v, int w) {
e[sz].to = v;
e[sz].nx = head[u];
e[sz].w = w;
head[u] = sz++; // sz ^ 1 = sz + 1(so sz must be an even number) sz ^ 1 is sz's reverse edge.
}
bool bfs() {
memset(dep, 0, sizeof dep);
dep[S] = 1; // S = 0
queue<int> Q;
Q.push(S); // S = 0
while (!Q.empty()) {
int nw = Q.front();
Q.pop();
for (int i = head[nw]; i != -1; i = e[i].nx) {
int v = e[i].to;
if (!dep[v] && e[i].w) { // exist room & haven't been visited
dep[v] = dep[nw] + 1;
Q.push(v);
}
}
}
return dep[T];// if dep[T] == 0, means no roads to T now;
}
int dfs(int nw, int flow) {
if (flow == 0 || nw == T) return flow;
int res = 0;
for (int i = head[nw]; i != -1; i = e[i].nx) {
//head[nw] = i;当前弧优化(比较弱的优化)
int v = e[i].to;
if (e[i].w&&dep[v] == dep[nw] + 1) { // find the road
int cur = dfs(v, min(flow, e[i].w));
flow -= cur; res += cur;
e[i].w -= cur; e[i ^ 1].w += cur;
}
}
if (!res) dep[nw] = 0; // the cutting of boom the node
return res;
}
int dinic() {
int res = 0;
while (bfs()) {
res += dfs(S, INF);
}
return res;
}
int main()
{
init();
scanf("%d %d", &n, &m);
S = 0, T = n * m + 1;
add(S, 1, INF);
add(1, S, INF);
for (int i = 0; i < n; i++) {
for (int j = 1; j <= m - 1; j++) {
int u = i * m + j;
int v = u + 1;
int w;
scanf("%d", &w);
add(u, v, w);
add(v, u, w);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= m; j++) {
int u = i * m + j;
int v = u + m;
int w;
scanf("%d", &w);
add(u, v, w);
add(v, u, w);
}
}
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j <= m - 1; j++) {
int u = i * m + j;
int v = u + m + 1;
int w;
scanf("%d", &w);
add(u, v, w);
add(v, u, w);
}
}
add(n*m, T, INF);
add(T, n*m, INF);
ans = dinic();
printf("%d\n", ans);
return 0;
}
//_CRT_SECURE_NO_WARNINGS