题目:
http://acm.hdu.edu.cn/showproblem.php?pid=6214
题意:
给定一个网络,给出源点和汇点,求最小割的最少边数
思路:
对于每个边容量
c
,扩大为
#include <bits/stdc++.h>
using namespace std;
const int N = 200 + 10, INF = 0x3f3f3f3f;
struct edge
{
int to, cap, next;
}g[N*N*2];
int level[N], cur[N], pre[N], gap[N];
int cnt, head[N];
int nv;
void init()
{
cnt = 0;
memset(head, -1, sizeof head);
}
void add_edge(int v, int u, int cap)
{
g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
g[cnt].to = v, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
int sap(int s, int t)
{
memset(level, 0, sizeof level);
memset(gap, 0, sizeof gap);
memcpy(cur, head, sizeof head);
gap[0] = nv;
int v = pre[s] = s, flow = 0, aug = INF;
while(level[s] < nv)
{
bool flag = false;
for(int &i = cur[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > 0 && level[v] == level[u] + 1)
{
flag = true;
pre[u] = v;
v = u;
aug = min(aug, g[i].cap);
if(v == t)
{
flow += aug;
while(v != s)
{
v = pre[v];
g[cur[v]].cap -= aug;
g[cur[v]^1].cap += aug;
}
aug = INF;
}
break;
}
}
if(flag) continue;
int minlevel = nv;
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > 0 && level[u] < minlevel)
minlevel = level[u], cur[v] = i;
}
if(--gap[level[v]] == 0) break;
level[v] = minlevel + 1;
gap[level[v]]++;
v = pre[v];
}
return flow;
}
int main()
{
int t, n, m;
scanf("%d", &t);
while(t--)
{
init();
scanf("%d%d", &n, &m);
int ss, tt;
scanf("%d%d", &ss, &tt);
int a, b, c;
for(int i = 1; i <= m; i++)
{
scanf("%d%d%d", &a, &b, &c);
add_edge(a, b, c*(m+1) + 1);
}
nv = n;
int ans = sap(ss, tt);
printf("%d\n", ans % (m+1));
}
return 0;
}