zoj 2314(无源汇上下界可行流)

Reactor Cooling

---

Time Limit: 5 Seconds      Memory Limit: 32768 KB      Special Judge

---

The terrorist group leaded by a well known international terrorist Ben Bladen is buliding a nuclear reactor to produce plutonium for the nuclear bomb they are planning to create. Being the wicked computer genius of this group, you are responsible for developing the cooling system for the reactor.

The cooling system of the reactor consists of the number of pipes that special cooling liquid flows by. Pipes are connected at special points, called nodes, each pipe has the starting node and the end point. The liquid must flow by the pipe from its start point to its end point and not in the opposite direction.

Let the nodes be numbered from 1 to N. The cooling system must be designed so that the liquid is circulating by the pipes and the amount of the liquid coming to each node (in the unit of time) is equal to the amount of liquid leaving the node. That is, if we designate the amount of liquid going by the pipe from i-th node to j-th as f_ij, (put f_ij = 0 if there is no pipe from node i to node j), for each i the following condition must hold:

f_i,1+f_i,2+...+f_i,N = f_1,i+f_2,i+...+f_N,i

Each pipe has some finite capacity, therefore for each i and j connected by the pipe must be f_ij <= c_ij where cij is the capacity of the pipe. To provide sufficient cooling, the amount of the liquid flowing by the pipe going from i-th to j-th nodes must be at least l_ij, thus it must be f_ij >= l_ij.

Given cij and l_ij for all pipes, find the amount f_ij, satisfying the conditions specified above.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

Input

The first line of the input file contains the number N (1 <= N <= 200) - the number of nodes and and M - the number of pipes. The following M lines contain four integer number each - i, j, lij and cij each. There is at most one pipe connecting any two nodes and 0 <= l_ij <= c_ij <= 10^5 for all pipes. No pipe connects a node to itself. If there is a pipe from i-th node to j-th, there is no pipe from j-th node to i-th.

Output

On the first line of the output file print YES if there is the way to carry out reactor cooling and NO if there is none. In the first case M integers must follow, k-th number being the amount of liquid flowing by the k-th pipe. Pipes are numbered as they are given in the input file.

Sample Input

2

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

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

Sample Input

NO

YES
1
2
3
2
1
1

---

Author: Andrew Stankevich

Source: Andrew Stankevich's Contest #1

题目：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2314

分析：题目要求一个满足上下界的可行流，没有给出源和汇

增加源和汇，所有边按照上界-下界作为上界，无下界建图，然后所有点的流入和流出统计，点流入的与源连上容量为流入量的边，流出的连上汇就行，做一次最大流，如果所有连接源点的边都满流就是有解，否则无解，解即当前边的流量加上原来的下界

好久没做网络流，居然1A。。。

代码：

#include<cstdio>#define min(a,b) (a<b?a:b)using namespace std;const int mm=88888;const int mn=222;const int oo=1000000000;int node,src,dest,edge;int ver[mm],low[mm],flow[mm],next[mm];int head[mn],work[mn],q[mn],dis[mn],in[mn];inline void prepare(int _node,int _src,int _dest){    node=_node,src=_src,dest=_dest;    for(int i=0;i<node;++i)head[i]=-1,in[i]=0;    edge=0;}inline void addedge(int u,int v,int c){    ver[edge]=v,flow[edge]=c,next[edge]=head[u],head[u]=edge++;    ver[edge]=u,flow[edge]=0,next[edge]=head[v],head[v]=edge++;}bool Dinic_bfs(){    int i,u,v,l,r=0;    for(i=0;i<node;++i)dis[i]=-1;    dis[q[r++]=src]=0;    for(l=0;l<r;++l)        for(i=head[u=q[l]];i>=0;i=next[i])            if(flow[i]&&dis[v=ver[i]]<0)            {                dis[q[r++]=v]=dis[u]+1;                if(v==dest)return 1;            }    return 0;}int Dinic_dfs(int u,int exp){    if(u==dest)return exp;    for(int &i=work[u],v,tmp;i>=0;i=next[i])        if(flow[i]&&dis[v=ver[i]]==dis[u]+1&&(tmp=Dinic_dfs(v,min(exp,flow[i])))>0)        {            flow[i]-=tmp;            flow[i^1]+=tmp;            return tmp;        }    return 0;}void Dinic_flow(){    while(Dinic_bfs())    {        for(int i=0;i<node;++i)work[i]=head[i];        while(Dinic_dfs(src,oo));    }}bool Limit_flow(){    int i;    for(i=0;i<node;++i)    {        if(in[i]>0)addedge(src,i,in[i]);        if(in[i]<0)addedge(i,dest,-in[i]);    }    Dinic_flow();    for(i=head[src];i>=0;i=next[i])        if(flow[i])return 0;    return 1;}int main(){    int i,u,v,c,n,m,t;    scanf("%d",&t);    while(t--)    {        scanf("%d%d",&n,&m);        prepare(n+2,0,n+1);        for(i=0;i<m;++i)        {            scanf("%d%d%d%d",&u,&v,&low[i],&c);            in[u]-=low[i],in[v]+=low[i];            addedge(u,v,c-low[i]);        }        if(Limit_flow())        {            printf("YES\n");            for(i=0;i<m;++i)printf("%d\n",flow[(i<<1)^1]+low[i]);        }        else printf("NO\n");        puts("");    }    return 0;}