poj2396 Budget

有源汇上下界网络流问题。这里求的只是一个可行流。嗯，感觉没什么好说的。
注意范围。

#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
const int MAXN = 200+5;
const int MAXM = 20+5;
const int inf = 1e9;
int n,m;
int s,e;
int low[MAXN][MAXM],high[MAXN][MAXM];
int f[MAXN+MAXM];

struct node
{
    int u,v,f;
    int next;
} edge[100005];

int head[MAXN+MAXM];
int cnt;
void add(int u,int v,int f)
{
    edge[cnt].u=u;
    edge[cnt].v=v;
    edge[cnt].f=f;
    edge[cnt].next=head[u];
    head[u]=cnt++;
    edge[cnt].u=v;
    edge[cnt].v=u;
    edge[cnt].f=0;
    edge[cnt].next=head[v];
    head[v]=cnt++;
}

int dis[MAXN+MAXM];
int bfs(int s,int t)
{
    int u, v ;
    memset(dis,-1,sizeof(dis));
    dis[s] = 0 ;
    queue<int>q;
    q.push(s) ;
    while( !q.empty() )
    {
        u = q.front();
        q.pop();
        for(int i = head[u] ; i != -1 ; i = edge[i].next)
        {
            v = edge[i].v ;
            if( dis[v] == -1 && edge[i].f )
            {
                dis[v] = dis[u] + 1 ;
                q.push(v) ;
            }
        }
    }
    if( dis[t] > 0 )
        return 1 ;
    return 0 ;
}
int dfs(int s,int t,int min1)
{
    if( s == t )
        return min1 ;
    int  flow, ans = 0 ;
    for(int i = head[s] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].v ;
        if( dis[v] == dis[s] + 1 && edge[i].f && (flow = dfs(v,t,min(min1,edge[i].f) ) ) )
        {
            edge[i].f -= flow ;
            edge[i^1].f += flow ;
            ans += flow ;
            min1 -= flow ;
            if( !min1 )
                break;
        }
    }
    if( ans )
        return ans ;
    dis[s] = -1 ;
    return 0;
}
int getMaxFlow(int s,int e)
{
    int maxFlow=0,flow;
    while(bfs(s,e))
    {
        while((flow=dfs(s,e,inf))>0)
            maxFlow+=flow;
    }
    return maxFlow;
}

void init()
{
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
    {
        low[i][j] = 0;
        high[i][j] = inf;
    }
    cnt = 0;
    memset(head, -1 ,sizeof head);
    memset(f,0,sizeof f);
}

bool build()
{
   for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
   {
       if(low[i][j] > high[i][j])return 0;
       f[i] -= low[i][j];
       f[j+n] += low[i][j];
       add(i,j+n,high[i][j] - low[i][j]);
   }
   return 1;
}
void get_ans()
{
    int ss = e + 1, ee = e + 2;
    int sum = 0;
    for(int i = 0; i <= e; ++i)
    {
        if(f[i] > 0)add(ss,i,f[i]),sum += f[i];
        else add(i,ee,-f[i]);
    }
    add(e,s,inf);
    if(getMaxFlow(ss,ee) == sum)
    {
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= m; ++j)printf(j == m?"%d\n":"%d ",edge[((i-1)*m+j-1)*2+1].f + low[i][j]);
    }
    else puts("IMPOSSIBLE");
    puts("");
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        s = 0,e = n+m+1;
        init();
        int x;
        int sum1 = 0,sum2 = 0;
        for(int i = 1; i <= n; ++i)
        {
            scanf("%d",&x);
            f[s] -= x;
            f[i] += x;
            sum1 += x;
        }
        for(int i = 1; i <= m; ++i)
        {
            scanf("%d",&x);
            f[i+n] -= x;
            f[e] += x;
            sum2 += x;
        }
        int limit;
        scanf("%d",&limit);
        int u,v;
        char op[2];
        while(limit--)
        {
            scanf("%d%d%s%d",&u,&v,op,&x);
            int l1 = u,r1 = u,l2 = v,r2 = v;
            if(!u)l1 = 1,r1 = n;
            if(!v)l2 = 1,r2 = m;
            for(int i = l1; i <= r1; ++i)
                for(int j = l2; j <= r2; ++j)
            {
                if(op[0] == '=')low[i][j] = max(low[i][j],x),high[i][j] = min(high[i][j],x);
                else if(op[0] == '>')low[i][j] = max(x+1,low[i][j]);
                else high[i][j] = min(high[i][j],x-1);
            }
        }
        if(sum1 == sum2 && build())get_ans();
        else puts("IMPOSSIBLE\n");
    }
    return 0;
}