[有源汇最大流]模板 LOJ 116

首先考虑有源汇可行流，加一条T->S，流量为INF的边，就变成无源汇可行流的做法了，再建个超级源汇SS和TT做无源汇可行流就好。

跑完可行流之后，再做S->T的最大流 就是答案。

暂时不太知道原理，之后再看看。

c++11 52ms 内存764k 长度1.8k

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF (1e18)
#define maxn 210
#define maxm 30005
ll n,m,S,T,s,t,cnt;
int head[maxn];
struct node{
    ll to,ne,w;
}e[maxm];
void add(ll u,ll v,ll w){
    e[cnt]=(node){v,head[u],w};head[u]=cnt++;
    e[cnt]=(node){u,head[v],0};head[v]=cnt++;
}
ll d[maxn];
queue<ll>q;
int cur[maxn];
ll bfs(){
    memset(d,0,sizeof(d));
    memcpy(cur,head,sizeof(head));
    while(!q.empty()) q.pop();
    q.push(S);
    d[S]=1;
    while(!q.empty()){
        ll u=q.front();q.pop();
        if(u==T) break;
        for(ll i=head[u];~i;i=e[i].ne){
            ll v=e[i].to;
            if(e[i].w&&!d[v]) d[v]=d[u]+1,q.push(v);
        }
    }
    return d[T];
}
ll dfs(ll u,ll remain){
    if(u==T) return remain;
    ll use=0;
    for(ll i=cur[u];~i;i=e[i].ne){
        cur[u]=i;
        ll v=e[i].to;
        if(e[i].w&&d[v]==d[u]+1){
            ll flow=dfs(v,min(remain-use,e[i].w));
            if(!flow) continue;
            use+=flow;e[i].w-=flow;e[i^1].w+=flow;
            if(use==remain) break;
        }
    }
    if(!use) d[u]=0;
    return use;
}

ll dinic(){
    ll ans=0,tmp;
    while(bfs()) while(tmp=dfs(S,INF))ans+=tmp;
    return ans;
}
ll l[maxm],du[maxn],sum;
int main(){
    scanf("%d%d%d%d",&n,&m,&s,&t);
    S=n+1;T=S+1;
    memset(head,-1,sizeof(head));
    for(ll i=1;i<=m;i++){
        ll u,v,r;
        scanf("%lld%lld%lld%lld",&u,&v,&l[i],&r);
        du[u]-=l[i];du[v]+=l[i];
        add(u,v,r-l[i]);
    }
    for(ll i=1;i<=n;i++){
        if(du[i]>0) add(S,i,du[i]),sum+=du[i];
        else if(du[i]<0) add(i,T,-du[i]);
    }
    add(t,s,INF);
    if(dinic()!=sum) printf("please go home to sleep\n");
    else{
        S=s;T=t;
        printf("%lld\n",dinic());
    }
    return 0;
}