LightOJ 1367 Pizza and Inner Peace 有源汇有上下界的可行流

题目：http://www.lightoj.com/volume_showproblem.php?problem=1367

题意：题意很复杂的样子。。。大意就是从1运送一些物品到n，这n个点之间有m条单向边，物品通过每条边时要求数量在一个区间[L, C]内，否则不能通过，问能不能从1运送物品到n，如果能，输出每条边上通过的物品数量，多解的话输出任意一个结果

思路：典型的有源汇有上下界的可行流，不多说

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define debug() puts("here");
using namespace std;

const int N = 210;
const int INF = 0x3f3f3f3f;
struct edge
{
    int to, cap, id, next;
} g[N*N*2];
int cnt, nv, head[N], level[N], gap[N], cur[N], pre[N];
int du[N], dn[N*N], id[N*N];
int cas;
void add_edge(int v, int u, int cap)
{
    g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
    g[cnt].to = v, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
int sap(int s, int t)
{
    memset(level, 0, sizeof level);
    memset(gap, 0, sizeof gap);
    memcpy(cur, head, sizeof head);
    gap[0] = nv;
    int v = pre[s] = s, flow = 0, aug = INF;
    while(level[s] < nv)
    {
        bool flag = false;
        for(int &i = cur[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && level[v] == level[u] + 1)
            {
                flag = true;
                pre[u] = v;
                v = u;
                aug = min(aug, g[i].cap);
                if(v == t)
                {
                    flow += aug;
                    while(v != s)
                    {
                        v = pre[v];
                        g[cur[v]].cap -= aug;
                        g[cur[v]^1].cap += aug;
                    }
                    aug = INF;
                }
                break;
            }
        }
        if(flag) continue;
        int minlevel = nv;
        for(int i = head[v]; i != -1; i = g[i].next)
        {
            int u = g[i].to;
            if(g[i].cap > 0 && minlevel > level[u])
                minlevel = level[u], cur[v] = i;
        }
        if(--gap[level[v]] == 0) break;
        level[v] = minlevel + 1;
        gap[level[v]]++;
        v = pre[v];
    }
    return flow;
}
int main()
{
    int t, n, m, a, b, c, d;
    scanf("%d", &t);
    while(t--)
    {
        cnt = 0;
        memset(head, -1, sizeof head);
        memset(du, 0, sizeof du);
        memset(dn, 0, sizeof dn);
        memset(id, 0, sizeof id);
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d%d%d", &a, &b, &c, &d);
            du[a] -= c, du[b] += c, dn[i] = c;
            add_edge(a, b, d - c);
            id[i] = cnt - 1;
        }
        int vs = 0, vt = n + 1, sum = 0;
        for(int i = 1; i <= n; i++)
        {
            if(du[i] > 0) add_edge(vs, i, du[i]), sum += du[i];
            if(du[i] < 0) add_edge(i, vt, -du[i]);
        }
        nv = vt + 1;
        add_edge(n, 1, INF);
        int res = sap(vs, vt);
        if(res != sum) printf("Case %d: no\n", ++cas);
        else
        {
            printf("Case %d: yes\n", ++cas);
//注释掉的这两句执行后，求得是有源汇有上下界的最大流，本题中也对，因为也是一个可行流
//            head[vs] = head[vt] = -1;
//            sap(1, n);
            for(int i = 1; i <= m; i++)
                printf("%d\n", g[id[i]].cap + dn[i]);
        }
    }
    return 0;
}