dinic 模板

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5+10;
int n,m,cnt;
int st,ed;
int head[maxn], cur[maxn], dis[maxn];
struct node{
    int to, nxt, flw;
}edge[maxn * 10];
void init(){memset(head,-1,sizeof(head));}
void addedge(int u,int v,int f){
    edge[cnt].to=v, edge[cnt].flw=f, edge[cnt].nxt=head[u], head[u]=cnt++;
    edge[cnt].to=u, edge[cnt].flw=0, edge[cnt].nxt=head[v], head[v]=cnt++;
}
bool bfs(){
    queue<int>que;
    memset(dis,inf,sizeof(dis));
    que.push(st);dis[st]=0;
    while(!que.empty()){
        int u=que.front();
        que.pop();
        for(int i=head[u];i!=-1;i=edge[i].nxt){
            if(!edge[i].flw)continue;
            int v=edge[i].to;
            if(dis[v]==inf){
                dis[v]=dis[u]+1;
                que.push(v);
            }
        }
    }
    return (dis[ed]!=inf);
}
int dfs(int u,int flw){
    int All=0;int tmp;
    if(u==ed)return flw;
    for(int i=head[u];i!=-1;i=edge[i].nxt){
        if(!edge[i].flw) continue;
        int v=edge[i].to;head[u]=i;
        if(dis[v]!=dis[u]+1) continue;
        if((tmp=dfs(v,min(flw,edge[i].flw)))>0){
            flw-=tmp, edge[i].flw -= tmp, edge[i^1].flw += tmp, All += tmp;
            if(!flw)break;
        }
    }
    return All;
}
int dicnic(){
    scanf("%d%d%d%d",&n,&m,&st,&ed);
    int ret=0;
    for(int i=1;i<=m;i++){
        int u,v,w;
        scanf("%d%d%d",&u,&v,&w);
        addedge(u,v,w);
    }
    memcpy(cur,head,sizeof(cur));
    while(bfs()){
        ret += dfs(st,inf);
        memcpy(head,cur,sizeof(head));
    }
    return ret;
}
int main(){
    init();
    printf("%d\n",dicnic());
    return 0;
}