算是一个无源无汇上下界网络流的模版

---

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

算是一个无源无汇上下界网络流的模版

#include<stdio.h>
#include<string.h>
const int MAX=100005;
const int INF=1000000000;
struct EDGE
{
    int v,c,next;
}edge[1000000];
int E,head[MAX];
int gap[MAX],cur[MAX];
int pre[MAX],dis[MAX];
int in[225],low[50000];
void add_edge(int s,int t,int c,int cc)
{
    edge[E].v=t; edge[E].c=c;
    edge[E].next=head[s];
    head[s]=E++;
    edge[E].v=s; edge[E].c=cc;
    edge[E].next=head[t];
    head[t]=E++;
}
int min(int a,int b){return (a==-1||b<a)?b:a;}
int SAP(int s,int t,int n)
{
    memset(gap,0,sizeof(gap));
    memset(dis,0,sizeof(dis));
    int i;
    for(i=0;i<n;i++)cur[i]=head[i];
    int u=pre[s]=s,maxflow=0,aug=-1,v;
    gap[0]=n;    
    while(dis[s]<n)
    {
loop:    for(i=cur[u];i!=-1;i=edge[i].next)
        {
            v=edge[i].v;
            if(edge[i].c>0&&dis[u]==dis[v]+1)
            {
                aug=min(aug,edge[i].c);
                pre[v]=u;
                cur[u]=i;
                u=v;
                if(u==t)
                {
                    for(u=pre[u];v!=s;v=u,u=pre[u])
                    {
                        edge[cur[u]].c-=aug;
                        edge[cur[u]^1].c+=aug;
                    }
                    maxflow+=aug;
                    aug=-1;
                }
                goto loop;
            }
        }
        int mindis=n;
        for(i=head[u];i!=-1;i=edge[i].next)
        {
            v=edge[i].v;
            if(edge[i].c>0&&dis[v]<mindis)
            {
                cur[u]=i;
                mindis=dis[v];
            }
        }
        if((--gap[dis[u]])==0)break;
        gap[dis[u]=mindis+1]++;
        u=pre[u];
    }
    return maxflow;
}
bool solve(int n)
{
    for(int i=1;i<=n;i++)
    {
        if(in[i]>0) add_edge(0,i,in[i],0);
        if(in[i]<0) add_edge(i,n+1,-in[i],0);
    }
    SAP(0,n+1,n+2);
    for(int i=head[0];i!=-1;i=edge[i].next)//从源点出发的边都满流
    {
        if(edge[i].c) return false;
    }
    return true;
}
int main()
{
    int t,n,m,a,b,c;
    scanf("%d",&t);
    while(t--)
    {
        E=0;
        memset(head,-1,sizeof(head));
        memset(in,0,sizeof(in));
        scanf("%d%d",&n,&m);
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d%d",&a,&b,&low[i],&c);
            in[a]-=low[i],in[b]+=low[i];
            add_edge(a,b,c-low[i],0);
        }
        if(solve(n))
        {
            printf("YES\n");
            for(int i=0;i<m;i++)
            printf("%d\n",edge[(i<<1)^1].c+low[i]);//反向的流即自由流，再加上下界的流
        }
        else printf("NO\n");
        puts("");
    }
    return 0;
}

#include <iostream>

#include <algorithm>

#include <cstring>

#include <string>

#include <cstdio>

#include <cmath>

#include <queue>

#include <map>

#include <set>

#define MAXN 555

#define MAXM 555555

#define INF 1000000007

using namespace std;

struct node

{

    int ver;    // vertex

    int cap;    // capacity

    int flow;   // current flow in this arc

    int next, rev;

}edge[MAXM];

int dist[MAXN], numbs[MAXN], src, des, n;

int head[MAXN], e;

void add(int x, int y, int c)

{       //e记录边的总数

    edge[e].ver = y;

    edge[e].cap = c;

    edge[e].flow = 0;

    edge[e].rev = e + 1;        //反向边在edge中的下标位置

    edge[e].next = head[x];   //记录以x为起点的上一条边在edge中的下标位置

    head[x] = e++;           //以x为起点的边的位置

    //反向边

    edge[e].ver = x;

    edge[e].cap = 0;  //反向边的初始容量为0

    edge[e].flow = 0;

    edge[e].rev = e - 1;

    edge[e].next = head[y];

    head[y] = e++;

}

void rev_BFS()

{

    int Q[MAXN], qhead = 0, qtail = 0;

    for(int i = 1; i <= n; ++i)

    {

        dist[i] = MAXN;

        numbs[i] = 0;

    }

    Q[qtail++] = des;

    dist[des] = 0;

    numbs[0] = 1;

    while(qhead != qtail)

    {

        int v = Q[qhead++];

        for(int i = head[v]; i != -1; i = edge[i].next)

        {

            if(edge[edge[i].rev].cap == 0 || dist[edge[i].ver] < MAXN)continue;

            dist[edge[i].ver] = dist[v] + 1;

            ++numbs[dist[edge[i].ver]];

            Q[qtail++] = edge[i].ver;

        }

    }

}

void init()

{

    e = 0;

    memset(head, -1, sizeof(head));

}

int maxflow()

{

    int u, totalflow = 0;

    int Curhead[MAXN], revpath[MAXN];

    for(int i = 1; i <= n; ++i)Curhead[i] = head[i];

    u = src;

    while(dist[src] < n)

    {

        if(u == des)     // find an augmenting path

        {

            int augflow = INF;

            for(int i = src; i != des; i = edge[Curhead[i]].ver)

                augflow = min(augflow, edge[Curhead[i]].cap);

            for(int i = src; i != des; i = edge[Curhead[i]].ver)

            {

                edge[Curhead[i]].cap -= augflow;

                edge[edge[Curhead[i]].rev].cap += augflow;

                edge[Curhead[i]].flow += augflow;

                edge[edge[Curhead[i]].rev].flow -= augflow;

            }

            totalflow += augflow;

            u = src;

        }

        int i;

        for(i = Curhead[u]; i != -1; i = edge[i].next)

            if(edge[i].cap > 0 && dist[u] == dist[edge[i].ver] + 1)break;

        if(i != -1)     // find an admissible arc, then Advance

        {

            Curhead[u] = i;

            revpath[edge[i].ver] = edge[i].rev;

            u = edge[i].ver;

        }

        else        // no admissible arc, then relabel this vertex

        {

            if(0 == (--numbs[dist[u]]))break;    // GAP cut, Important!

            Curhead[u] = head[u];

            int mindist = n;

            for(int j = head[u]; j != -1; j = edge[j].next)

                if(edge[j].cap > 0)mindist = min(mindist, dist[edge[j].ver]);

            dist[u] = mindist + 1;

            ++numbs[dist[u]];

            if(u != src)

                u = edge[revpath[u]].ver;    // Backtrack

        }

    }

    return totalflow;

}

int xj[MAXN];

int nt, m;

int low[MAXM];

void solve()

{

    for(int i = head[src]; i != -1; i = edge[i].next)

        if(edge[i].cap > 0)

        {

            printf("NO\n");

            return;

        }

    printf("YES\n");

    for(int i = 0; i < m; i++)

        printf("%d\n", edge[i * 2].flow + low[i + 1]);

}

int main()

{

    int u, v, up;

    //freopen("in.txt","r",stdin);

    int kcase;

    scanf("%d",&kcase);

    while(kcase--)

    {

        scanf("%d%d",&nt,&m);

        init();

        memset(xj, 0, sizeof(xj));

        for(int i = 1; i <= m; i++)

        {

            scanf("%d%d%d%d", &u, &v, &low[i], &up);

            add(u, v, up - low[i]);

            xj[v] += low[i];

            xj[u] -= low[i];

        }

        src = nt + 1;

        des = nt + 2;

        n = des;

        for(int i = 1; i <= nt; i++)

            if(xj[i] > 0) add(src, i, xj[i]);

            else if(xj[i] < 0) add(i, des, -xj[i]);

        rev_BFS();

        maxflow();

        solve();

        cout<<endl;

    }

    return 0;

}