ZOJ 2314 Reactor Cooling (无源汇有上下界的最大流)

模板题

推荐一篇论文： 论文点这里油

代码： 

#include<bits/stdc++.h>

using namespace std;
const int N =405;
const int inf =0x3f3f3f3f;

struct Edge
{
    int from,to,cap,flow;
    Edge(int u,int v,int c,int f):from(f),to(v),cap(c),flow(f){}
};
int n,m;


struct Dinic
{
    int n,m,s,t;
    vector< Edge >edges;
    vector< int >G[N];
    bool vis[N];
    int d[N];
    int cur[N];

    void init()
    {
        for (int i=0; i<N; i++)
            G[i].clear();
        edges.clear();
    }


    void addedge(int from,int to,int cap)
    {
        edges.push_back(Edge(from,to,cap,0));
        edges.push_back(Edge(to,from,0,0));
        m=edges.size();
        G[from].push_back(m-2);
        G[to].push_back(m-1);
    }

    bool bfs()
    {
        memset(vis,0,sizeof(vis));
        queue<int >q;
        for (int i=0; i<N; i++) d[i] = inf;
        q.push(s); d[s]=0;vis[s]=1;
        while(!q.empty()){
            int x=q.front(); q.pop();
            for(int i=0;i<G[x].size();i++){
                Edge e=edges[G[x][i]];
                if(!vis[e.to]&&e.cap>e.flow){
                    vis[e.to]=1;
                    d[e.to]=d[x]+1;
                    q.push(e.to);
                }
            }
        }
        return vis[t];
    }

    int dfs(int x,int a)
    {
        if(x==t||a==0) return a;
        int flow=0,f;
        for(int &i=cur[x];i<G[x].size();i++){
            Edge &e=edges[G[x][i]];
            if(d[x]+1==d[e.to]&&(f=dfs(e.to,min(a,e.cap-e.flow)))>0){
                e.flow+=f;
                edges[G[x][i]^1].flow-=f;
                flow+=f;
                a-=f;
                if(a==0) break;
            }
        }
        return flow;
    }

    int maxflow(int s,int t)
    {
        this->s=s; this->t=t;
        int flow=0;
        while(bfs()){
            memset(cur,0,sizeof(cur));
            flow+=dfs(s,inf);
        }

        return flow;
    }

}a;



int in[N];
int out[N];
int be[100005];
int up[100005];

void init()
{
    a.init();
    memset(in,0,sizeof(in));
    memset(out,0,sizeof(out));
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d %d",&n,&m);
        int u,v;
        init();
        for(int i=1;i<=m;i++){
            scanf("%d %d %d %d",&u,&v,&be[i],&up[i]);
            a.addedge(u,v,up[i]-be[i]);
            out[u]+=be[i];
            in[v]+=be[i];
        }

        int SS;
        int TT;
        SS=n+1; TT=n+2;
        for(int i=1;i<=n;i++){
            int jud=in[i]-out[i];
            if(jud>0){
                a.addedge(SS,i,jud);
            }
            else{
                a.addedge(i,TT,-jud);
            }
        }
        for(int i=0;i<a.G[SS].size();i++){
            int id=a.G[SS][i];
        }
        a.maxflow(SS,TT);
        int f=0;
        for(int i=0;i<a.G[SS].size();i++){
            int id=a.G[SS][i];
            if(a.edges[id].cap!=a.edges[id].flow){
                f=1; break;
            }
        }

        if(f) printf("NO\n");
        else{
            printf("YES\n");
            for(int i=1;i<=m;i++){
                printf("%d\n",a.edges[(i-1)*2].flow+be[i]);
            }
        }

    }

    return 0;
}

/*

1
4 6
1 2 1 3
2 3 1 3
3 4 1 3
4 1 1 3
1 3 1 3
4 2 1 3


*/