上下界网络流（3合1）

我打的是LOJ的板子，因为比较全

无源汇上下界可行流

具体做法就是将每一条限制为[L,R]的边(u,v)拆开
连接(s,v)容量为L，(u,t)容量为L，(u,v)容量为R-L
大家可以感性地理解一下
数据范围大的时候，可以先记录每个点与起点终点的流量，最后减一减，一起连边就好了
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
using namespace std;
inline int read(){
    int x=0;char ch=' ';int f=1;
    while(ch!='-'&&(ch<'0'||ch>'9'))ch=getchar();
    if(ch=='-')f=-1,ch=getchar();
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return x*f;
}
const int N=205,M=1e5+5,inf=0x3f3f3f3f;
int n,m,s,t,tot=-1,sum;
int head[N],to[M],Next[M],flow[M],cur[N],ans[M];
int d[N],q[N],check1[M],check2[M],down[M],up[M],id[M];
inline void addedge(int x,int y,int l){
    to[++tot]=y;Next[tot]=head[x];head[x]=tot;flow[tot]=l;
    to[++tot]=x;Next[tot]=head[y];head[y]=tot;flow[tot]=0;
}
inline void ins(int x,int y,int lower,int upper){
    addedge(x,y,upper-lower);down[++sum]=lower;up[sum]=upper;id[sum]=tot-1;
    addedge(s,y,lower);check1[sum]=tot-1;
    addedge(x,t,lower);check2[sum]=tot-1;
}
inline bool bfs(){
    for(int i=s;i<=t;++i)d[i]=inf;
    int l=1,r=1;q[l]=s;d[s]=0;
    while(l<=r){
        int x=q[l++];
        for(int i=head[x];~i;i=Next[i]){
            int u=to[i];
            if(flow[i]&&d[u]>d[x]+1){
                d[u]=d[x]+1;
                q[++r]=u;
            }
        }
    }
    return d[t]^inf;
}
inline int dfs(int x,int a){
    if(x==t||!a)return a;
    int F=0,f;
    for(int &i=cur[x];~i;i=Next[i]){
        int u=to[i];
        if(flow[i]&&d[u]==d[x]+1&&(f=dfs(u,min(a,flow[i])))>0){
            flow[i]-=f;
            flow[i^1]+=f;
            F+=f;
            a-=f;
            if(!a)return F;
        }
    }
    return F;
}
inline void dinic(){
    while(bfs()){
        for(int i=s;i<=t;++i)cur[i]=head[i];
        dfs(s,inf);
    }
}
int main(){
    memset(head,-1,sizeof(head));
    n=read();m=read();s=0;t=n+1;
    for(int i=1;i<=m;++i){
        int x=read(),y=read(),lower=read(),upper=read();
        ins(x,y,lower,upper);
    }
    dinic();
    bool flag=1;
    for(int i=1;i<=sum;++i){
        if(!flow[check1[i]]&&!flow[check2[i]])ans[i]=up[i]-flow[id[i]];
        else{flag=0;break;}
    }
    if(flag){
        printf("YES\n");
        for(int i=1;i<=sum;++i)printf("%d\n",ans[i]);
    }
    else printf("NO");
    return 0;
}

有源汇上下界最大流

建立超源超汇SS,TT
然后连一条(t,s)容量inf
像之前那样跑就好了，可以判无解
然后有解的话，跑s-t最大流就好了
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
using namespace std;
inline int read(){
    int x=0;char ch=' ';int f=1;
    while(ch!='-'&&(ch<'0'||ch>'9'))ch=getchar();
    if(ch=='-')f=-1,ch=getchar();
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return x*f;
}
const int N=205,M=1e5+5,inf=0x3f3f3f3f;
int n,m,s,t,tot=-1,sum,ss,tt;
int head[N],to[M],Next[M],flow[M],cur[N],ans[M];
int d[N],q[N],check1[M],check2[M],down[M],up[M],id[M];
inline void addedge(int x,int y,int l){
    to[++tot]=y;Next[tot]=head[x];head[x]=tot;flow[tot]=l;
    to[++tot]=x;Next[tot]=head[y];head[y]=tot;flow[tot]=0;
}
inline void ins(int x,int y,int lower,int upper){
    addedge(x,y,upper-lower);down[++sum]=lower;up[sum]=upper;id[sum]=tot-1;
    addedge(ss,y,lower);check1[sum]=tot-1;
    addedge(x,tt,lower);check2[sum]=tot-1;
}
inline bool bfs(){
    for(int i=0;i<=n+1;++i)d[i]=inf;
    int l=1,r=1;q[l]=ss;d[ss]=0;
    while(l<=r){
        int x=q[l++];
        for(int i=head[x];~i;i=Next[i]){
            int u=to[i];
            if(flow[i]&&d[u]>d[x]+1){
                d[u]=d[x]+1;
                q[++r]=u;
            }
        }
    }
    return d[tt]^inf;
}
inline int dfs(int x,int a){
    if(x==tt||!a)return a;
    int F=0,f;
    for(int &i=cur[x];~i;i=Next[i]){
        int u=to[i];
        if(flow[i]&&d[u]==d[x]+1&&(f=dfs(u,min(a,flow[i])))>0){
            flow[i]-=f;
            flow[i^1]+=f;
            F+=f;
            a-=f;
            if(!a)return F;
        }
    }
    return F;
}
inline void dinic(){
    while(bfs()){
        for(int i=0;i<=n+1;++i)cur[i]=head[i];
        dfs(ss,inf);
    }
}
inline int dinic2(){
    ss=s;tt=t;int F=0;
    while(bfs()){
        for(int i=1;i<=n;++i)cur[i]=head[i];
        F+=dfs(s,inf);
    }
    return F;
}
int main(){
    memset(head,-1,sizeof(head));
    n=read();m=read();s=read();t=read();ss=0;tt=n+1;
    for(int i=1;i<=m;++i){
        int x=read(),y=read(),lower=read(),upper=read();
        ins(x,y,lower,upper);
    }
    addedge(t,s,inf);
    dinic();
    bool flag=1;
    for(int i=1;i<=sum;++i){
        if(flow[check1[i]]||flow[check2[i]]){flag=0;break;}
    }
    if(!flag){puts("please go home to sleep");return 0;}
    int ans=dinic2();
    printf("%d",ans);
    return 0;
}

有源汇上下界最小流

建立SS,TT，然后先跑ss-tt最大流
再连(t,s)容量inf，跑s-t最大流就好了
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
using namespace std;
inline int read(){
    int x=0;char ch=' ';int f=1;
    while(ch!='-'&&(ch<'0'||ch>'9'))ch=getchar();
    if(ch=='-')f=-1,ch=getchar();
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return x*f;
}
const int N=5e4+5,M=8e5+5,inf=0x3f3f3f3f;
int n,m,s,t,tot=-1,sum,ss,tt;
int head[N],to[M],Next[M],flow[M],cur[N],ans[M];
int d[N],q[N],check1[M],check2[M],down[M],up[M],id[M];
inline void addedge(int x,int y,int l){
    to[++tot]=y;Next[tot]=head[x];head[x]=tot;flow[tot]=l;
    to[++tot]=x;Next[tot]=head[y];head[y]=tot;flow[tot]=0;
}
inline void ins(int x,int y,int lower,int upper){
    addedge(x,y,upper-lower);down[++sum]=lower;up[sum]=upper;id[sum]=tot-1;
    addedge(ss,y,lower);check1[sum]=tot-1;
    addedge(x,tt,lower);check2[sum]=tot-1;
}
inline bool bfs(){
    for(int i=0;i<=n+1;++i)d[i]=inf;
    int l=1,r=1;q[l]=ss;d[ss]=0;
    while(l<=r){
        int x=q[l++];
        for(int i=head[x];~i;i=Next[i]){
            int u=to[i];
            if(flow[i]&&d[u]>d[x]+1){
                d[u]=d[x]+1;
                q[++r]=u;
            }
        }
    }
    return d[tt]^inf;
}
inline int dfs(int x,int a){
    if(x==tt||!a)return a;
    int F=0,f;
    for(int &i=cur[x];~i;i=Next[i]){
        int u=to[i];
        if(flow[i]&&d[u]==d[x]+1&&(f=dfs(u,min(a,flow[i])))>0){
            flow[i]-=f;
            flow[i^1]+=f;
            F+=f;
            a-=f;
            if(!a)return F;
        }
    }
    return F;
}
inline int dinic(){
    int F=0;
    while(bfs()){
        for(int i=0;i<=n+1;++i)cur[i]=head[i];
        F+=dfs(ss,inf);
    }
    return F;
}
int main(){
    memset(head,-1,sizeof(head));
    n=read();m=read();s=read();t=read();ss=0;tt=n+1;
    for(int i=1;i<=m;++i){
        int x=read(),y=read(),lower=read(),upper=read();
        ins(x,y,lower,upper);
    }
    int ans=0;
    dinic();
    addedge(t,s,inf);ans=tot-1;
    dinic();
    bool flag=1;
    for(int i=1;i<=sum;++i){
        if(flow[check1[i]]||flow[check2[i]]){flag=0;break;}
    }
    if(!flag){puts("please go home to sleep");return 0;}
    printf("%d",inf-flow[ans]);
    return 0;
}