一道关于网络流的裸题,使用dinic算法,关于dinic算法可以参考dinic算法详解(我差不多看了好几篇才明白的…太菜了)
之前也不大理解为啥一定要建反边,看了这篇文章才突然明白
建反边的解说
我自己理解的dinic算法:先用bfs()分层,再采用dfs()找到路径
//邻接表解法:
#include<bits/stdc++.h>
using namespace std;
typedef struct {
int to;
int next;
int cap;
}Edge;
const int N = 20;
const int M = 1005*2; //因为要建反边,所以要*2,要不然会内存不够一直wa
const int INF = 1e9;
Edge e[M];
int head[M]; //建邻接表时记录该点第一条边所用
int cur[M]; //优化dfs()
int depth[N]; //分层时记录层数
int n, m;
int s, t; //s:起点,t:终点
int tot; //记录边条数
//建图
void Add_Edge(int u, int v, int w) {
e[++tot].cap += w; //用+=避免重边引起错误
e[tot].to = v;
e[tot].next = head[u];
head[u] = tot;
}
//分层
bool bfs() {
memset(depth, 0, sizeof(depth));
depth[s] = 1;
queue<int>Q;
Q.push(s);
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (int i = head[u]; i != -1; i = e[i].next) {
int v = e[i].to;
if (!depth[v] && e[i].cap > 0) {
depth[v] = depth[u] + 1;
Q.push(v);
}
}
}
return depth[t] == 0 ? 0 : 1; //没有走到终点t说明没有路径到t
}
int dfs(int u, int f) {
if (f == 0)return 0;
if (u == t)return f;
for (int i = cur[u]; i != -1; i = e[i].next) {
int v = e[i].to;
if ((depth[v] == depth[u] + 1) && e[i].cap != 0) {
int di = dfs(v, min(f, e[i].cap));
if (di > 0) {
e[i].cap -= di;
e[i ^ 1].cap += di; //因为从0开始的,同一条路,反边比正边大1
return di;
}
}
}
return 0;
}
int dinic() {
int ans = 0;
while (bfs()) { //走不到t时就结束
for (int i = 0; i <= tot; i++)
cur[i] = head[i];
while (int d = dfs(s, INF)) {
ans += d;
}
}
return ans;
}
int main() {
int T;
scanf("%d", &T);
int ex = 0;
while (T--) {
tot = -1;
memset(head, -1, sizeof(head));
memset(e, 0, sizeof(e));
scanf("%d%d", &n, &m);
s = 1;
t = n;
for (int i = 0; i < m; i++) {
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
Add_Edge(u, v, w);
Add_Edge(v, u, 0);
}
int ans = dinic();
printf("Case %d: %d\n", ++ex, ans);
}
return 0;
}