最大流dinic板子

题目： https://www.luogu.com.cn/problem/P3376

#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e5+;
const int INF=0x7fffffff;
typedef long long ll;
int n,m,s,t;
int head[MAXN<<],tot;
struct node
{
    int to,nxt,flow;
}e[MAXN<<];
void add(int x,int y,int z)
{
    e[tot].to=y;e[tot].nxt=head[x];e[tot].flow=z;head[x]=tot++;
}
void add_edge(int x,int y,int z)
{
    add(x,y,z);add(y,x,);
}
ll deep[MAXN],tail,be,q[MAXN];
bool bfs()
{
    memset(deep,,sizeof(deep));
    deep[s]=;
    ll be=,tail=;
    q[]=s;
    while(be!=tail)
    {
        ll u=q[++be];
        for(int i=head[u];~i;i=e[i].nxt)
        {
            if(!deep[e[i].to]&&e[i].flow)
            {
                deep[e[i].to]=deep[u]+;
                q[++tail]=e[i].to;
            }
        }
    }
    return deep[t];
}
int dfs(int now,int fa1)
{
    if(now==t)return fa1;
    int fa=;
    for(int i=head[now];~i&&fa1;i=e[i].nxt)
    {
        if(deep[e[i].to]==deep[now]+&&e[i].flow)
        {
            int d=dfs(e[i].to,min(fa1,e[i].flow));
            if(d>)
            {
                e[i].flow-=d;
                e[i^].flow+=d;
                fa1-=d;
                fa+=d;
            }
        }
    }
    if(!fa)deep[now]=-;
    return fa;
}
ll dinic()
{
    ll res=;
    while(bfs())
    {
        res+=dfs(s,INF);
    }
    return res;
}
int main()
{
    memset(head,-,sizeof(head));
    scanf("%d%d%d%d",&n,&m,&s,&t);
    for(int i=;i<=m;i++)
    {
        int x,y,z;scanf("%d%d%d",&x,&y,&z);
        add_edge(x,y,z);
    }
    int ans=dinic();
    printf("%d\n",ans);
    return ;
}