网络最大流：模板（优化后）

一时兴起在LibreOJ上交了下模板然后被卡常……于是努力克服STL依赖症，改过自新……

---

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
struct Item{int p,c,nxt=-1;} it[9000005];
int dis[1000005],n,m,s,t,ans,tans,t1,t2,t3,ind,bus[1000005],pbus[1000005],cnt;
int qu[1000005];
struct Queue{
    int head=0,tail=-1;
    inline void push(int x){
        qu[++tail]=x;}
    inline void pop(){
        head++;}
    inline int front(){
        return qu[head];}
    inline int size(){
        return tail-head+1;}} q; 

int dinic_bfs(){
    q.push(s);
    memset(dis,0xff,sizeof dis); dis[s]=1;
    while(q.size()) {
        int p=q.front(); q.pop(); 
        for(register int i=bus[p]; i>=0; i=it[i].nxt)
            if(dis[it[i].p]<0 && it[i].c>0)
                q.push(it[i].p), dis[it[i].p]=dis[p]+1;}
    return dis[t]>0;}

int dinic_dfs(int p,int lim){ cnt++;
    int flow=0;
    if(p==t) return lim;
    for(int val,&i=pbus[p]; i>=0; i=it[i].nxt)
        if(dis[it[i].p]==dis[p]+1 && it[i].c>0)
            if(val=dinic_dfs(it[i].p,min(lim,it[i].c))){ 
                it[i].c-=val, it[i^1].c+=val; flow+=val; lim-=val;
                if(lim==0) break;}
    return flow;}

inline void link(int p,int q,int w){
    it[ind].p=q; it[ind].c=w; it[ind].nxt=bus[p]; bus[p]=ind; ind++;}

inline void make(int p,int q,int w){
    link(p,q,w); link(q,p,0);}

void dinic(){
    while(dinic_bfs()) {
        memcpy(pbus,bus,sizeof bus);
        while(tans=dinic_dfs(s,1e+9)) ans+=tans;}}

inline int read(){
    int x=0;
    register char ch=getchar();
    while (ch<'0'||ch>'9') ch=getchar();
    while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x;
}

int main(){
    memset(bus,0xff,sizeof bus);
    n=read(); m=read(); s=read(); t=read();

    for(register int i=1;i<=m;i++) {
        t1=read(), t2=read(), t3=read(), make(t1,t2,t3);}   
    dinic(); 
    printf("%d\n",ans);}