POJ 2396 Budget 有源汇有上下界的可行流

题目：http://poj.org/problem?id=2396

题意：假定有一个n * m的数字矩阵，现在给出矩阵的每一行的和与每一列的和，且给出了一些矩阵中元素需要满足的条件，即某个元素应该在某个范围内，问有没有满足条件的矩阵，若有输出这个矩阵

思路：有源汇有上下界的可行流。记录每个元素的最大下界，最小上界，元素就在这个范围内，没被限制的就是无穷大。从源点向每一行连边，容量为每一行的和，从每一列向汇点连边，容量为每一列的和。然后根据之前记录的每个元素的上下界，对行和列连边。然后添加附加源点和汇点，跑最大流，按次序输出行和列连边的反向弧的容量

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

const int N = 310;
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];
int low[210][50], up[210][50];
int n, m, ss, tt;
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;
}
void work(int i, int j, char c, int d)
{
    if(c == '=') low[i][j] = max(low[i][j], d), up[i][j] = min(up[i][j], d);
    else if(c == '>') low[i][j] = max(low[i][j], d + 1);
    else if(c == '<') up[i][j] = min(up[i][j], d - 1);
}
bool build()
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            if(low[i][j] > up[i][j]) return false;
            else
            {
                du[i] -= low[i][j], du[n+j] += low[i][j];
                add_edge(i, n + j, up[i][j] - low[i][j]);
            }
    return true;
}
void solve()
{
    int vs = n + m + 2, vt = n + m + 3;
    int sum = 0;
    for(int i = 0; i <= tt; i++)
    {
        if(du[i] > 0) add_edge(vs, i, du[i]), sum += du[i];
        if(du[i] < 0) add_edge(i, vt, -du[i]);
    }
    add_edge(tt, ss, INF);
    nv = vt + 1;
    int tmp = sap(vs, vt);
    if(tmp != sum) printf("IMPOSSIBLE\n\n");
    else
    {
        int res[N][N];
        for(int i = 1; i <= n; i++)
            for(int j = head[i]; j != -1; j = g[j].next)
                res[i][g[j].to-n] = g[j^1].cap;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                printf("%d%c", res[i][j] + low[i][j], j == m ? '\n' : ' ');
        printf("\n");
    }
}
int main()
{
    int t, q, a, b, d;
    char c;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d", &n, &m);
        ss = 0, tt = n + m + 1;
        cnt = 0;
        memset(head, -1, sizeof head);
        memset(du, 0, sizeof du);
        memset(low, 0, sizeof low);
        memset(up, 0x3f, sizeof up);
        int sum1 = 0, sum2 = 0;
        for(int i = 1; i <= n; i++) scanf("%d", &a), du[ss] -= a, du[i] += a, sum1 += a;
        for(int i = 1; i <= m; i++) scanf("%d", &a), du[i+n] -= a, du[tt] += a, sum2 += a;
        scanf("%d", &q);
        while(q--)
        {
            scanf("%d %d %c %d", &a, &b, &c, &d);
            if(a == 0 && b == 0)
            {
                for(int i = 1; i <= n; i++)
                    for(int j = 1; j <= m; j++)
                        work(i, j, c, d);
            }
            else if(a == 0)
                for(int i = 1; i <= n; i++) work(i, b, c, d);
            else if(b == 0)
                for(int i = 1; i <= m; i++) work(a, i, c, d);
            else
                work(a, b, c, d);
        }
        if(sum1 == sum2 && build()) solve();
        else printf("IMPOSSIBLE\n\n");
    }
    return 0;
}