HDU4280-Dinic+当前弧+多路增广

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define first fi
#define second se
#define mk(a, b) make_pair(a,b)
const int MAXN = 100005;
int T;
int n , m , ed , st, cnt, head[MAXN], cur[MAXN], level[MAXN];
//ed代表汇点,st代表出发点
//cur数组用于当前弧优化,表示再次到达这个顶点，应该走哪条边
struct e
{
    int next;
    int to;
    int c;
}edge[MAXN*4];
void add(int f, int t, int c)
{
    edge[cnt].to =  t;
    edge[cnt].c = c;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
bool DinicBfs(int s, int e) //利用广搜给网络图分层
{
    mem(level,0);
    queue<int>q;
    q.push(s);
    level[s] = 1;
    while(!q.empty())
    {
        int root = q.front();
        q.pop();
        for(int i = head[root] ; i != -1 ; i = edge[i].next)
        {
            int v = edge[i].to, c = edge[i].c;
            if(!level[v] && c > 0)
            {
                level[v] = level[root] + 1;
                q.push(v);
            }
        }
    }
    return level[e] != 0; //如果当前网络能到达汇点说明存在增广路
}
int DinicDfs(int root , int flow) //利用DFS在已经分好层的网络中寻找增广路
{
    if(root == ed)
        return flow;
    int newflow , cost = 0;
    for(int& i = cur[root] ; i != -1 ; i = edge[i].next) //当前弧优化，&i代表i改动cur也会改动
    {
        int v = edge[i].to, c = edge[i].c;
        if(level[v] == level[root] + 1 && c > 0 && (newflow = DinicDfs(v,min(c,flow-cost))))//多路增广flow-cost
        {
            cost += newflow;
            edge[i].c -= newflow;
            edge[i^1].c += newflow;
            if(cost == flow) break;
        }
    }
    return cost; //返回当前分层网络中能够寻找到的最大流
}
int Dinic()
{
    int ans = 0;
    while(DinicBfs(st,ed))
    {
        for(int i = 1 ; i <= n ; i ++) //初始化当前弧
            cur[i] = head[i];
        while(int add = DinicDfs(st,INF))
            ans += add;
    }
    return ans;
}
int main(void)
{
    scanf("%d",&T);
    while(T --)
    {
        mem(head,-1);
        int x, y, minn = INF, maxn = -INF;
        cnt = 0;
        scanf("%d %d",&n ,&m);
        for(int i = 1 ; i <= n ; i ++)
        {
            scanf("%d %d",&x , &y);
            if(x < minn) {minn = x , st = i;}
            if(x > maxn) {maxn = x , ed = i;}
        }
        for(int i = 1 ; i <= m ; i ++)
        {
            int u, v , c;
            scanf("%d %d %d",&u,&v,&c);
            add(u,v,c);
            add(v,u,c);
        }
        int ans = Dinic();
        printf("%d\n",ans);
    }
}